./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product30.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product30.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 15275a4436f6ed835fc824ec788a3589ee34ef53cd98082c25cb994e481acd9a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:04:03,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:04:03,876 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:04:03,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:04:03,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:04:03,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:04:03,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:04:03,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:04:03,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:04:03,902 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:04:03,905 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:04:03,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:04:03,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:04:03,909 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:04:03,910 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:04:03,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:04:03,910 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:04:03,911 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:04:03,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:04:03,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:04:03,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:04:03,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:04:03,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:04:03,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:04:03,913 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:04:03,913 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:04:03,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:04:03,914 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:04:03,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:04:03,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:04:03,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:04:03,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:04:03,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:04:03,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:04:03,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:04:03,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:04:03,917 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:04:03,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:04:03,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:04:03,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:04:03,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:04:03,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:04:03,918 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 15275a4436f6ed835fc824ec788a3589ee34ef53cd98082c25cb994e481acd9a [2024-10-14 03:04:04,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:04:04,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:04:04,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:04:04,185 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:04:04,186 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:04:04,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product30.cil.c [2024-10-14 03:04:05,674 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:04:05,981 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:04:05,982 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product30.cil.c [2024-10-14 03:04:06,004 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f2c1ea5e/1a72e7e6e72444ba9cb08fbebbdecf87/FLAG416bbaaeb [2024-10-14 03:04:06,020 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f2c1ea5e/1a72e7e6e72444ba9cb08fbebbdecf87 [2024-10-14 03:04:06,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:04:06,024 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:04:06,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:04:06,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:04:06,033 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:04:06,034 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:04:06" (1/1) ... [2024-10-14 03:04:06,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cb20648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:04:06, skipping insertion in model container [2024-10-14 03:04:06,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:04:06" (1/1) ... [2024-10-14 03:04:06,103 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:04:06,394 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product30.cil.c[7858,7871] [2024-10-14 03:04:06,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:04:06,712 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:04:06,726 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2024-10-14 03:04:06,728 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptAutoResponder_spec.i","") [363] [2024-10-14 03:04:06,728 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [407] [2024-10-14 03:04:06,728 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [416] [2024-10-14 03:04:06,728 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [563] [2024-10-14 03:04:06,728 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [598] [2024-10-14 03:04:06,729 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [964] [2024-10-14 03:04:06,729 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1180] [2024-10-14 03:04:06,730 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1545] [2024-10-14 03:04:06,730 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1562] [2024-10-14 03:04:06,731 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2629] [2024-10-14 03:04:06,768 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product30.cil.c[7858,7871] [2024-10-14 03:04:06,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:04:06,888 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:04:06,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:04:06 WrapperNode [2024-10-14 03:04:06,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:04:06,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:04:06,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:04:06,891 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:04:06,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:04:06" (1/1) ... [2024-10-14 03:04:06,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:04:06" (1/1) ... [2024-10-14 03:04:06,994 INFO L138 Inliner]: procedures = 132, calls = 207, calls flagged for inlining = 61, calls inlined = 51, statements flattened = 925 [2024-10-14 03:04:06,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:04:06,995 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:04:06,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:04:06,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:04:07,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:04:06" (1/1) ... [2024-10-14 03:04:07,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:04:06" (1/1) ... [2024-10-14 03:04:07,012 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:04:06" (1/1) ... [2024-10-14 03:04:07,044 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-10-14 03:04:07,044 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:04:06" (1/1) ... [2024-10-14 03:04:07,045 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:04:06" (1/1) ... [2024-10-14 03:04:07,064 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:04:06" (1/1) ... [2024-10-14 03:04:07,076 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:04:06" (1/1) ... [2024-10-14 03:04:07,084 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:04:06" (1/1) ... [2024-10-14 03:04:07,096 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:04:06" (1/1) ... [2024-10-14 03:04:07,108 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:04:07,112 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:04:07,112 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:04:07,112 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:04:07,113 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:04:06" (1/1) ... [2024-10-14 03:04:07,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:04:07,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:04:07,152 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 03:04:07,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 03:04:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-10-14 03:04:07,216 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-10-14 03:04:07,216 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-10-14 03:04:07,216 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-10-14 03:04:07,216 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-10-14 03:04:07,216 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-10-14 03:04:07,216 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-14 03:04:07,217 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-14 03:04:07,218 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-14 03:04:07,218 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-14 03:04:07,218 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-14 03:04:07,218 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-14 03:04:07,218 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-14 03:04:07,219 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-14 03:04:07,220 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-10-14 03:04:07,220 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-10-14 03:04:07,220 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-14 03:04:07,220 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-14 03:04:07,221 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-14 03:04:07,222 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-14 03:04:07,222 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-14 03:04:07,222 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-14 03:04:07,222 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-14 03:04:07,222 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-14 03:04:07,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:04:07,222 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-14 03:04:07,222 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-14 03:04:07,222 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-10-14 03:04:07,222 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-10-14 03:04:07,223 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-14 03:04:07,223 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-14 03:04:07,223 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-14 03:04:07,223 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-14 03:04:07,224 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-14 03:04:07,224 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-14 03:04:07,224 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-10-14 03:04:07,224 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-10-14 03:04:07,224 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-14 03:04:07,224 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-14 03:04:07,225 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-10-14 03:04:07,225 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-10-14 03:04:07,225 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-14 03:04:07,225 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-14 03:04:07,225 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-14 03:04:07,225 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-14 03:04:07,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:04:07,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 03:04:07,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 03:04:07,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 03:04:07,226 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-14 03:04:07,227 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-14 03:04:07,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:04:07,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:04:07,453 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:04:07,455 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:04:08,416 INFO L? ?]: Removed 432 outVars from TransFormulas that were not future-live. [2024-10-14 03:04:08,417 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:04:08,473 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:04:08,474 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 03:04:08,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:04:08 BoogieIcfgContainer [2024-10-14 03:04:08,474 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:04:08,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:04:08,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:04:08,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:04:08,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:04:06" (1/3) ... [2024-10-14 03:04:08,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a09b0ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:04:08, skipping insertion in model container [2024-10-14 03:04:08,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:04:06" (2/3) ... [2024-10-14 03:04:08,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a09b0ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:04:08, skipping insertion in model container [2024-10-14 03:04:08,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:04:08" (3/3) ... [2024-10-14 03:04:08,488 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec8_product30.cil.c [2024-10-14 03:04:08,506 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:04:08,506 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:04:08,584 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:04:08,591 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@16d20a23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:04:08,592 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:04:08,599 INFO L276 IsEmpty]: Start isEmpty. Operand has 320 states, 242 states have (on average 1.5743801652892562) internal successors, (381), 246 states have internal predecessors, (381), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-14 03:04:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 03:04:08,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:04:08,617 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:04:08,618 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:04:08,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:04:08,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1024459576, now seen corresponding path program 1 times [2024-10-14 03:04:08,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:04:08,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448766697] [2024-10-14 03:04:08,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:08,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:04:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:09,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:04:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:09,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:04:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:09,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:04:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:09,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:04:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:09,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:04:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:09,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:04:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:09,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:04:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:09,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 03:04:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:09,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 03:04:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:09,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 03:04:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:09,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 03:04:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:09,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 03:04:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:09,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:04:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:09,375 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 03:04:09,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:04:09,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448766697] [2024-10-14 03:04:09,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448766697] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:04:09,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657598477] [2024-10-14 03:04:09,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:09,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:04:09,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:04:09,380 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:04:09,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 03:04:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:09,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 1007 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 03:04:09,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:04:09,739 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 03:04:09,739 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:04:09,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657598477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:04:09,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:04:09,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-14 03:04:09,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202840777] [2024-10-14 03:04:09,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:04:09,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:04:09,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:04:09,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:04:09,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:04:09,777 INFO L87 Difference]: Start difference. First operand has 320 states, 242 states have (on average 1.5743801652892562) internal successors, (381), 246 states have internal predecessors, (381), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:04:09,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:04:09,903 INFO L93 Difference]: Finished difference Result 495 states and 737 transitions. [2024-10-14 03:04:09,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:04:09,906 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 95 [2024-10-14 03:04:09,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:04:09,927 INFO L225 Difference]: With dead ends: 495 [2024-10-14 03:04:09,927 INFO L226 Difference]: Without dead ends: 317 [2024-10-14 03:04:09,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:04:09,933 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:04:09,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 469 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:04:09,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-14 03:04:09,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2024-10-14 03:04:09,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 240 states have (on average 1.5583333333333333) internal successors, (374), 243 states have internal predecessors, (374), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 03:04:09,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 479 transitions. [2024-10-14 03:04:10,002 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 479 transitions. Word has length 95 [2024-10-14 03:04:10,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:04:10,005 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 479 transitions. [2024-10-14 03:04:10,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:04:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 479 transitions. [2024-10-14 03:04:10,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-14 03:04:10,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:04:10,011 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:04:10,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:04:10,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-14 03:04:10,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:04:10,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:04:10,213 INFO L85 PathProgramCache]: Analyzing trace with hash 961480731, now seen corresponding path program 1 times [2024-10-14 03:04:10,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:04:10,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432503833] [2024-10-14 03:04:10,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:10,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:04:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:10,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:04:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:10,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:04:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:10,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:04:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:10,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:04:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:10,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:04:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:10,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:04:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:10,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 03:04:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:10,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 03:04:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:10,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 03:04:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:10,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 03:04:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:10,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 03:04:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:10,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 03:04:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:10,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 03:04:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:10,577 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 03:04:10,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:04:10,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432503833] [2024-10-14 03:04:10,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432503833] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:04:10,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919349329] [2024-10-14 03:04:10,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:10,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:04:10,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:04:10,582 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:04:10,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 03:04:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:10,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 1008 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 03:04:10,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:04:10,949 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 03:04:10,949 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:04:10,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919349329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:04:10,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:04:10,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-14 03:04:10,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353914739] [2024-10-14 03:04:10,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:04:10,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:04:10,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:04:10,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:04:10,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:04:10,953 INFO L87 Difference]: Start difference. First operand 317 states and 479 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:04:11,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:04:11,033 INFO L93 Difference]: Finished difference Result 491 states and 724 transitions. [2024-10-14 03:04:11,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:04:11,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 96 [2024-10-14 03:04:11,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:04:11,038 INFO L225 Difference]: With dead ends: 491 [2024-10-14 03:04:11,039 INFO L226 Difference]: Without dead ends: 319 [2024-10-14 03:04:11,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:04:11,042 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 0 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:04:11,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 931 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:04:11,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-14 03:04:11,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2024-10-14 03:04:11,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 242 states have (on average 1.5537190082644627) internal successors, (376), 245 states have internal predecessors, (376), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 03:04:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 481 transitions. [2024-10-14 03:04:11,082 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 481 transitions. Word has length 96 [2024-10-14 03:04:11,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:04:11,083 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 481 transitions. [2024-10-14 03:04:11,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:04:11,085 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 481 transitions. [2024-10-14 03:04:11,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 03:04:11,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:04:11,089 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:04:11,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 03:04:11,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-14 03:04:11,290 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:04:11,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:04:11,291 INFO L85 PathProgramCache]: Analyzing trace with hash 456916856, now seen corresponding path program 1 times [2024-10-14 03:04:11,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:04:11,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659660460] [2024-10-14 03:04:11,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:11,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:04:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:11,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:04:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:11,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:04:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:11,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:04:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:11,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:04:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:11,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:04:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:11,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:04:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:11,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 03:04:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:11,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 03:04:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:11,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 03:04:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:11,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 03:04:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:11,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 03:04:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:11,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 03:04:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:11,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:04:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:11,561 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 03:04:11,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:04:11,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659660460] [2024-10-14 03:04:11,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659660460] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:04:11,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594211128] [2024-10-14 03:04:11,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:11,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:04:11,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:04:11,564 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:04:11,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 03:04:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:11,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 03:04:11,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:04:11,901 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 03:04:11,902 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:04:11,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594211128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:04:11,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:04:11,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-14 03:04:11,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466772549] [2024-10-14 03:04:11,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:04:11,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:04:11,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:04:11,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:04:11,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:04:11,906 INFO L87 Difference]: Start difference. First operand 319 states and 481 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:04:11,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:04:11,967 INFO L93 Difference]: Finished difference Result 668 states and 1021 transitions. [2024-10-14 03:04:11,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:04:11,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 103 [2024-10-14 03:04:11,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:04:11,971 INFO L225 Difference]: With dead ends: 668 [2024-10-14 03:04:11,971 INFO L226 Difference]: Without dead ends: 371 [2024-10-14 03:04:11,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:04:11,974 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 102 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:04:11,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 893 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:04:11,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-10-14 03:04:11,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 366. [2024-10-14 03:04:11,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 278 states have (on average 1.5683453237410072) internal successors, (436), 281 states have internal predecessors, (436), 64 states have call successors, (64), 23 states have call predecessors, (64), 23 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-10-14 03:04:11,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 563 transitions. [2024-10-14 03:04:11,997 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 563 transitions. Word has length 103 [2024-10-14 03:04:11,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:04:11,997 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 563 transitions. [2024-10-14 03:04:11,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:04:11,998 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 563 transitions. [2024-10-14 03:04:12,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 03:04:12,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:04:12,000 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:04:12,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 03:04:12,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:04:12,201 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:04:12,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:04:12,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1486057967, now seen corresponding path program 1 times [2024-10-14 03:04:12,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:04:12,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385037407] [2024-10-14 03:04:12,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:12,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:04:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:12,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:04:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:12,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:04:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:12,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:04:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:12,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:04:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:12,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:04:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:12,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:04:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:12,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 03:04:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:12,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 03:04:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:12,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 03:04:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:12,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 03:04:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:12,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 03:04:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:12,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:04:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:12,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 03:04:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:12,434 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 03:04:12,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:04:12,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385037407] [2024-10-14 03:04:12,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385037407] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:04:12,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127412864] [2024-10-14 03:04:12,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:12,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:04:12,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:04:12,437 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:04:12,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 03:04:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:12,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 03:04:12,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:04:12,789 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 03:04:12,789 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:04:12,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127412864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:04:12,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:04:12,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-14 03:04:12,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053870863] [2024-10-14 03:04:12,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:04:12,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:04:12,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:04:12,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:04:12,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:04:12,792 INFO L87 Difference]: Start difference. First operand 366 states and 563 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 03:04:12,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:04:12,894 INFO L93 Difference]: Finished difference Result 727 states and 1120 transitions. [2024-10-14 03:04:12,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:04:12,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 104 [2024-10-14 03:04:12,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:04:12,898 INFO L225 Difference]: With dead ends: 727 [2024-10-14 03:04:12,898 INFO L226 Difference]: Without dead ends: 368 [2024-10-14 03:04:12,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:04:12,904 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 2 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1821 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:04:12,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1821 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:04:12,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-10-14 03:04:12,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2024-10-14 03:04:12,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 279 states have (on average 1.5663082437275986) internal successors, (437), 283 states have internal predecessors, (437), 64 states have call successors, (64), 23 states have call predecessors, (64), 24 states have return successors, (65), 63 states have call predecessors, (65), 63 states have call successors, (65) [2024-10-14 03:04:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 566 transitions. [2024-10-14 03:04:12,934 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 566 transitions. Word has length 104 [2024-10-14 03:04:12,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:04:12,936 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 566 transitions. [2024-10-14 03:04:12,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 03:04:12,936 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 566 transitions. [2024-10-14 03:04:12,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 03:04:12,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:04:12,940 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:04:12,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 03:04:13,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:04:13,145 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:04:13,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:04:13,145 INFO L85 PathProgramCache]: Analyzing trace with hash 27526904, now seen corresponding path program 1 times [2024-10-14 03:04:13,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:04:13,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984734500] [2024-10-14 03:04:13,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:13,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:04:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:13,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:04:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:13,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:04:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:13,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:04:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:13,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:04:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:13,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:04:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:13,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 03:04:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:13,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 03:04:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:13,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 03:04:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:13,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 03:04:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:13,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 03:04:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:13,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 03:04:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:13,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 03:04:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:13,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 03:04:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-14 03:04:13,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:04:13,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984734500] [2024-10-14 03:04:13,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984734500] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:04:13,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688090326] [2024-10-14 03:04:13,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:13,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:04:13,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:04:13,440 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:04:13,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 03:04:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:13,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 03:04:13,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:04:13,831 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 03:04:13,834 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:04:13,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688090326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:04:13,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:04:13,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-14 03:04:13,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320803541] [2024-10-14 03:04:13,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:04:13,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:04:13,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:04:13,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:04:13,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:04:13,837 INFO L87 Difference]: Start difference. First operand 368 states and 566 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 03:04:13,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:04:13,962 INFO L93 Difference]: Finished difference Result 729 states and 1125 transitions. [2024-10-14 03:04:13,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:04:13,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 105 [2024-10-14 03:04:13,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:04:13,966 INFO L225 Difference]: With dead ends: 729 [2024-10-14 03:04:13,967 INFO L226 Difference]: Without dead ends: 370 [2024-10-14 03:04:13,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:04:13,969 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 2 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:04:13,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1807 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:04:13,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-10-14 03:04:13,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2024-10-14 03:04:13,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 280 states have (on average 1.5642857142857143) internal successors, (438), 285 states have internal predecessors, (438), 64 states have call successors, (64), 23 states have call predecessors, (64), 25 states have return successors, (70), 63 states have call predecessors, (70), 63 states have call successors, (70) [2024-10-14 03:04:13,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 572 transitions. [2024-10-14 03:04:13,996 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 572 transitions. Word has length 105 [2024-10-14 03:04:13,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:04:13,996 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 572 transitions. [2024-10-14 03:04:13,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 03:04:13,997 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 572 transitions. [2024-10-14 03:04:13,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-14 03:04:13,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:04:13,999 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:04:14,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 03:04:14,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:04:14,200 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:04:14,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:04:14,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1725365232, now seen corresponding path program 1 times [2024-10-14 03:04:14,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:04:14,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734719805] [2024-10-14 03:04:14,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:14,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:04:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:14,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:04:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:14,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:04:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:14,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:04:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:14,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:04:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:14,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:04:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:14,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:04:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:14,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 03:04:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:14,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 03:04:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:14,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 03:04:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:14,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 03:04:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:14,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 03:04:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:14,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 03:04:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:14,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 03:04:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:14,410 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 03:04:14,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:04:14,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734719805] [2024-10-14 03:04:14,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734719805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:04:14,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:04:14,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 03:04:14,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360544608] [2024-10-14 03:04:14,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:04:14,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 03:04:14,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:04:14,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 03:04:14,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:04:14,412 INFO L87 Difference]: Start difference. First operand 370 states and 572 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 03:04:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:04:16,333 INFO L93 Difference]: Finished difference Result 807 states and 1260 transitions. [2024-10-14 03:04:16,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:04:16,333 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 106 [2024-10-14 03:04:16,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:04:16,337 INFO L225 Difference]: With dead ends: 807 [2024-10-14 03:04:16,337 INFO L226 Difference]: Without dead ends: 456 [2024-10-14 03:04:16,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:04:16,340 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1056 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2109 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 2471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 2109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:04:16,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 968 Invalid, 2471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 2109 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 03:04:16,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-10-14 03:04:16,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 370. [2024-10-14 03:04:16,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 280 states have (on average 1.5642857142857143) internal successors, (438), 285 states have internal predecessors, (438), 64 states have call successors, (64), 23 states have call predecessors, (64), 25 states have return successors, (69), 63 states have call predecessors, (69), 63 states have call successors, (69) [2024-10-14 03:04:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 571 transitions. [2024-10-14 03:04:16,398 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 571 transitions. Word has length 106 [2024-10-14 03:04:16,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:04:16,399 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 571 transitions. [2024-10-14 03:04:16,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 03:04:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 571 transitions. [2024-10-14 03:04:16,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 03:04:16,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:04:16,403 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:04:16,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:04:16,404 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:04:16,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:04:16,404 INFO L85 PathProgramCache]: Analyzing trace with hash -847172679, now seen corresponding path program 2 times [2024-10-14 03:04:16,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:04:16,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941871502] [2024-10-14 03:04:16,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:16,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:04:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:16,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:04:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:16,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:04:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:16,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:04:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:16,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:04:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:16,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:04:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:16,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:04:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:16,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-14 03:04:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:16,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 03:04:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:16,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 03:04:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:16,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:04:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:16,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 03:04:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:16,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 03:04:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:16,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 03:04:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:16,634 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 03:04:16,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:04:16,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941871502] [2024-10-14 03:04:16,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941871502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:04:16,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:04:16,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 03:04:16,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753220584] [2024-10-14 03:04:16,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:04:16,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 03:04:16,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:04:16,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 03:04:16,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:04:16,636 INFO L87 Difference]: Start difference. First operand 370 states and 571 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 03:04:18,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:04:18,463 INFO L93 Difference]: Finished difference Result 809 states and 1263 transitions. [2024-10-14 03:04:18,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:04:18,464 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 107 [2024-10-14 03:04:18,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:04:18,467 INFO L225 Difference]: With dead ends: 809 [2024-10-14 03:04:18,468 INFO L226 Difference]: Without dead ends: 458 [2024-10-14 03:04:18,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:04:18,470 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1084 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2077 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 2436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 2077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:04:18,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 968 Invalid, 2436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 2077 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 03:04:18,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-10-14 03:04:18,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 372. [2024-10-14 03:04:18,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 281 states have (on average 1.5622775800711743) internal successors, (439), 287 states have internal predecessors, (439), 64 states have call successors, (64), 23 states have call predecessors, (64), 26 states have return successors, (71), 63 states have call predecessors, (71), 63 states have call successors, (71) [2024-10-14 03:04:18,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 574 transitions. [2024-10-14 03:04:18,503 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 574 transitions. Word has length 107 [2024-10-14 03:04:18,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:04:18,505 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 574 transitions. [2024-10-14 03:04:18,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 03:04:18,505 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 574 transitions. [2024-10-14 03:04:18,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 03:04:18,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:04:18,507 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:04:18,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:04:18,507 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:04:18,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:04:18,508 INFO L85 PathProgramCache]: Analyzing trace with hash -2037327893, now seen corresponding path program 1 times [2024-10-14 03:04:18,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:04:18,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932614367] [2024-10-14 03:04:18,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:18,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:04:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:18,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:04:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:18,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:04:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:18,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:04:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:18,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:04:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:18,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:04:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:18,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:04:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:18,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 03:04:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:18,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:04:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:18,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:04:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:18,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:04:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:18,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 03:04:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:18,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 03:04:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:18,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 03:04:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-14 03:04:18,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:04:18,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932614367] [2024-10-14 03:04:18,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932614367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:04:18,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:04:18,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 03:04:18,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782426969] [2024-10-14 03:04:18,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:04:18,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 03:04:18,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:04:18,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 03:04:18,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:04:18,749 INFO L87 Difference]: Start difference. First operand 372 states and 574 transitions. Second operand has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-14 03:04:20,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:04:20,921 INFO L93 Difference]: Finished difference Result 807 states and 1258 transitions. [2024-10-14 03:04:20,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:04:20,921 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 108 [2024-10-14 03:04:20,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:04:20,925 INFO L225 Difference]: With dead ends: 807 [2024-10-14 03:04:20,925 INFO L226 Difference]: Without dead ends: 458 [2024-10-14 03:04:20,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-14 03:04:20,928 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 1121 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 3371 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 3746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 3371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:04:20,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 1343 Invalid, 3746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 3371 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 03:04:20,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-10-14 03:04:20,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 372. [2024-10-14 03:04:20,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 281 states have (on average 1.5622775800711743) internal successors, (439), 287 states have internal predecessors, (439), 64 states have call successors, (64), 23 states have call predecessors, (64), 26 states have return successors, (70), 63 states have call predecessors, (70), 63 states have call successors, (70) [2024-10-14 03:04:20,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 573 transitions. [2024-10-14 03:04:20,959 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 573 transitions. Word has length 108 [2024-10-14 03:04:20,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:04:20,960 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 573 transitions. [2024-10-14 03:04:20,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-14 03:04:20,960 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 573 transitions. [2024-10-14 03:04:20,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 03:04:20,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:04:20,962 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:04:20,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:04:20,962 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:04:20,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:04:20,963 INFO L85 PathProgramCache]: Analyzing trace with hash -41917855, now seen corresponding path program 2 times [2024-10-14 03:04:20,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:04:20,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740394983] [2024-10-14 03:04:20,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:20,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:04:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:21,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:04:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:21,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:04:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:21,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:04:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:21,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:04:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:21,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:04:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:21,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:04:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:21,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 03:04:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:21,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 03:04:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:21,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 03:04:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:21,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 03:04:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:21,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 03:04:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:21,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 03:04:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:21,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 03:04:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-14 03:04:21,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:04:21,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740394983] [2024-10-14 03:04:21,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740394983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:04:21,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:04:21,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 03:04:21,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176706400] [2024-10-14 03:04:21,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:04:21,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 03:04:21,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:04:21,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 03:04:21,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:04:21,329 INFO L87 Difference]: Start difference. First operand 372 states and 573 transitions. Second operand has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-14 03:04:23,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:04:23,489 INFO L93 Difference]: Finished difference Result 809 states and 1264 transitions. [2024-10-14 03:04:23,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:04:23,490 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 109 [2024-10-14 03:04:23,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:04:23,493 INFO L225 Difference]: With dead ends: 809 [2024-10-14 03:04:23,494 INFO L226 Difference]: Without dead ends: 460 [2024-10-14 03:04:23,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-14 03:04:23,498 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 1124 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 3382 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 3763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 3382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:04:23,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1125 Valid, 1344 Invalid, 3763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 3382 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 03:04:23,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-10-14 03:04:23,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 374. [2024-10-14 03:04:23,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 282 states have (on average 1.5602836879432624) internal successors, (440), 289 states have internal predecessors, (440), 64 states have call successors, (64), 23 states have call predecessors, (64), 27 states have return successors, (75), 63 states have call predecessors, (75), 63 states have call successors, (75) [2024-10-14 03:04:23,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 579 transitions. [2024-10-14 03:04:23,540 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 579 transitions. Word has length 109 [2024-10-14 03:04:23,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:04:23,540 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 579 transitions. [2024-10-14 03:04:23,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-14 03:04:23,541 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 579 transitions. [2024-10-14 03:04:23,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-14 03:04:23,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:04:23,544 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:04:23,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:04:23,545 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:04:23,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:04:23,545 INFO L85 PathProgramCache]: Analyzing trace with hash -2132538938, now seen corresponding path program 1 times [2024-10-14 03:04:23,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:04:23,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679333483] [2024-10-14 03:04:23,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:23,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:04:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:23,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:04:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:23,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:04:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:23,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:04:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:23,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:04:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:23,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:04:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:23,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:04:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:23,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 03:04:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:23,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 03:04:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:23,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 03:04:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:23,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 03:04:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:23,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 03:04:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:23,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:04:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:23,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 03:04:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:23,816 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-14 03:04:23,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:04:23,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679333483] [2024-10-14 03:04:23,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679333483] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:04:23,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839151347] [2024-10-14 03:04:23,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:23,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:04:23,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:04:23,820 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:04:23,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 03:04:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:24,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 03:04:24,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:04:24,148 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:04:24,150 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:04:24,254 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:04:24,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839151347] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:04:24,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:04:24,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-10-14 03:04:24,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374079292] [2024-10-14 03:04:24,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:04:24,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 03:04:24,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:04:24,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 03:04:24,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:04:24,258 INFO L87 Difference]: Start difference. First operand 374 states and 579 transitions. Second operand has 15 states, 14 states have (on average 8.714285714285714) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (31), 6 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-14 03:04:26,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:04:26,707 INFO L93 Difference]: Finished difference Result 1138 states and 1875 transitions. [2024-10-14 03:04:26,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 03:04:26,708 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 8.714285714285714) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (31), 6 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 110 [2024-10-14 03:04:26,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:04:26,713 INFO L225 Difference]: With dead ends: 1138 [2024-10-14 03:04:26,713 INFO L226 Difference]: Without dead ends: 790 [2024-10-14 03:04:26,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2024-10-14 03:04:26,716 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 2074 mSDsluCounter, 1399 mSDsCounter, 0 mSdLazyCounter, 3858 mSolverCounterSat, 707 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2091 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 4565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 707 IncrementalHoareTripleChecker+Valid, 3858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:04:26,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2091 Valid, 1547 Invalid, 4565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [707 Valid, 3858 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 03:04:26,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2024-10-14 03:04:26,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 689. [2024-10-14 03:04:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 533 states have (on average 1.6097560975609757) internal successors, (858), 540 states have internal predecessors, (858), 128 states have call successors, (128), 23 states have call predecessors, (128), 27 states have return successors, (149), 127 states have call predecessors, (149), 127 states have call successors, (149) [2024-10-14 03:04:26,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1135 transitions. [2024-10-14 03:04:26,760 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1135 transitions. Word has length 110 [2024-10-14 03:04:26,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:04:26,761 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1135 transitions. [2024-10-14 03:04:26,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 8.714285714285714) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (31), 6 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-14 03:04:26,761 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1135 transitions. [2024-10-14 03:04:26,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 03:04:26,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:04:26,765 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:04:26,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 03:04:26,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:04:26,966 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:04:26,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:04:26,966 INFO L85 PathProgramCache]: Analyzing trace with hash -30249130, now seen corresponding path program 1 times [2024-10-14 03:04:26,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:04:26,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968633381] [2024-10-14 03:04:26,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:26,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:04:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:27,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:04:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:27,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:04:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:27,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:04:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:27,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:04:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:27,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:04:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:27,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:04:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:27,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 03:04:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:27,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 03:04:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:27,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 03:04:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:27,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 03:04:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:27,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 03:04:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:27,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 03:04:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:27,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 03:04:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:27,076 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:04:27,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:04:27,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968633381] [2024-10-14 03:04:27,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968633381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:04:27,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:04:27,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:04:27,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803640633] [2024-10-14 03:04:27,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:04:27,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:04:27,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:04:27,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:04:27,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:04:27,079 INFO L87 Difference]: Start difference. First operand 689 states and 1135 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:04:28,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:04:28,193 INFO L93 Difference]: Finished difference Result 1693 states and 2864 transitions. [2024-10-14 03:04:28,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:04:28,194 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 114 [2024-10-14 03:04:28,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:04:28,201 INFO L225 Difference]: With dead ends: 1693 [2024-10-14 03:04:28,201 INFO L226 Difference]: Without dead ends: 1072 [2024-10-14 03:04:28,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:04:28,205 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 1185 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:04:28,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 749 Invalid, 1628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 03:04:28,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2024-10-14 03:04:28,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 981. [2024-10-14 03:04:28,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 761 states have (on average 1.6228646517739815) internal successors, (1235), 768 states have internal predecessors, (1235), 192 states have call successors, (192), 23 states have call predecessors, (192), 27 states have return successors, (223), 191 states have call predecessors, (223), 191 states have call successors, (223) [2024-10-14 03:04:28,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1650 transitions. [2024-10-14 03:04:28,260 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1650 transitions. Word has length 114 [2024-10-14 03:04:28,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:04:28,261 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1650 transitions. [2024-10-14 03:04:28,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:04:28,261 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1650 transitions. [2024-10-14 03:04:28,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 03:04:28,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:04:28,267 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:04:28,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:04:28,267 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:04:28,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:04:28,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1066251536, now seen corresponding path program 1 times [2024-10-14 03:04:28,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:04:28,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521994158] [2024-10-14 03:04:28,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:28,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:04:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:28,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:04:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:28,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:04:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:28,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:04:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:28,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:04:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:28,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:04:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:28,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:04:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:28,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 03:04:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:28,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 03:04:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:28,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:04:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:28,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 03:04:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:28,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:04:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:28,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 03:04:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:28,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 03:04:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:04:28,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:04:28,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521994158] [2024-10-14 03:04:28,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521994158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:04:28,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:04:28,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:04:28,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005719598] [2024-10-14 03:04:28,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:04:28,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:04:28,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:04:28,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:04:28,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:04:28,393 INFO L87 Difference]: Start difference. First operand 981 states and 1650 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:04:29,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:04:29,706 INFO L93 Difference]: Finished difference Result 2410 states and 4121 transitions. [2024-10-14 03:04:29,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:04:29,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2024-10-14 03:04:29,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:04:29,716 INFO L225 Difference]: With dead ends: 2410 [2024-10-14 03:04:29,716 INFO L226 Difference]: Without dead ends: 1547 [2024-10-14 03:04:29,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:04:29,720 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 1208 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:04:29,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 710 Invalid, 1585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 03:04:29,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2024-10-14 03:04:29,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1456. [2024-10-14 03:04:29,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1141 states have (on average 1.6292725679228748) internal successors, (1859), 1148 states have internal predecessors, (1859), 287 states have call successors, (287), 23 states have call predecessors, (287), 27 states have return successors, (318), 286 states have call predecessors, (318), 286 states have call successors, (318) [2024-10-14 03:04:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 2464 transitions. [2024-10-14 03:04:29,798 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 2464 transitions. Word has length 115 [2024-10-14 03:04:29,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:04:29,798 INFO L471 AbstractCegarLoop]: Abstraction has 1456 states and 2464 transitions. [2024-10-14 03:04:29,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:04:29,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 2464 transitions. [2024-10-14 03:04:29,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 03:04:29,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:04:29,806 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:04:29,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:04:29,807 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:04:29,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:04:29,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1298513032, now seen corresponding path program 1 times [2024-10-14 03:04:29,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:04:29,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387343777] [2024-10-14 03:04:29,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:29,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:04:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:29,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:04:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:29,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:04:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:29,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:04:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:29,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:04:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:29,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:04:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:29,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:04:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:29,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 03:04:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:29,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:04:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:29,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:04:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:29,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 03:04:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:29,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 03:04:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:29,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 03:04:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:29,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 03:04:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:29,913 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:04:29,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:04:29,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387343777] [2024-10-14 03:04:29,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387343777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:04:29,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:04:29,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:04:29,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473085579] [2024-10-14 03:04:29,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:04:29,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:04:29,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:04:29,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:04:29,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:04:29,915 INFO L87 Difference]: Start difference. First operand 1456 states and 2464 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:04:30,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:04:30,990 INFO L93 Difference]: Finished difference Result 3472 states and 5999 transitions. [2024-10-14 03:04:30,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:04:30,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2024-10-14 03:04:30,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:04:31,003 INFO L225 Difference]: With dead ends: 3472 [2024-10-14 03:04:31,003 INFO L226 Difference]: Without dead ends: 2262 [2024-10-14 03:04:31,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:04:31,009 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 1196 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:04:31,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 702 Invalid, 1564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [425 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 03:04:31,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2262 states. [2024-10-14 03:04:31,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2262 to 2171. [2024-10-14 03:04:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2171 states, 1733 states have (on average 1.634737449509521) internal successors, (2833), 1740 states have internal predecessors, (2833), 410 states have call successors, (410), 23 states have call predecessors, (410), 27 states have return successors, (457), 409 states have call predecessors, (457), 409 states have call successors, (457) [2024-10-14 03:04:31,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 3700 transitions. [2024-10-14 03:04:31,131 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 3700 transitions. Word has length 116 [2024-10-14 03:04:31,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:04:31,131 INFO L471 AbstractCegarLoop]: Abstraction has 2171 states and 3700 transitions. [2024-10-14 03:04:31,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:04:31,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3700 transitions. [2024-10-14 03:04:31,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 03:04:31,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:04:31,145 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:04:31,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:04:31,146 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:04:31,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:04:31,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1811639377, now seen corresponding path program 1 times [2024-10-14 03:04:31,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:04:31,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831507529] [2024-10-14 03:04:31,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:31,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:04:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:31,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:04:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:31,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:04:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:31,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:04:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:31,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:04:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:31,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:04:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:31,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:04:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:31,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 03:04:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:31,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 03:04:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:31,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 03:04:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:31,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 03:04:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:31,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 03:04:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:31,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 03:04:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:31,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 03:04:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:31,290 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:04:31,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:04:31,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831507529] [2024-10-14 03:04:31,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831507529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:04:31,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:04:31,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:04:31,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828272815] [2024-10-14 03:04:31,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:04:31,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:04:31,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:04:31,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:04:31,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:04:31,293 INFO L87 Difference]: Start difference. First operand 2171 states and 3700 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:04:32,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:04:32,483 INFO L93 Difference]: Finished difference Result 5114 states and 8912 transitions. [2024-10-14 03:04:32,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:04:32,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2024-10-14 03:04:32,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:04:32,502 INFO L225 Difference]: With dead ends: 5114 [2024-10-14 03:04:32,502 INFO L226 Difference]: Without dead ends: 3398 [2024-10-14 03:04:32,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:04:32,511 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1137 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:04:32,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 708 Invalid, 1610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 03:04:32,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2024-10-14 03:04:32,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3307. [2024-10-14 03:04:32,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3307 states, 2690 states have (on average 1.6382899628252787) internal successors, (4407), 2697 states have internal predecessors, (4407), 589 states have call successors, (589), 23 states have call predecessors, (589), 27 states have return successors, (662), 588 states have call predecessors, (662), 588 states have call successors, (662) [2024-10-14 03:04:32,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3307 states to 3307 states and 5658 transitions. [2024-10-14 03:04:32,697 INFO L78 Accepts]: Start accepts. Automaton has 3307 states and 5658 transitions. Word has length 117 [2024-10-14 03:04:32,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:04:32,698 INFO L471 AbstractCegarLoop]: Abstraction has 3307 states and 5658 transitions. [2024-10-14 03:04:32,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:04:32,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3307 states and 5658 transitions. [2024-10-14 03:04:32,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 03:04:32,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:04:32,712 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:04:32,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:04:32,712 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:04:32,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:04:32,713 INFO L85 PathProgramCache]: Analyzing trace with hash -72237108, now seen corresponding path program 1 times [2024-10-14 03:04:32,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:04:32,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750189468] [2024-10-14 03:04:32,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:32,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:04:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:32,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:04:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:32,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:04:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:32,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:04:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:32,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:04:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:32,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:04:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:32,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:04:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:32,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 03:04:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:32,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 03:04:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:32,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 03:04:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:32,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 03:04:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:32,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 03:04:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:32,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 03:04:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:32,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 03:04:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:32,817 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:04:32,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:04:32,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750189468] [2024-10-14 03:04:32,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750189468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:04:32,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:04:32,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:04:32,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272180438] [2024-10-14 03:04:32,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:04:32,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:04:32,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:04:32,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:04:32,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:04:32,819 INFO L87 Difference]: Start difference. First operand 3307 states and 5658 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:04:34,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:04:34,094 INFO L93 Difference]: Finished difference Result 8069 states and 14110 transitions. [2024-10-14 03:04:34,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:04:34,094 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2024-10-14 03:04:34,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:04:34,123 INFO L225 Difference]: With dead ends: 8069 [2024-10-14 03:04:34,123 INFO L226 Difference]: Without dead ends: 5456 [2024-10-14 03:04:34,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:04:34,138 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 1157 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:04:34,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1172 Valid, 741 Invalid, 1610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 03:04:34,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5456 states. [2024-10-14 03:04:34,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5456 to 5365. [2024-10-14 03:04:34,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5365 states, 4372 states have (on average 1.630832570905764) internal successors, (7130), 4379 states have internal predecessors, (7130), 965 states have call successors, (965), 23 states have call predecessors, (965), 27 states have return successors, (1082), 964 states have call predecessors, (1082), 964 states have call successors, (1082) [2024-10-14 03:04:34,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5365 states to 5365 states and 9177 transitions. [2024-10-14 03:04:34,446 INFO L78 Accepts]: Start accepts. Automaton has 5365 states and 9177 transitions. Word has length 118 [2024-10-14 03:04:34,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:04:34,446 INFO L471 AbstractCegarLoop]: Abstraction has 5365 states and 9177 transitions. [2024-10-14 03:04:34,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:04:34,447 INFO L276 IsEmpty]: Start isEmpty. Operand 5365 states and 9177 transitions. [2024-10-14 03:04:34,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-14 03:04:34,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:04:34,463 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:04:34,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:04:34,463 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:04:34,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:04:34,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1596562539, now seen corresponding path program 1 times [2024-10-14 03:04:34,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:04:34,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580819305] [2024-10-14 03:04:34,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:34,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:04:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:34,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:04:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:34,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:04:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:34,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:04:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:34,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:04:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:34,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:04:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:34,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:04:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:34,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 03:04:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:34,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 03:04:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:34,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 03:04:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:34,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:04:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:34,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 03:04:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:34,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 03:04:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:34,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 03:04:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:04:34,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:04:34,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580819305] [2024-10-14 03:04:34,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580819305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:04:34,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:04:34,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:04:34,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573828250] [2024-10-14 03:04:34,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:04:34,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:04:34,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:04:34,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:04:34,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:04:34,581 INFO L87 Difference]: Start difference. First operand 5365 states and 9177 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:04:35,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:04:35,833 INFO L93 Difference]: Finished difference Result 13274 states and 23194 transitions. [2024-10-14 03:04:35,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:04:35,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 119 [2024-10-14 03:04:35,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:04:35,890 INFO L225 Difference]: With dead ends: 13274 [2024-10-14 03:04:35,890 INFO L226 Difference]: Without dead ends: 8989 [2024-10-14 03:04:35,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:04:35,907 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 1158 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:04:35,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1173 Valid, 715 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 03:04:35,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8989 states. [2024-10-14 03:04:36,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8989 to 8898. [2024-10-14 03:04:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8898 states, 7299 states have (on average 1.628579257432525) internal successors, (11887), 7306 states have internal predecessors, (11887), 1571 states have call successors, (1571), 23 states have call predecessors, (1571), 27 states have return successors, (1766), 1570 states have call predecessors, (1766), 1570 states have call successors, (1766) [2024-10-14 03:04:36,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8898 states to 8898 states and 15224 transitions. [2024-10-14 03:04:36,350 INFO L78 Accepts]: Start accepts. Automaton has 8898 states and 15224 transitions. Word has length 119 [2024-10-14 03:04:36,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:04:36,351 INFO L471 AbstractCegarLoop]: Abstraction has 8898 states and 15224 transitions. [2024-10-14 03:04:36,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:04:36,351 INFO L276 IsEmpty]: Start isEmpty. Operand 8898 states and 15224 transitions. [2024-10-14 03:04:36,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-14 03:04:36,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:04:36,374 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:04:36,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:04:36,374 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:04:36,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:04:36,375 INFO L85 PathProgramCache]: Analyzing trace with hash -444751478, now seen corresponding path program 1 times [2024-10-14 03:04:36,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:04:36,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703593754] [2024-10-14 03:04:36,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:36,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:04:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:36,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:04:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:36,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:04:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:36,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:04:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:36,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:04:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:36,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:04:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:36,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:04:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:36,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 03:04:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:36,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 03:04:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:36,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 03:04:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:36,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 03:04:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:36,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 03:04:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:36,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 03:04:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:36,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 03:04:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:04:36,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:04:36,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703593754] [2024-10-14 03:04:36,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703593754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:04:36,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:04:36,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:04:36,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868095774] [2024-10-14 03:04:36,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:04:36,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:04:36,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:04:36,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:04:36,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:04:36,482 INFO L87 Difference]: Start difference. First operand 8898 states and 15224 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:04:37,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:04:37,893 INFO L93 Difference]: Finished difference Result 23046 states and 40223 transitions. [2024-10-14 03:04:37,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:04:37,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2024-10-14 03:04:37,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:04:37,969 INFO L225 Difference]: With dead ends: 23046 [2024-10-14 03:04:37,970 INFO L226 Difference]: Without dead ends: 15661 [2024-10-14 03:04:38,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:04:38,008 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 1134 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 410 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 410 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:04:38,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 716 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [410 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 03:04:38,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15661 states. [2024-10-14 03:04:38,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15661 to 15570. [2024-10-14 03:04:38,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15570 states, 12768 states have (on average 1.619360902255639) internal successors, (20676), 12775 states have internal predecessors, (20676), 2774 states have call successors, (2774), 23 states have call predecessors, (2774), 27 states have return successors, (3113), 2773 states have call predecessors, (3113), 2773 states have call successors, (3113) [2024-10-14 03:04:38,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15570 states to 15570 states and 26563 transitions. [2024-10-14 03:04:38,776 INFO L78 Accepts]: Start accepts. Automaton has 15570 states and 26563 transitions. Word has length 120 [2024-10-14 03:04:38,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:04:38,777 INFO L471 AbstractCegarLoop]: Abstraction has 15570 states and 26563 transitions. [2024-10-14 03:04:38,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:04:38,778 INFO L276 IsEmpty]: Start isEmpty. Operand 15570 states and 26563 transitions. [2024-10-14 03:04:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 03:04:38,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:04:38,809 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:04:38,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 03:04:38,809 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:04:38,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:04:38,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1887105654, now seen corresponding path program 1 times [2024-10-14 03:04:38,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:04:38,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990992175] [2024-10-14 03:04:38,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:38,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:04:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:38,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:04:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:38,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:04:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:38,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:04:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:38,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:04:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:38,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:04:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:38,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:04:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:38,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:04:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:38,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 03:04:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:38,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 03:04:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:38,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:04:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:38,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:04:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:38,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 03:04:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:38,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 03:04:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:38,924 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:04:38,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:04:38,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990992175] [2024-10-14 03:04:38,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990992175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:04:38,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:04:38,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:04:38,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447998754] [2024-10-14 03:04:38,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:04:38,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:04:38,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:04:38,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:04:38,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:04:38,927 INFO L87 Difference]: Start difference. First operand 15570 states and 26563 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:04:41,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:04:41,008 INFO L93 Difference]: Finished difference Result 41213 states and 71821 transitions. [2024-10-14 03:04:41,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:04:41,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 121 [2024-10-14 03:04:41,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:04:41,161 INFO L225 Difference]: With dead ends: 41213 [2024-10-14 03:04:41,161 INFO L226 Difference]: Without dead ends: 27776 [2024-10-14 03:04:41,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:04:41,218 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1166 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:04:41,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 709 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 03:04:41,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27776 states. [2024-10-14 03:04:42,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27776 to 27685. [2024-10-14 03:04:42,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27685 states, 22844 states have (on average 1.6154351251969883) internal successors, (36903), 22851 states have internal predecessors, (36903), 4813 states have call successors, (4813), 23 states have call predecessors, (4813), 27 states have return successors, (5426), 4812 states have call predecessors, (5426), 4812 states have call successors, (5426) [2024-10-14 03:04:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27685 states to 27685 states and 47142 transitions. [2024-10-14 03:04:42,646 INFO L78 Accepts]: Start accepts. Automaton has 27685 states and 47142 transitions. Word has length 121 [2024-10-14 03:04:42,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:04:42,647 INFO L471 AbstractCegarLoop]: Abstraction has 27685 states and 47142 transitions. [2024-10-14 03:04:42,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:04:42,648 INFO L276 IsEmpty]: Start isEmpty. Operand 27685 states and 47142 transitions. [2024-10-14 03:04:42,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 03:04:42,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:04:42,675 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:04:42,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 03:04:42,676 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:04:42,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:04:42,676 INFO L85 PathProgramCache]: Analyzing trace with hash -233746712, now seen corresponding path program 1 times [2024-10-14 03:04:42,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:04:42,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302969298] [2024-10-14 03:04:42,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:42,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:04:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:42,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:04:42,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:42,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:04:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:42,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:04:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:42,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:04:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:42,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:04:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:42,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:04:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:42,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 03:04:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:42,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 03:04:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:42,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 03:04:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:42,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 03:04:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:42,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 03:04:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:42,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 03:04:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:42,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 03:04:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:42,778 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:04:42,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:04:42,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302969298] [2024-10-14 03:04:42,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302969298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:04:42,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:04:42,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:04:42,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30768428] [2024-10-14 03:04:42,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:04:42,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:04:42,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:04:42,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:04:42,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:04:42,779 INFO L87 Difference]: Start difference. First operand 27685 states and 47142 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:04:45,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:04:45,721 INFO L93 Difference]: Finished difference Result 75405 states and 130615 transitions. [2024-10-14 03:04:45,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:04:45,722 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2024-10-14 03:04:45,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:04:45,939 INFO L225 Difference]: With dead ends: 75405 [2024-10-14 03:04:45,940 INFO L226 Difference]: Without dead ends: 50600 [2024-10-14 03:04:46,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:04:46,015 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 1125 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:04:46,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 716 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 03:04:46,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50600 states. [2024-10-14 03:04:47,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50600 to 50509. [2024-10-14 03:04:48,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50509 states, 41953 states have (on average 1.6101589874383238) internal successors, (67551), 41960 states have internal predecessors, (67551), 8528 states have call successors, (8528), 23 states have call predecessors, (8528), 27 states have return successors, (9673), 8527 states have call predecessors, (9673), 8527 states have call successors, (9673) [2024-10-14 03:04:48,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50509 states to 50509 states and 85752 transitions. [2024-10-14 03:04:48,573 INFO L78 Accepts]: Start accepts. Automaton has 50509 states and 85752 transitions. Word has length 122 [2024-10-14 03:04:48,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:04:48,574 INFO L471 AbstractCegarLoop]: Abstraction has 50509 states and 85752 transitions. [2024-10-14 03:04:48,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:04:48,574 INFO L276 IsEmpty]: Start isEmpty. Operand 50509 states and 85752 transitions. [2024-10-14 03:04:48,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-14 03:04:48,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:04:48,615 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:04:48,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 03:04:48,615 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:04:48,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:04:48,616 INFO L85 PathProgramCache]: Analyzing trace with hash -345735446, now seen corresponding path program 1 times [2024-10-14 03:04:48,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:04:48,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890321039] [2024-10-14 03:04:48,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:48,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:04:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:48,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:04:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:48,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:04:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:48,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:04:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:48,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:04:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:48,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:04:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:48,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:04:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:48,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 03:04:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:48,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:04:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:48,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 03:04:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:48,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 03:04:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:48,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 03:04:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:48,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 03:04:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:48,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 03:04:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:48,743 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:04:48,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:04:48,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890321039] [2024-10-14 03:04:48,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890321039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:04:48,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:04:48,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:04:48,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847884641] [2024-10-14 03:04:48,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:04:48,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:04:48,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:04:48,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:04:48,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:04:48,747 INFO L87 Difference]: Start difference. First operand 50509 states and 85752 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:04:52,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:04:52,002 INFO L93 Difference]: Finished difference Result 94152 states and 163521 transitions. [2024-10-14 03:04:52,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:04:52,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2024-10-14 03:04:52,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:04:52,583 INFO L225 Difference]: With dead ends: 94152 [2024-10-14 03:04:52,583 INFO L226 Difference]: Without dead ends: 93980 [2024-10-14 03:04:52,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:04:52,637 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 1125 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1139 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:04:52,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1139 Valid, 712 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 03:04:52,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93980 states. [2024-10-14 03:04:55,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93980 to 93889. [2024-10-14 03:04:55,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93889 states, 78534 states have (on average 1.6033692413476965) internal successors, (125919), 78541 states have internal predecessors, (125919), 15327 states have call successors, (15327), 23 states have call predecessors, (15327), 27 states have return successors, (17518), 15326 states have call predecessors, (17518), 15326 states have call successors, (17518) [2024-10-14 03:04:56,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93889 states to 93889 states and 158764 transitions. [2024-10-14 03:04:56,177 INFO L78 Accepts]: Start accepts. Automaton has 93889 states and 158764 transitions. Word has length 123 [2024-10-14 03:04:56,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:04:56,178 INFO L471 AbstractCegarLoop]: Abstraction has 93889 states and 158764 transitions. [2024-10-14 03:04:56,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:04:56,178 INFO L276 IsEmpty]: Start isEmpty. Operand 93889 states and 158764 transitions. [2024-10-14 03:04:56,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 03:04:56,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:04:56,220 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:04:56,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 03:04:56,221 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:04:56,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:04:56,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1040622153, now seen corresponding path program 1 times [2024-10-14 03:04:56,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:04:56,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798540984] [2024-10-14 03:04:56,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:04:56,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:04:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:57,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:04:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:57,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:04:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:57,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:04:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:57,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:04:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:57,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:04:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:57,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:04:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:57,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 03:04:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:57,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:04:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:57,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 03:04:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:57,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 03:04:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:57,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 03:04:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:57,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 03:04:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:57,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 03:04:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:04:57,288 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:04:57,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:04:57,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798540984] [2024-10-14 03:04:57,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798540984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:04:57,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:04:57,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-14 03:04:57,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872914448] [2024-10-14 03:04:57,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:04:57,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 03:04:57,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:04:57,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 03:04:57,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:04:57,291 INFO L87 Difference]: Start difference. First operand 93889 states and 158764 transitions. Second operand has 18 states, 16 states have (on average 5.1875) internal successors, (83), 12 states have internal predecessors, (83), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2024-10-14 03:05:06,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:05:06,608 INFO L93 Difference]: Finished difference Result 187571 states and 329127 transitions. [2024-10-14 03:05:06,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-14 03:05:06,609 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.1875) internal successors, (83), 12 states have internal predecessors, (83), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 124 [2024-10-14 03:05:06,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:05:07,894 INFO L225 Difference]: With dead ends: 187571 [2024-10-14 03:05:07,894 INFO L226 Difference]: Without dead ends: 187404 [2024-10-14 03:05:08,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1486 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=863, Invalid=3967, Unknown=0, NotChecked=0, Total=4830 [2024-10-14 03:05:08,005 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 4472 mSDsluCounter, 2090 mSDsCounter, 0 mSdLazyCounter, 6333 mSolverCounterSat, 1633 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4483 SdHoareTripleChecker+Valid, 2302 SdHoareTripleChecker+Invalid, 7966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1633 IncrementalHoareTripleChecker+Valid, 6333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:05:08,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4483 Valid, 2302 Invalid, 7966 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1633 Valid, 6333 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-14 03:05:08,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187404 states. [2024-10-14 03:05:14,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187404 to 187002. [2024-10-14 03:05:14,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187002 states, 156479 states have (on average 1.6042791684507187) internal successors, (251036), 156384 states have internal predecessors, (251036), 30451 states have call successors, (30451), 62 states have call predecessors, (30451), 71 states have return successors, (38109), 30561 states have call predecessors, (38109), 30448 states have call successors, (38109) [2024-10-14 03:05:15,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187002 states to 187002 states and 319596 transitions. [2024-10-14 03:05:15,564 INFO L78 Accepts]: Start accepts. Automaton has 187002 states and 319596 transitions. Word has length 124 [2024-10-14 03:05:15,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:05:15,564 INFO L471 AbstractCegarLoop]: Abstraction has 187002 states and 319596 transitions. [2024-10-14 03:05:15,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.1875) internal successors, (83), 12 states have internal predecessors, (83), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2024-10-14 03:05:15,565 INFO L276 IsEmpty]: Start isEmpty. Operand 187002 states and 319596 transitions. [2024-10-14 03:05:15,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 03:05:15,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:05:15,660 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:05:15,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 03:05:15,660 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:05:15,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:05:15,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1213515276, now seen corresponding path program 1 times [2024-10-14 03:05:15,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:05:15,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325113867] [2024-10-14 03:05:15,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:05:15,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:05:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:05:15,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:05:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:05:15,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:05:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:05:15,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:05:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:05:15,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:05:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:05:15,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:05:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:05:15,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:05:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:05:15,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 03:05:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:05:15,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:05:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:05:15,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 03:05:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:05:15,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 03:05:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:05:15,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 03:05:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:05:15,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 03:05:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:05:15,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 03:05:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:05:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:05:15,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:05:15,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325113867] [2024-10-14 03:05:15,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325113867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:05:15,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:05:15,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 03:05:15,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538034646] [2024-10-14 03:05:15,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:05:15,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 03:05:15,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:05:15,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 03:05:15,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-14 03:05:15,969 INFO L87 Difference]: Start difference. First operand 187002 states and 319596 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 8 states have internal predecessors, (84), 5 states have call successors, (15), 7 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13)