./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd --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 64bit --witnessprinter.graph.data.programhash 0a45241a50bca97d16f2ca30787e76783488e633dbd3fde1131a60622cf8ee85 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:39:52,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:39:52,558 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-13 15:39:52,564 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:39:52,564 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:39:52,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:39:52,593 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:39:52,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:39:52,594 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:39:52,594 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:39:52,594 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:39:52,594 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:39:52,595 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:39:52,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:39:52,595 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:39:52,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:39:52,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:39:52,596 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:39:52,596 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:39:52,596 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:39:52,596 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:39:52,596 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:39:52,596 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:39:52,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:39:52,596 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:39:52,597 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:39:52,597 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:39:52,597 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:39:52,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:39:52,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:39:52,597 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:39:52,597 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:39:52,598 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:39:52,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:39:52,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:39:52,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:39:52,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:39:52,599 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:39:52,599 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:39:52,599 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0a45241a50bca97d16f2ca30787e76783488e633dbd3fde1131a60622cf8ee85 [2024-11-13 15:39:52,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:39:52,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:39:52,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:39:52,990 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:39:52,990 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:39:52,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i Unable to find full path for "g++" [2024-11-13 15:39:55,376 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:39:56,093 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:39:56,094 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i [2024-11-13 15:39:56,159 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/data/07b41bdba/49515ddbe509417e947a95434dd3718c/FLAGe1bda5a8a [2024-11-13 15:39:56,187 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/data/07b41bdba/49515ddbe509417e947a95434dd3718c [2024-11-13 15:39:56,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:39:56,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:39:56,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:39:56,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:39:56,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:39:56,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:39:56" (1/1) ... [2024-11-13 15:39:56,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@477531b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:56, skipping insertion in model container [2024-11-13 15:39:56,211 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:39:56" (1/1) ... [2024-11-13 15:39:56,349 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:39:56,750 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i[4499,4512] [2024-11-13 15:39:56,759 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i[4559,4572] [2024-11-13 15:39:58,045 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 15:39:58,047 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 15:39:58,048 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 15:39:58,052 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 15:39:58,054 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 15:39:58,082 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 15:39:58,083 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 15:39:58,086 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 15:39:58,087 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 15:39:58,090 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 15:39:58,092 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 15:39:58,093 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 15:39:58,093 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 15:39:58,892 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i[150662,150675] [2024-11-13 15:39:58,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:39:58,929 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:39:58,957 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i[4499,4512] [2024-11-13 15:39:58,958 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i[4559,4572] [2024-11-13 15:39:59,110 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 15:39:59,110 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 15:39:59,113 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 15:39:59,116 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 15:39:59,117 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 15:39:59,135 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 15:39:59,136 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 15:39:59,137 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 15:39:59,138 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 15:39:59,139 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 15:39:59,140 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 15:39:59,145 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 15:39:59,145 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 15:39:59,333 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i[150662,150675] [2024-11-13 15:39:59,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:39:59,613 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:39:59,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:59 WrapperNode [2024-11-13 15:39:59,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:39:59,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:39:59,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:39:59,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:39:59,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:59" (1/1) ... [2024-11-13 15:39:59,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:59" (1/1) ... [2024-11-13 15:39:59,835 INFO L138 Inliner]: procedures = 668, calls = 1044, calls flagged for inlining = 53, calls inlined = 8, statements flattened = 223 [2024-11-13 15:39:59,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:39:59,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:39:59,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:39:59,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:39:59,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:59" (1/1) ... [2024-11-13 15:39:59,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:59" (1/1) ... [2024-11-13 15:39:59,859 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:59" (1/1) ... [2024-11-13 15:39:59,913 INFO L175 MemorySlicer]: Split 43 memory accesses to 3 slices as follows [2, 36, 5]. 84 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 9 writes are split as follows [0, 9, 0]. [2024-11-13 15:39:59,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:59" (1/1) ... [2024-11-13 15:39:59,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:59" (1/1) ... [2024-11-13 15:39:59,953 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:59" (1/1) ... [2024-11-13 15:39:59,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:59" (1/1) ... [2024-11-13 15:39:59,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:59" (1/1) ... [2024-11-13 15:39:59,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:59" (1/1) ... [2024-11-13 15:39:59,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:39:59,993 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:39:59,993 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:39:59,994 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:39:59,996 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:59" (1/1) ... [2024-11-13 15:40:00,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:40:00,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:40:00,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:40:00,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:40:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2024-11-13 15:40:00,084 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2024-11-13 15:40:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2024-11-13 15:40:00,085 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2024-11-13 15:40:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 15:40:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 15:40:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 15:40:00,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 15:40:00,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-13 15:40:00,088 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-13 15:40:00,088 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-13 15:40:00,088 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-13 15:40:00,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 15:40:00,088 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-13 15:40:00,088 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-13 15:40:00,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:40:00,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 15:40:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 15:40:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 15:40:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:40:00,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:40:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2024-11-13 15:40:00,089 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2024-11-13 15:40:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-13 15:40:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-13 15:40:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-13 15:40:00,089 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-13 15:40:00,089 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-13 15:40:00,089 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-13 15:40:00,089 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 15:40:00,089 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 15:40:00,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 15:40:00,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 15:40:00,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 15:40:00,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 15:40:00,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 15:40:00,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 15:40:00,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 15:40:00,090 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-13 15:40:00,090 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-13 15:40:00,090 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2024-11-13 15:40:00,090 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2024-11-13 15:40:00,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:40:00,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 15:40:00,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 15:40:00,507 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:40:00,512 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:40:01,171 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-11-13 15:40:01,173 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:40:01,191 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:40:01,191 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-13 15:40:01,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:40:01 BoogieIcfgContainer [2024-11-13 15:40:01,195 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:40:01,197 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:40:01,198 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:40:01,205 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:40:01,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:39:56" (1/3) ... [2024-11-13 15:40:01,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49083756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:40:01, skipping insertion in model container [2024-11-13 15:40:01,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:59" (2/3) ... [2024-11-13 15:40:01,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49083756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:40:01, skipping insertion in model container [2024-11-13 15:40:01,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:40:01" (3/3) ... [2024-11-13 15:40:01,212 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_pop_front_harness.i [2024-11-13 15:40:01,232 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:40:01,234 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_pop_front_harness.i that has 13 procedures, 143 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2024-11-13 15:40:01,320 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:40:01,334 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;@6428b608, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:40:01,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:40:01,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 135 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 88 states have internal predecessors, (114), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-13 15:40:01,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 15:40:01,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:40:01,355 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-13 15:40:01,356 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:40:01,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:40:01,361 INFO L85 PathProgramCache]: Analyzing trace with hash 563631014, now seen corresponding path program 1 times [2024-11-13 15:40:01,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:40:01,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147437733] [2024-11-13 15:40:01,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:01,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:40:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:01,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:02,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 15:40:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:02,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:40:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:02,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:02,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 15:40:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:02,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:40:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:02,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:02,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 15:40:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:02,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-13 15:40:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:02,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:40:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:02,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 15:40:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:02,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 15:40:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:02,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 15:40:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:02,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:02,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 15:40:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:02,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 15:40:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:02,527 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-13 15:40:02,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:40:02,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147437733] [2024-11-13 15:40:02,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147437733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:40:02,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:40:02,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:40:02,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975857160] [2024-11-13 15:40:02,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:40:02,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:40:02,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:40:02,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:40:02,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:40:02,576 INFO L87 Difference]: Start difference. First operand has 135 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 88 states have internal predecessors, (114), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 15:40:02,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:40:02,647 INFO L93 Difference]: Finished difference Result 262 states and 397 transitions. [2024-11-13 15:40:02,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:40:02,649 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-11-13 15:40:02,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:40:02,663 INFO L225 Difference]: With dead ends: 262 [2024-11-13 15:40:02,664 INFO L226 Difference]: Without dead ends: 130 [2024-11-13 15:40:02,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:40:02,677 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:40:02,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:40:02,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-13 15:40:02,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-13 15:40:02,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 83 states have internal predecessors, (103), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 15:40:02,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 176 transitions. [2024-11-13 15:40:02,772 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 176 transitions. Word has length 116 [2024-11-13 15:40:02,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:40:02,773 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 176 transitions. [2024-11-13 15:40:02,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 15:40:02,775 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 176 transitions. [2024-11-13 15:40:02,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 15:40:02,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:40:02,781 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-13 15:40:02,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:40:02,781 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:40:02,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:40:02,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1245758056, now seen corresponding path program 1 times [2024-11-13 15:40:02,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:40:02,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537094125] [2024-11-13 15:40:02,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:02,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:40:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:03,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:03,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 15:40:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:03,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:40:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:03,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:03,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 15:40:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:04,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:40:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:04,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:04,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 15:40:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:04,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-13 15:40:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:04,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:40:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:04,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 15:40:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:04,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 15:40:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:04,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 15:40:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:04,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:04,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 15:40:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:04,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 15:40:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-13 15:40:04,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:40:04,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537094125] [2024-11-13 15:40:04,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537094125] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:40:04,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441765471] [2024-11-13 15:40:04,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:04,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:04,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:40:04,461 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:40:04,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:40:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:04,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-13 15:40:04,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:40:05,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-13 15:40:05,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-13 15:40:05,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2024-11-13 15:40:05,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2024-11-13 15:40:10,393 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-13 15:40:10,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:40:10,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441765471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:40:10,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:40:10,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2024-11-13 15:40:10,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536800660] [2024-11-13 15:40:10,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:40:10,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:40:10,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:40:10,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:40:10,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-13 15:40:10,400 INFO L87 Difference]: Start difference. First operand 130 states and 176 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-13 15:40:12,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:40:12,251 INFO L93 Difference]: Finished difference Result 329 states and 450 transitions. [2024-11-13 15:40:12,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 15:40:12,252 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 116 [2024-11-13 15:40:12,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:40:12,260 INFO L225 Difference]: With dead ends: 329 [2024-11-13 15:40:12,261 INFO L226 Difference]: Without dead ends: 216 [2024-11-13 15:40:12,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 119 SyntacticMatches, 20 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-13 15:40:12,266 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 86 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:40:12,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 763 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-13 15:40:12,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-13 15:40:12,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2024-11-13 15:40:12,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 134 states have (on average 1.2686567164179106) internal successors, (170), 136 states have internal predecessors, (170), 60 states have call successors, (60), 17 states have call predecessors, (60), 16 states have return successors, (59), 57 states have call predecessors, (59), 59 states have call successors, (59) [2024-11-13 15:40:12,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 289 transitions. [2024-11-13 15:40:12,343 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 289 transitions. Word has length 116 [2024-11-13 15:40:12,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:40:12,344 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 289 transitions. [2024-11-13 15:40:12,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-13 15:40:12,345 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 289 transitions. [2024-11-13 15:40:12,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 15:40:12,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:40:12,352 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-13 15:40:12,381 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 15:40:12,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:12,553 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:40:12,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:40:12,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1605134254, now seen corresponding path program 1 times [2024-11-13 15:40:12,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:40:12,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798145053] [2024-11-13 15:40:12,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:12,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:40:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:15,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:15,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 15:40:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:15,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:40:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:15,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:15,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 15:40:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:15,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:40:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:15,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:15,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 15:40:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:15,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-13 15:40:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:15,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:40:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:15,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 15:40:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:15,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 15:40:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:15,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 15:40:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:15,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:15,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 15:40:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:15,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 15:40:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:15,662 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-11-13 15:40:15,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:40:15,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798145053] [2024-11-13 15:40:15,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798145053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:40:15,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:40:15,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 15:40:15,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093652260] [2024-11-13 15:40:15,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:40:15,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 15:40:15,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:40:15,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 15:40:15,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:40:15,666 INFO L87 Difference]: Start difference. First operand 211 states and 289 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 8 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-13 15:40:16,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:40:16,323 INFO L93 Difference]: Finished difference Result 315 states and 424 transitions. [2024-11-13 15:40:16,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:40:16,324 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 8 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) Word has length 116 [2024-11-13 15:40:16,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:40:16,326 INFO L225 Difference]: With dead ends: 315 [2024-11-13 15:40:16,326 INFO L226 Difference]: Without dead ends: 131 [2024-11-13 15:40:16,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-13 15:40:16,327 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 9 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:40:16,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1401 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:40:16,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-13 15:40:16,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-13 15:40:16,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 84 states have internal predecessors, (104), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 15:40:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 177 transitions. [2024-11-13 15:40:16,354 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 177 transitions. Word has length 116 [2024-11-13 15:40:16,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:40:16,355 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 177 transitions. [2024-11-13 15:40:16,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 8 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-13 15:40:16,355 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 177 transitions. [2024-11-13 15:40:16,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 15:40:16,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:40:16,359 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-13 15:40:16,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:40:16,359 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:40:16,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:40:16,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1185188356, now seen corresponding path program 1 times [2024-11-13 15:40:16,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:40:16,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436936463] [2024-11-13 15:40:16,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:16,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:40:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:16,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:16,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 15:40:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:16,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:40:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:16,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:16,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:40:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:16,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:40:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:16,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:16,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:40:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:16,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:40:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:16,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 15:40:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:16,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 15:40:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:17,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-13 15:40:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:17,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 15:40:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:17,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:17,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:40:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:17,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:40:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-11-13 15:40:17,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:40:17,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436936463] [2024-11-13 15:40:17,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436936463] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:40:17,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469943718] [2024-11-13 15:40:17,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:17,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:17,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:40:17,059 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:40:17,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:40:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:17,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-13 15:40:17,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:40:17,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 15:40:17,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2024-11-13 15:40:17,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-13 15:40:17,578 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:40:17,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 15:40:17,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:40:17,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-13 15:40:17,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:40:17,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:40:17,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2024-11-13 15:40:17,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-13 15:40:17,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 15:40:17,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:40:17,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2024-11-13 15:40:17,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2024-11-13 15:40:17,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 38 [2024-11-13 15:40:21,491 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 20 proven. 33 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-13 15:40:21,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:40:22,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:40:22,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2024-11-13 15:40:22,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-13 15:40:22,424 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:40:22,425 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:40:22,536 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2024-11-13 15:40:22,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 305 treesize of output 292 [2024-11-13 15:40:22,557 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:40:22,558 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:40:22,643 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2024-11-13 15:40:22,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 335 treesize of output 322 [2024-11-13 15:40:22,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:40:22,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 258 [2024-11-13 15:40:22,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 213 [2024-11-13 15:40:22,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:40:22,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 314 treesize of output 312 [2024-11-13 15:40:22,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:40:22,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 271 treesize of output 268 [2024-11-13 15:40:23,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 15:40:23,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 15:40:24,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:40:24,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 618 treesize of output 600 [2024-11-13 15:40:26,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:40:26,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 799 treesize of output 719 [2024-11-13 15:40:28,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469943718] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:40:28,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:40:28,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 17 [2024-11-13 15:40:28,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419822767] [2024-11-13 15:40:28,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:40:28,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 15:40:28,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:40:28,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 15:40:28,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=559, Unknown=17, NotChecked=0, Total=650 [2024-11-13 15:40:28,420 INFO L87 Difference]: Start difference. First operand 131 states and 177 transitions. Second operand has 17 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 8 states have call successors, (29), 4 states have call predecessors, (29), 6 states have return successors, (28), 8 states have call predecessors, (28), 8 states have call successors, (28) [2024-11-13 15:40:31,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:40:31,104 INFO L93 Difference]: Finished difference Result 285 states and 385 transitions. [2024-11-13 15:40:31,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 15:40:31,105 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 8 states have call successors, (29), 4 states have call predecessors, (29), 6 states have return successors, (28), 8 states have call predecessors, (28), 8 states have call successors, (28) Word has length 117 [2024-11-13 15:40:31,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:40:31,112 INFO L225 Difference]: With dead ends: 285 [2024-11-13 15:40:31,112 INFO L226 Difference]: Without dead ends: 171 [2024-11-13 15:40:31,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 215 SyntacticMatches, 23 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=196, Invalid=1424, Unknown=20, NotChecked=0, Total=1640 [2024-11-13 15:40:31,114 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 232 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:40:31,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1165 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-13 15:40:31,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-13 15:40:31,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2024-11-13 15:40:31,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 115 states have internal predecessors, (146), 38 states have call successors, (38), 14 states have call predecessors, (38), 15 states have return successors, (39), 37 states have call predecessors, (39), 37 states have call successors, (39) [2024-11-13 15:40:31,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 223 transitions. [2024-11-13 15:40:31,163 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 223 transitions. Word has length 117 [2024-11-13 15:40:31,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:40:31,165 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 223 transitions. [2024-11-13 15:40:31,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 8 states have call successors, (29), 4 states have call predecessors, (29), 6 states have return successors, (28), 8 states have call predecessors, (28), 8 states have call successors, (28) [2024-11-13 15:40:31,165 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 223 transitions. [2024-11-13 15:40:31,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 15:40:31,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:40:31,171 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 15:40:31,193 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 15:40:31,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:31,372 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:40:31,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:40:31,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1708075500, now seen corresponding path program 1 times [2024-11-13 15:40:31,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:40:31,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313749866] [2024-11-13 15:40:31,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:31,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:40:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 15:40:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:40:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:40:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:40:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:40:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:40:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-13 15:40:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-13 15:40:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-13 15:40:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:40:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-13 15:40:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-13 15:40:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:31,857 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-11-13 15:40:31,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:40:31,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313749866] [2024-11-13 15:40:31,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313749866] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:40:31,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034097808] [2024-11-13 15:40:31,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:31,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:31,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:40:31,860 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:40:31,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 15:40:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:32,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 15:40:32,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:40:32,247 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-13 15:40:32,247 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:40:32,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034097808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:40:32,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:40:32,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2024-11-13 15:40:32,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804906276] [2024-11-13 15:40:32,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:40:32,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:40:32,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:40:32,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:40:32,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:40:32,249 INFO L87 Difference]: Start difference. First operand 167 states and 223 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-13 15:40:32,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:40:32,663 INFO L93 Difference]: Finished difference Result 326 states and 435 transitions. [2024-11-13 15:40:32,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:40:32,664 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 119 [2024-11-13 15:40:32,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:40:32,666 INFO L225 Difference]: With dead ends: 326 [2024-11-13 15:40:32,666 INFO L226 Difference]: Without dead ends: 176 [2024-11-13 15:40:32,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-11-13 15:40:32,670 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 197 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:40:32,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 759 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:40:32,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-13 15:40:32,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 168. [2024-11-13 15:40:32,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 114 states have (on average 1.280701754385965) internal successors, (146), 116 states have internal predecessors, (146), 38 states have call successors, (38), 14 states have call predecessors, (38), 15 states have return successors, (39), 37 states have call predecessors, (39), 37 states have call successors, (39) [2024-11-13 15:40:32,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 223 transitions. [2024-11-13 15:40:32,715 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 223 transitions. Word has length 119 [2024-11-13 15:40:32,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:40:32,716 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 223 transitions. [2024-11-13 15:40:32,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-13 15:40:32,716 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 223 transitions. [2024-11-13 15:40:32,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 15:40:32,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:40:32,719 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 15:40:32,740 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 15:40:32,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:32,923 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:40:32,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:40:32,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1457382207, now seen corresponding path program 1 times [2024-11-13 15:40:32,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:40:32,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447136883] [2024-11-13 15:40:32,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:32,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:40:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 15:40:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:40:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:40:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:40:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:40:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:40:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:40:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:40:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 15:40:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:40:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 15:40:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 15:40:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,308 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-11-13 15:40:33,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:40:33,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447136883] [2024-11-13 15:40:33,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447136883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:40:33,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020001744] [2024-11-13 15:40:33,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:33,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:33,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:40:33,311 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:40:33,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 15:40:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 15:40:33,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:40:33,697 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-13 15:40:33,697 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:40:33,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020001744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:40:33,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:40:33,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2024-11-13 15:40:33,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945544481] [2024-11-13 15:40:33,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:40:33,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:40:33,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:40:33,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:40:33,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:40:33,699 INFO L87 Difference]: Start difference. First operand 168 states and 223 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-13 15:40:34,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:40:34,136 INFO L93 Difference]: Finished difference Result 342 states and 458 transitions. [2024-11-13 15:40:34,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:40:34,136 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 121 [2024-11-13 15:40:34,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:40:34,139 INFO L225 Difference]: With dead ends: 342 [2024-11-13 15:40:34,140 INFO L226 Difference]: Without dead ends: 190 [2024-11-13 15:40:34,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-13 15:40:34,142 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 212 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:40:34,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 878 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:40:34,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-13 15:40:34,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 171. [2024-11-13 15:40:34,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 117 states have (on average 1.2820512820512822) internal successors, (150), 119 states have internal predecessors, (150), 38 states have call successors, (38), 14 states have call predecessors, (38), 15 states have return successors, (39), 37 states have call predecessors, (39), 37 states have call successors, (39) [2024-11-13 15:40:34,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 227 transitions. [2024-11-13 15:40:34,175 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 227 transitions. Word has length 121 [2024-11-13 15:40:34,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:40:34,176 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 227 transitions. [2024-11-13 15:40:34,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-13 15:40:34,176 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 227 transitions. [2024-11-13 15:40:34,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 15:40:34,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:40:34,178 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 15:40:34,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-13 15:40:34,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-13 15:40:34,379 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:40:34,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:40:34,379 INFO L85 PathProgramCache]: Analyzing trace with hash -157032775, now seen corresponding path program 1 times [2024-11-13 15:40:34,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:40:34,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284257845] [2024-11-13 15:40:34,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:34,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:40:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 15:40:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:40:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:40:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:40:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:40:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:40:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 15:40:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 15:40:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 15:40:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 15:40:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 15:40:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-13 15:40:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,797 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-11-13 15:40:34,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:40:34,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284257845] [2024-11-13 15:40:34,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284257845] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:40:34,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195988607] [2024-11-13 15:40:34,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:34,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:34,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:40:34,800 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:40:34,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 15:40:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:35,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 15:40:35,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:40:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-13 15:40:35,092 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:40:35,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195988607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:40:35,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:40:35,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-13 15:40:35,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809987882] [2024-11-13 15:40:35,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:40:35,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:40:35,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:40:35,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:40:35,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:40:35,094 INFO L87 Difference]: Start difference. First operand 171 states and 227 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-13 15:40:35,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:40:35,147 INFO L93 Difference]: Finished difference Result 330 states and 446 transitions. [2024-11-13 15:40:35,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:40:35,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2024-11-13 15:40:35,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:40:35,150 INFO L225 Difference]: With dead ends: 330 [2024-11-13 15:40:35,150 INFO L226 Difference]: Without dead ends: 179 [2024-11-13 15:40:35,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:40:35,151 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 2 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:40:35,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 340 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:40:35,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-13 15:40:35,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 173. [2024-11-13 15:40:35,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 119 states have (on average 1.2773109243697478) internal successors, (152), 121 states have internal predecessors, (152), 38 states have call successors, (38), 14 states have call predecessors, (38), 15 states have return successors, (39), 37 states have call predecessors, (39), 37 states have call successors, (39) [2024-11-13 15:40:35,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 229 transitions. [2024-11-13 15:40:35,192 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 229 transitions. Word has length 122 [2024-11-13 15:40:35,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:40:35,192 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 229 transitions. [2024-11-13 15:40:35,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-13 15:40:35,193 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 229 transitions. [2024-11-13 15:40:35,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 15:40:35,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:40:35,194 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 15:40:35,217 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 15:40:35,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-13 15:40:35,400 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:40:35,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:40:35,401 INFO L85 PathProgramCache]: Analyzing trace with hash -2087329639, now seen corresponding path program 1 times [2024-11-13 15:40:35,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:40:35,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447999406] [2024-11-13 15:40:35,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:35,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:40:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:35,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:35,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 15:40:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:35,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:40:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:35,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:35,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:40:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:35,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:40:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:35,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:35,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:40:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:35,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:40:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:35,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:40:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:35,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:40:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:35,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:40:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:35,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 15:40:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:35,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:40:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:35,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:35,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-13 15:40:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:35,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 15:40:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-11-13 15:40:35,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:40:35,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447999406] [2024-11-13 15:40:35,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447999406] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:40:35,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693208877] [2024-11-13 15:40:35,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:35,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:35,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:40:35,833 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:40:35,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 15:40:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:36,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 15:40:36,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:40:36,129 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-13 15:40:36,129 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:40:36,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693208877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:40:36,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:40:36,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2024-11-13 15:40:36,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871890780] [2024-11-13 15:40:36,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:40:36,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:40:36,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:40:36,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:40:36,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:40:36,131 INFO L87 Difference]: Start difference. First operand 173 states and 229 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 15:40:36,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:40:36,174 INFO L93 Difference]: Finished difference Result 332 states and 449 transitions. [2024-11-13 15:40:36,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:40:36,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 130 [2024-11-13 15:40:36,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:40:36,178 INFO L225 Difference]: With dead ends: 332 [2024-11-13 15:40:36,178 INFO L226 Difference]: Without dead ends: 179 [2024-11-13 15:40:36,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:40:36,180 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 1 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:40:36,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 515 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:40:36,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-13 15:40:36,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2024-11-13 15:40:36,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 123 states have (on average 1.2682926829268293) internal successors, (156), 125 states have internal predecessors, (156), 38 states have call successors, (38), 14 states have call predecessors, (38), 15 states have return successors, (39), 37 states have call predecessors, (39), 37 states have call successors, (39) [2024-11-13 15:40:36,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 233 transitions. [2024-11-13 15:40:36,208 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 233 transitions. Word has length 130 [2024-11-13 15:40:36,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:40:36,209 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 233 transitions. [2024-11-13 15:40:36,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 15:40:36,209 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 233 transitions. [2024-11-13 15:40:36,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 15:40:36,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:40:36,211 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 15:40:36,232 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 15:40:36,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:36,412 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:40:36,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:40:36,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2141722537, now seen corresponding path program 1 times [2024-11-13 15:40:36,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:40:36,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507156869] [2024-11-13 15:40:36,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:36,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:40:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:36,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:36,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 15:40:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:36,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:40:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:36,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:36,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:40:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:36,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:40:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:36,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:36,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:40:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:36,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:40:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:36,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:40:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:36,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:40:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:36,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:40:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:36,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 15:40:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:36,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:40:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:36,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:36,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-13 15:40:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:36,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 15:40:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-11-13 15:40:36,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:40:36,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507156869] [2024-11-13 15:40:36,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507156869] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:40:36,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549078912] [2024-11-13 15:40:36,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:36,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:36,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:40:36,989 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:40:36,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 15:40:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:37,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 15:40:37,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:40:37,483 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-13 15:40:37,485 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:40:37,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549078912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:40:37,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:40:37,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2024-11-13 15:40:37,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027984560] [2024-11-13 15:40:37,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:40:37,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:40:37,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:40:37,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:40:37,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-13 15:40:37,490 INFO L87 Difference]: Start difference. First operand 177 states and 233 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 5 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-11-13 15:40:38,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:40:38,072 INFO L93 Difference]: Finished difference Result 379 states and 509 transitions. [2024-11-13 15:40:38,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 15:40:38,073 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 5 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 130 [2024-11-13 15:40:38,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:40:38,075 INFO L225 Difference]: With dead ends: 379 [2024-11-13 15:40:38,075 INFO L226 Difference]: Without dead ends: 210 [2024-11-13 15:40:38,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2024-11-13 15:40:38,079 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 242 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:40:38,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 999 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:40:38,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-13 15:40:38,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 189. [2024-11-13 15:40:38,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 130 states have (on average 1.2769230769230768) internal successors, (166), 136 states have internal predecessors, (166), 41 states have call successors, (41), 14 states have call predecessors, (41), 17 states have return successors, (48), 38 states have call predecessors, (48), 40 states have call successors, (48) [2024-11-13 15:40:38,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 255 transitions. [2024-11-13 15:40:38,122 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 255 transitions. Word has length 130 [2024-11-13 15:40:38,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:40:38,122 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 255 transitions. [2024-11-13 15:40:38,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 5 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-11-13 15:40:38,123 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 255 transitions. [2024-11-13 15:40:38,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 15:40:38,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:40:38,124 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 15:40:38,146 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-13 15:40:38,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:38,328 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:40:38,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:40:38,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1355362213, now seen corresponding path program 1 times [2024-11-13 15:40:38,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:40:38,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048053171] [2024-11-13 15:40:38,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:38,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:40:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:38,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:38,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 15:40:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:38,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:40:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:38,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:38,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:40:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:38,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:40:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:38,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:38,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:40:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:38,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:40:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:38,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:40:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:38,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:40:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:38,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 15:40:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:38,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 15:40:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:38,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:40:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:38,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:38,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-13 15:40:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:38,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 15:40:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-11-13 15:40:38,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:40:38,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048053171] [2024-11-13 15:40:38,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048053171] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:40:38,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742971714] [2024-11-13 15:40:38,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:38,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:38,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:40:38,851 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:40:38,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 15:40:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:39,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 15:40:39,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:40:39,361 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-13 15:40:39,361 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:40:39,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742971714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:40:39,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:40:39,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 14 [2024-11-13 15:40:39,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134075717] [2024-11-13 15:40:39,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:40:39,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 15:40:39,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:40:39,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 15:40:39,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:40:39,363 INFO L87 Difference]: Start difference. First operand 189 states and 255 transitions. Second operand has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 10 states have internal predecessors, (64), 5 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2024-11-13 15:40:39,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:40:39,924 INFO L93 Difference]: Finished difference Result 367 states and 496 transitions. [2024-11-13 15:40:39,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:40:39,924 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 10 states have internal predecessors, (64), 5 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 130 [2024-11-13 15:40:39,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:40:39,927 INFO L225 Difference]: With dead ends: 367 [2024-11-13 15:40:39,927 INFO L226 Difference]: Without dead ends: 198 [2024-11-13 15:40:39,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2024-11-13 15:40:39,928 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 169 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:40:39,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1314 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:40:39,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-13 15:40:39,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 189. [2024-11-13 15:40:39,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 130 states have (on average 1.2769230769230768) internal successors, (166), 136 states have internal predecessors, (166), 41 states have call successors, (41), 14 states have call predecessors, (41), 17 states have return successors, (48), 38 states have call predecessors, (48), 40 states have call successors, (48) [2024-11-13 15:40:39,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 255 transitions. [2024-11-13 15:40:39,969 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 255 transitions. Word has length 130 [2024-11-13 15:40:39,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:40:39,969 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 255 transitions. [2024-11-13 15:40:39,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 10 states have internal predecessors, (64), 5 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2024-11-13 15:40:39,970 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 255 transitions. [2024-11-13 15:40:39,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 15:40:39,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:40:39,971 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 15:40:39,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-13 15:40:40,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-13 15:40:40,172 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:40:40,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:40:40,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1802329784, now seen corresponding path program 1 times [2024-11-13 15:40:40,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:40:40,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141353929] [2024-11-13 15:40:40,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:40,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:40:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:40,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:40,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 15:40:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:40,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:40:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:40,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:40,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:40:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:40,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:40:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:40,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:40,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:40:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:40,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:40:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:40,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:40:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:40,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:40:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:40,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 15:40:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:40,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 15:40:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:40,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 15:40:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:40,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:40,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 15:40:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:40,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 15:40:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:40,780 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2024-11-13 15:40:40,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:40:40,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141353929] [2024-11-13 15:40:40,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141353929] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:40:40,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117634452] [2024-11-13 15:40:40,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:40,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:40,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:40:40,783 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:40:40,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 15:40:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:41,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-13 15:40:41,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:40:41,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-13 15:40:41,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-13 15:40:41,598 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 108 proven. 1 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-13 15:40:41,598 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:40:41,923 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-11-13 15:40:41,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117634452] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:40:41,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:40:41,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 8] total 23 [2024-11-13 15:40:41,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430653652] [2024-11-13 15:40:41,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:40:41,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 15:40:41,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:40:41,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 15:40:41,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2024-11-13 15:40:41,925 INFO L87 Difference]: Start difference. First operand 189 states and 255 transitions. Second operand has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 22 states have internal predecessors, (109), 7 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 7 states have call predecessors, (31), 7 states have call successors, (31) [2024-11-13 15:40:43,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:40:43,455 INFO L93 Difference]: Finished difference Result 482 states and 695 transitions. [2024-11-13 15:40:43,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-13 15:40:43,455 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 22 states have internal predecessors, (109), 7 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 7 states have call predecessors, (31), 7 states have call successors, (31) Word has length 132 [2024-11-13 15:40:43,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:40:43,459 INFO L225 Difference]: With dead ends: 482 [2024-11-13 15:40:43,459 INFO L226 Difference]: Without dead ends: 308 [2024-11-13 15:40:43,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=195, Invalid=1445, Unknown=0, NotChecked=0, Total=1640 [2024-11-13 15:40:43,461 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 114 mSDsluCounter, 2734 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:40:43,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 2890 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 15:40:43,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-13 15:40:43,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 233. [2024-11-13 15:40:43,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 169 states have (on average 1.272189349112426) internal successors, (215), 175 states have internal predecessors, (215), 43 states have call successors, (43), 16 states have call predecessors, (43), 20 states have return successors, (58), 41 states have call predecessors, (58), 42 states have call successors, (58) [2024-11-13 15:40:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 316 transitions. [2024-11-13 15:40:43,504 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 316 transitions. Word has length 132 [2024-11-13 15:40:43,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:40:43,505 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 316 transitions. [2024-11-13 15:40:43,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 22 states have internal predecessors, (109), 7 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 7 states have call predecessors, (31), 7 states have call successors, (31) [2024-11-13 15:40:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 316 transitions. [2024-11-13 15:40:43,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 15:40:43,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:40:43,507 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 15:40:43,530 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 15:40:43,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:43,712 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:40:43,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:40:43,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2000909832, now seen corresponding path program 1 times [2024-11-13 15:40:43,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:40:43,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545331468] [2024-11-13 15:40:43,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:43,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:40:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:43,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:43,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 15:40:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:43,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:40:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:43,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:43,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:40:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:43,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:40:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:43,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:43,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:40:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:43,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:40:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:43,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:40:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:43,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:40:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:43,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 15:40:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:43,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 15:40:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:43,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 15:40:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:43,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:43,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 15:40:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:43,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 15:40:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:43,941 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-13 15:40:43,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:40:43,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545331468] [2024-11-13 15:40:43,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545331468] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:40:43,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379361503] [2024-11-13 15:40:43,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:43,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:43,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:40:43,945 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:40:43,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 15:40:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:44,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 15:40:44,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:40:44,287 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-13 15:40:44,287 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:40:44,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379361503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:40:44,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:40:44,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-13 15:40:44,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432733140] [2024-11-13 15:40:44,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:40:44,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:40:44,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:40:44,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:40:44,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:40:44,290 INFO L87 Difference]: Start difference. First operand 233 states and 316 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 15:40:44,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:40:44,339 INFO L93 Difference]: Finished difference Result 448 states and 614 transitions. [2024-11-13 15:40:44,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:40:44,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 132 [2024-11-13 15:40:44,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:40:44,342 INFO L225 Difference]: With dead ends: 448 [2024-11-13 15:40:44,342 INFO L226 Difference]: Without dead ends: 235 [2024-11-13 15:40:44,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:40:44,344 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:40:44,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 516 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:40:44,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-13 15:40:44,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2024-11-13 15:40:44,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 169 states have (on average 1.2603550295857988) internal successors, (213), 175 states have internal predecessors, (213), 43 states have call successors, (43), 16 states have call predecessors, (43), 20 states have return successors, (58), 41 states have call predecessors, (58), 42 states have call successors, (58) [2024-11-13 15:40:44,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 314 transitions. [2024-11-13 15:40:44,387 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 314 transitions. Word has length 132 [2024-11-13 15:40:44,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:40:44,388 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 314 transitions. [2024-11-13 15:40:44,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 15:40:44,388 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 314 transitions. [2024-11-13 15:40:44,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 15:40:44,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:40:44,390 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 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] [2024-11-13 15:40:44,413 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-13 15:40:44,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:44,590 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:40:44,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:40:44,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2027975434, now seen corresponding path program 1 times [2024-11-13 15:40:44,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:40:44,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515426723] [2024-11-13 15:40:44,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:44,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:40:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:44,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:44,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 15:40:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:44,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:40:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:44,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:44,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:40:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:44,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:40:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:44,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:44,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:40:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:44,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:40:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:44,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:40:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:44,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:40:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:44,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 15:40:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:44,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 15:40:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:44,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 15:40:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:44,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:44,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 15:40:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:44,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 15:40:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:44,820 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-13 15:40:44,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:40:44,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515426723] [2024-11-13 15:40:44,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515426723] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:40:44,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401457143] [2024-11-13 15:40:44,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:44,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:44,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:40:44,823 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:40:44,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 15:40:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:45,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 15:40:45,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:40:45,154 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-13 15:40:45,154 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:40:45,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401457143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:40:45,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:40:45,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-13 15:40:45,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312914274] [2024-11-13 15:40:45,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:40:45,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:40:45,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:40:45,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:40:45,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:40:45,156 INFO L87 Difference]: Start difference. First operand 233 states and 314 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 15:40:45,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:40:45,207 INFO L93 Difference]: Finished difference Result 442 states and 601 transitions. [2024-11-13 15:40:45,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:40:45,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 132 [2024-11-13 15:40:45,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:40:45,211 INFO L225 Difference]: With dead ends: 442 [2024-11-13 15:40:45,211 INFO L226 Difference]: Without dead ends: 229 [2024-11-13 15:40:45,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:40:45,213 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:40:45,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 516 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:40:45,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-13 15:40:45,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 217. [2024-11-13 15:40:45,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 157 states have (on average 1.2420382165605095) internal successors, (195), 159 states have internal predecessors, (195), 41 states have call successors, (41), 16 states have call predecessors, (41), 18 states have return successors, (48), 41 states have call predecessors, (48), 40 states have call successors, (48) [2024-11-13 15:40:45,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 284 transitions. [2024-11-13 15:40:45,247 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 284 transitions. Word has length 132 [2024-11-13 15:40:45,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:40:45,247 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 284 transitions. [2024-11-13 15:40:45,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 15:40:45,248 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 284 transitions. [2024-11-13 15:40:45,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 15:40:45,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:40:45,250 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 15:40:45,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-13 15:40:45,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:45,451 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:40:45,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:40:45,451 INFO L85 PathProgramCache]: Analyzing trace with hash 2034494226, now seen corresponding path program 1 times [2024-11-13 15:40:45,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:40:45,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397719173] [2024-11-13 15:40:45,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:45,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:40:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:46,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:46,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 15:40:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:46,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:40:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:46,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:46,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:40:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:46,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:40:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:46,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:46,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:40:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:46,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:40:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:46,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:40:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:46,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 15:40:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:46,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 15:40:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:46,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:40:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:46,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:40:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:46,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:46,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 15:40:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:46,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-13 15:40:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:46,725 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-13 15:40:46,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:40:46,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397719173] [2024-11-13 15:40:46,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397719173] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:40:46,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922470521] [2024-11-13 15:40:46,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:46,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:46,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:40:46,728 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:40:46,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 15:40:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:47,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-11-13 15:40:47,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:40:47,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:40:47,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-13 15:40:47,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:40:47,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-11-13 15:40:47,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2024-11-13 15:40:47,432 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13| Int) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse2 24))) (and (<= (+ .cse0 2) .cse1) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) .cse1) 24 .cse0) .cse2) (<= 2 .cse1)))))) is different from true [2024-11-13 15:40:47,625 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13| Int) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse2 24))) (and (<= (+ .cse0 2) .cse1) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) .cse1) 24 .cse0) .cse2) (<= 2 .cse1)))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_14| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse3 (select v_DerPreprocessor_4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_14|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (select .cse5 24))) (and (<= 2 .cse3) (<= (+ .cse4 2) .cse3) (= .cse5 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_3) .cse4 v_DerPreprocessor_4) .cse3) 24 .cse4)))))))) is different from true [2024-11-13 15:40:47,994 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_15| Int)) (let ((.cse1 (select v_DerPreprocessor_6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_15|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse2 24))) (and (<= (+ 2 .cse0) .cse1) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_5) .cse0 v_DerPreprocessor_6) .cse1) 24 .cse0)) (<= 2 .cse1)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13| Int) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse4 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse3 (select .cse5 24))) (and (<= (+ .cse3 2) .cse4) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) .cse4) 24 .cse3) .cse5) (<= 2 .cse4)))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_14| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_14|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse6))) (let ((.cse7 (select .cse8 24))) (and (<= 2 .cse6) (<= (+ .cse7 2) .cse6) (= .cse8 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse6 v_DerPreprocessor_3) .cse7 v_DerPreprocessor_4) .cse6) 24 .cse7)))))))) is different from true [2024-11-13 15:40:48,422 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_15| Int)) (let ((.cse1 (select v_DerPreprocessor_6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_15|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse2 24))) (and (<= (+ 2 .cse0) .cse1) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_5) .cse0 v_DerPreprocessor_6) .cse1) 24 .cse0)) (<= 2 .cse1)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13| Int) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse4 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse3 (select .cse5 24))) (and (<= (+ .cse3 2) .cse4) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) .cse4) 24 .cse3) .cse5) (<= 2 .cse4)))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_14| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_14|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse6))) (let ((.cse7 (select .cse8 24))) (and (<= 2 .cse6) (<= (+ .cse7 2) .cse6) (= .cse8 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse6 v_DerPreprocessor_3) .cse7 v_DerPreprocessor_4) .cse6) 24 .cse7))))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16| Int)) (let ((.cse10 (select v_DerPreprocessor_8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16|))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse10))) (let ((.cse9 (select .cse11 24))) (and (<= (+ 2 .cse9) .cse10) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_7) .cse9 v_DerPreprocessor_8) .cse10) 24 .cse9) .cse11) (<= 2 .cse10))))))) is different from true [2024-11-13 15:40:48,843 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17| Int)) (let ((.cse1 (select v_DerPreprocessor_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse2 (select .cse0 24))) (and (= .cse0 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_9) .cse2 v_DerPreprocessor_10) .cse1) 24 .cse2)) (<= (+ .cse2 2) .cse1) (<= 2 .cse1)))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_15| Int)) (let ((.cse4 (select v_DerPreprocessor_6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_15|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse3 (select .cse5 24))) (and (<= (+ 2 .cse3) .cse4) (= .cse5 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_5) .cse3 v_DerPreprocessor_6) .cse4) 24 .cse3)) (<= 2 .cse4)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13| Int) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse7 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse7))) (let ((.cse6 (select .cse8 24))) (and (<= (+ .cse6 2) .cse7) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) .cse7) 24 .cse6) .cse8) (<= 2 .cse7)))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_14| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse9 (select v_DerPreprocessor_4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_14|))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse9))) (let ((.cse10 (select .cse11 24))) (and (<= 2 .cse9) (<= (+ .cse10 2) .cse9) (= .cse11 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse9 v_DerPreprocessor_3) .cse10 v_DerPreprocessor_4) .cse9) 24 .cse10))))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16| Int)) (let ((.cse13 (select v_DerPreprocessor_8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16|))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse13))) (let ((.cse12 (select .cse14 24))) (and (<= (+ 2 .cse12) .cse13) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse13 v_DerPreprocessor_7) .cse12 v_DerPreprocessor_8) .cse13) 24 .cse12) .cse14) (<= 2 .cse13))))))) is different from true [2024-11-13 15:40:52,243 INFO L349 Elim1Store]: treesize reduction 228, result has 0.4 percent of original size [2024-11-13 15:40:52,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 425 treesize of output 1 [2024-11-13 15:40:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 112 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 45 not checked. [2024-11-13 15:40:52,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:40:52,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922470521] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:40:52,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:40:52,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 24] total 35 [2024-11-13 15:40:52,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201365234] [2024-11-13 15:40:52,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:40:52,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-13 15:40:52,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:40:52,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-13 15:40:52,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=964, Unknown=15, NotChecked=330, Total=1406 [2024-11-13 15:40:52,913 INFO L87 Difference]: Start difference. First operand 217 states and 284 transitions. Second operand has 35 states, 32 states have (on average 4.09375) internal successors, (131), 30 states have internal predecessors, (131), 15 states have call successors, (33), 8 states have call predecessors, (33), 10 states have return successors, (32), 14 states have call predecessors, (32), 15 states have call successors, (32) [2024-11-13 15:40:53,519 WARN L873 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13| Int) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_13|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse2 24))) (and (<= (+ .cse0 2) .cse1) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) .cse1) 24 .cse0) .cse2) (<= 2 .cse1))))))) is different from true [2024-11-13 15:40:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:40:57,227 INFO L93 Difference]: Finished difference Result 545 states and 711 transitions. [2024-11-13 15:40:57,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-13 15:40:57,227 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 4.09375) internal successors, (131), 30 states have internal predecessors, (131), 15 states have call successors, (33), 8 states have call predecessors, (33), 10 states have return successors, (32), 14 states have call predecessors, (32), 15 states have call successors, (32) Word has length 133 [2024-11-13 15:40:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:40:57,230 INFO L225 Difference]: With dead ends: 545 [2024-11-13 15:40:57,230 INFO L226 Difference]: Without dead ends: 325 [2024-11-13 15:40:57,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 198 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=182, Invalid=1790, Unknown=32, NotChecked=546, Total=2550 [2024-11-13 15:40:57,232 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 66 mSDsluCounter, 2587 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 12 mSolverCounterUnsat, 62 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 2766 SdHoareTripleChecker+Invalid, 3699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 62 IncrementalHoareTripleChecker+Unknown, 2175 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:40:57,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 2766 Invalid, 3699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1450 Invalid, 62 Unknown, 2175 Unchecked, 3.2s Time] [2024-11-13 15:40:57,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-13 15:40:57,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 279. [2024-11-13 15:40:57,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 207 states have (on average 1.21256038647343) internal successors, (251), 206 states have internal predecessors, (251), 45 states have call successors, (45), 25 states have call predecessors, (45), 26 states have return successors, (53), 47 states have call predecessors, (53), 44 states have call successors, (53) [2024-11-13 15:40:57,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 349 transitions. [2024-11-13 15:40:57,286 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 349 transitions. Word has length 133 [2024-11-13 15:40:57,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:40:57,287 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 349 transitions. [2024-11-13 15:40:57,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 4.09375) internal successors, (131), 30 states have internal predecessors, (131), 15 states have call successors, (33), 8 states have call predecessors, (33), 10 states have return successors, (32), 14 states have call predecessors, (32), 15 states have call successors, (32) [2024-11-13 15:40:57,287 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 349 transitions. [2024-11-13 15:40:57,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-13 15:40:57,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:40:57,289 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2024-11-13 15:40:57,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 15:40:57,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-13 15:40:57,490 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:40:57,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:40:57,490 INFO L85 PathProgramCache]: Analyzing trace with hash -665789603, now seen corresponding path program 1 times [2024-11-13 15:40:57,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:40:57,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808002578] [2024-11-13 15:40:57,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:57,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:40:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:57,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:40:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:57,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 15:40:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:57,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:40:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:57,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:57,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:40:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:57,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:40:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:57,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:57,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:40:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:57,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:40:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:57,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:40:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:57,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:40:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:57,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:40:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:57,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 15:40:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:57,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 15:40:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:57,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 15:40:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:57,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:40:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:57,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-13 15:40:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:57,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 15:40:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:57,898 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2024-11-13 15:40:57,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:40:57,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808002578] [2024-11-13 15:40:57,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808002578] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:40:57,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817679998] [2024-11-13 15:40:57,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:57,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:57,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:40:57,902 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:40:57,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 15:40:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:58,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-13 15:40:58,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:40:58,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 15:40:58,454 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:40:58,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 15:40:58,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-13 15:40:58,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 15:40:58,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-13 15:40:58,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 15:40:58,542 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-13 15:40:58,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 50 [2024-11-13 15:40:58,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:40:58,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2024-11-13 15:40:58,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2024-11-13 15:41:00,958 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 20 proven. 33 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-13 15:41:00,958 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:41:01,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:41:01,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 110 [2024-11-13 15:41:01,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:41:01,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 82 [2024-11-13 15:41:02,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:41:02,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 681 treesize of output 599 [2024-11-13 15:41:02,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:41:02,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 721 treesize of output 693 [2024-11-13 15:41:02,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:41:02,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 412 treesize of output 426 [2024-11-13 15:41:02,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 419 treesize of output 411 [2024-11-13 15:41:02,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-13 15:41:02,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-13 15:41:02,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:41:02,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 87 [2024-11-13 15:41:03,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-11-13 15:41:03,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 15:41:03,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 15:41:03,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-13 15:41:03,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:41:03,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 309 treesize of output 259 [2024-11-13 15:41:04,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817679998] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:41:04,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:41:04,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17] total 20 [2024-11-13 15:41:04,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145978496] [2024-11-13 15:41:04,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:41:04,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 15:41:04,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:41:04,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 15:41:04,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 15:41:04,906 INFO L87 Difference]: Start difference. First operand 279 states and 349 transitions. Second operand has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 8 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (31), 7 states have call predecessors, (31), 8 states have call successors, (31) [2024-11-13 15:41:07,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:41:07,516 INFO L93 Difference]: Finished difference Result 685 states and 879 transitions. [2024-11-13 15:41:07,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 15:41:07,517 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 8 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (31), 7 states have call predecessors, (31), 8 states have call successors, (31) Word has length 143 [2024-11-13 15:41:07,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:41:07,519 INFO L225 Difference]: With dead ends: 685 [2024-11-13 15:41:07,520 INFO L226 Difference]: Without dead ends: 461 [2024-11-13 15:41:07,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 270 SyntacticMatches, 23 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=285, Invalid=2265, Unknown=0, NotChecked=0, Total=2550 [2024-11-13 15:41:07,522 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 316 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:41:07,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1197 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-13 15:41:07,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-11-13 15:41:07,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 439. [2024-11-13 15:41:07,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 324 states have (on average 1.1882716049382716) internal successors, (385), 324 states have internal predecessors, (385), 72 states have call successors, (72), 41 states have call predecessors, (72), 42 states have return successors, (88), 73 states have call predecessors, (88), 71 states have call successors, (88) [2024-11-13 15:41:07,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 545 transitions. [2024-11-13 15:41:07,619 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 545 transitions. Word has length 143 [2024-11-13 15:41:07,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:41:07,620 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 545 transitions. [2024-11-13 15:41:07,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 8 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (31), 7 states have call predecessors, (31), 8 states have call successors, (31) [2024-11-13 15:41:07,620 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 545 transitions. [2024-11-13 15:41:07,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-13 15:41:07,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:41:07,622 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-11-13 15:41:07,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-13 15:41:07,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-13 15:41:07,827 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:41:07,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:41:07,827 INFO L85 PathProgramCache]: Analyzing trace with hash 232822683, now seen corresponding path program 1 times [2024-11-13 15:41:07,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:41:07,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524209754] [2024-11-13 15:41:07,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:07,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:41:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:09,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:41:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:09,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 15:41:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:09,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:41:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:09,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:41:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:09,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:41:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:09,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:41:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:09,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:41:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:09,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:41:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:09,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:41:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:09,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:41:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:09,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:41:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:09,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:41:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:09,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 15:41:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:09,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 15:41:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:09,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 15:41:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:09,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:41:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:09,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-13 15:41:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:09,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 15:41:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-13 15:41:09,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:41:09,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524209754] [2024-11-13 15:41:09,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524209754] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:41:09,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158460766] [2024-11-13 15:41:09,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:09,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:41:09,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:41:09,443 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:41:09,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 15:41:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:09,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-13 15:41:09,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:41:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-13 15:41:10,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:41:10,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158460766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:41:10,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:41:10,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2024-11-13 15:41:10,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298684911] [2024-11-13 15:41:10,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:41:10,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:41:10,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:41:10,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:41:10,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2024-11-13 15:41:10,112 INFO L87 Difference]: Start difference. First operand 439 states and 545 transitions. Second operand has 11 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 6 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2024-11-13 15:41:10,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:41:10,711 INFO L93 Difference]: Finished difference Result 755 states and 958 transitions. [2024-11-13 15:41:10,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:41:10,712 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 6 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 143 [2024-11-13 15:41:10,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:41:10,715 INFO L225 Difference]: With dead ends: 755 [2024-11-13 15:41:10,715 INFO L226 Difference]: Without dead ends: 460 [2024-11-13 15:41:10,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2024-11-13 15:41:10,718 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 173 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:41:10,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1172 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:41:10,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-13 15:41:10,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 439. [2024-11-13 15:41:10,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 324 states have (on average 1.1882716049382716) internal successors, (385), 324 states have internal predecessors, (385), 72 states have call successors, (72), 41 states have call predecessors, (72), 42 states have return successors, (88), 73 states have call predecessors, (88), 71 states have call successors, (88) [2024-11-13 15:41:10,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 545 transitions. [2024-11-13 15:41:10,817 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 545 transitions. Word has length 143 [2024-11-13 15:41:10,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:41:10,818 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 545 transitions. [2024-11-13 15:41:10,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 6 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2024-11-13 15:41:10,818 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 545 transitions. [2024-11-13 15:41:10,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 15:41:10,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:41:10,820 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-11-13 15:41:10,841 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 15:41:11,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:41:11,021 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:41:11,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:41:11,021 INFO L85 PathProgramCache]: Analyzing trace with hash -2121100779, now seen corresponding path program 1 times [2024-11-13 15:41:11,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:41:11,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853161159] [2024-11-13 15:41:11,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:11,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:41:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:11,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:41:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:11,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 15:41:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:11,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:41:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:11,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:41:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:11,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:41:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:11,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:41:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:11,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:41:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:11,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:41:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:11,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:41:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:11,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:41:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:11,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:41:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:11,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 15:41:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:11,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 15:41:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:11,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-13 15:41:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:11,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-13 15:41:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:11,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:41:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:11,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 15:41:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:11,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 15:41:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:11,408 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-13 15:41:11,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:41:11,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853161159] [2024-11-13 15:41:11,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853161159] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:41:11,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063237552] [2024-11-13 15:41:11,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:11,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:41:11,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:41:11,412 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:41:11,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 15:41:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:11,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-13 15:41:11,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:41:11,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 15:41:11,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-13 15:41:11,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-13 15:41:11,995 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:41:11,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 15:41:12,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:41:12,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:41:12,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2024-11-13 15:41:12,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:41:12,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:41:12,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2024-11-13 15:41:12,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-13 15:41:12,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-13 15:41:12,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 38 [2024-11-13 15:41:12,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:41:12,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2024-11-13 15:41:12,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2024-11-13 15:41:15,658 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 20 proven. 33 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-13 15:41:15,658 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:41:16,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:41:16,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2024-11-13 15:41:16,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-13 15:41:16,394 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:41:16,394 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:41:16,493 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2024-11-13 15:41:16,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 179 treesize of output 208 [2024-11-13 15:41:16,506 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:41:16,507 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:41:16,598 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2024-11-13 15:41:16,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 335 treesize of output 322 [2024-11-13 15:41:16,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:41:16,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 268 treesize of output 266 [2024-11-13 15:41:16,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:41:16,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 222 [2024-11-13 15:41:16,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:41:16,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 312 treesize of output 310 [2024-11-13 15:41:16,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 269 treesize of output 257 [2024-11-13 15:41:17,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 15:41:17,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 15:41:17,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:41:17,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 299 treesize of output 289 [2024-11-13 15:41:18,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:41:18,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 344 treesize of output 318 [2024-11-13 15:41:19,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063237552] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:41:19,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:41:19,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14] total 18 [2024-11-13 15:41:19,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795150897] [2024-11-13 15:41:19,064 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:41:19,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 15:41:19,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:41:19,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 15:41:19,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=664, Unknown=10, NotChecked=0, Total=756 [2024-11-13 15:41:19,065 INFO L87 Difference]: Start difference. First operand 439 states and 545 transitions. Second operand has 18 states, 17 states have (on average 6.705882352941177) internal successors, (114), 17 states have internal predecessors, (114), 8 states have call successors, (31), 4 states have call predecessors, (31), 6 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) [2024-11-13 15:41:22,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:41:22,521 INFO L93 Difference]: Finished difference Result 748 states and 944 transitions. [2024-11-13 15:41:22,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 15:41:22,521 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.705882352941177) internal successors, (114), 17 states have internal predecessors, (114), 8 states have call successors, (31), 4 states have call predecessors, (31), 6 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) Word has length 144 [2024-11-13 15:41:22,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:41:22,524 INFO L225 Difference]: With dead ends: 748 [2024-11-13 15:41:22,524 INFO L226 Difference]: Without dead ends: 447 [2024-11-13 15:41:22,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 272 SyntacticMatches, 23 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=246, Invalid=1814, Unknown=10, NotChecked=0, Total=2070 [2024-11-13 15:41:22,526 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 222 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 15:41:22,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1276 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-13 15:41:22,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-11-13 15:41:22,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 443. [2024-11-13 15:41:22,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 326 states have (on average 1.177914110429448) internal successors, (384), 328 states have internal predecessors, (384), 72 states have call successors, (72), 41 states have call predecessors, (72), 44 states have return successors, (90), 73 states have call predecessors, (90), 71 states have call successors, (90) [2024-11-13 15:41:22,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 546 transitions. [2024-11-13 15:41:22,650 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 546 transitions. Word has length 144 [2024-11-13 15:41:22,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:41:22,650 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 546 transitions. [2024-11-13 15:41:22,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.705882352941177) internal successors, (114), 17 states have internal predecessors, (114), 8 states have call successors, (31), 4 states have call predecessors, (31), 6 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) [2024-11-13 15:41:22,651 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 546 transitions. [2024-11-13 15:41:22,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-13 15:41:22,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:41:22,652 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-13 15:41:22,676 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-13 15:41:22,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-13 15:41:22,853 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:41:22,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:41:22,854 INFO L85 PathProgramCache]: Analyzing trace with hash -447796301, now seen corresponding path program 1 times [2024-11-13 15:41:22,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:41:22,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828188009] [2024-11-13 15:41:22,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:22,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:41:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:23,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:41:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:23,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 15:41:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:23,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:41:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:23,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:41:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:23,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:41:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:23,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:41:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:23,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:41:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:23,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:41:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:23,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:41:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:23,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:41:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:23,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:41:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:23,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 15:41:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:23,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 15:41:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:23,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-13 15:41:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:23,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 15:41:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:23,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:41:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:23,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-13 15:41:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:23,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-13 15:41:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:23,261 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-11-13 15:41:23,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:41:23,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828188009] [2024-11-13 15:41:23,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828188009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:41:23,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856849964] [2024-11-13 15:41:23,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:23,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:41:23,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:41:23,265 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:41:23,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-13 15:41:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:23,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 15:41:23,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:41:23,803 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-13 15:41:23,803 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:41:23,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856849964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:41:23,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:41:23,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2024-11-13 15:41:23,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143669784] [2024-11-13 15:41:23,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:41:23,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:41:23,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:41:23,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:41:23,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-11-13 15:41:23,805 INFO L87 Difference]: Start difference. First operand 443 states and 546 transitions. Second operand has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2024-11-13 15:41:24,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:41:24,233 INFO L93 Difference]: Finished difference Result 750 states and 937 transitions. [2024-11-13 15:41:24,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:41:24,233 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) Word has length 146 [2024-11-13 15:41:24,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:41:24,237 INFO L225 Difference]: With dead ends: 750 [2024-11-13 15:41:24,237 INFO L226 Difference]: Without dead ends: 451 [2024-11-13 15:41:24,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2024-11-13 15:41:24,239 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 201 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:41:24,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 888 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:41:24,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-11-13 15:41:24,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 443. [2024-11-13 15:41:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 326 states have (on average 1.165644171779141) internal successors, (380), 328 states have internal predecessors, (380), 72 states have call successors, (72), 41 states have call predecessors, (72), 44 states have return successors, (90), 73 states have call predecessors, (90), 71 states have call successors, (90) [2024-11-13 15:41:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 542 transitions. [2024-11-13 15:41:24,387 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 542 transitions. Word has length 146 [2024-11-13 15:41:24,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:41:24,388 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 542 transitions. [2024-11-13 15:41:24,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2024-11-13 15:41:24,388 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 542 transitions. [2024-11-13 15:41:24,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 15:41:24,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:41:24,389 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 15:41:24,405 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-13 15:41:24,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-13 15:41:24,590 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:41:24,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:41:24,590 INFO L85 PathProgramCache]: Analyzing trace with hash 432292736, now seen corresponding path program 1 times [2024-11-13 15:41:24,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:41:24,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634182610] [2024-11-13 15:41:24,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:24,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:41:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:24,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:41:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:25,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 15:41:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:25,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:41:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:25,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:41:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:25,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:41:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:25,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:41:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:25,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:41:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:25,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:41:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:25,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:41:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:25,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:41:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:25,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:41:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:25,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 15:41:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:25,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 15:41:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:25,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:41:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:25,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-13 15:41:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:25,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 15:41:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:25,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:41:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:25,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-13 15:41:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:25,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-13 15:41:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:25,509 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 10 proven. 38 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-11-13 15:41:25,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:41:25,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634182610] [2024-11-13 15:41:25,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634182610] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:41:25,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357740178] [2024-11-13 15:41:25,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:25,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:41:25,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:41:25,512 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:41:25,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-13 15:41:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:25,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-13 15:41:25,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:41:26,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-13 15:41:26,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-13 15:41:30,186 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_3| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_4| Int)) (not (= (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_4|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_3|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_3| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_4| Int)) (not (= (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_4|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_3|) 0)))) is different from true [2024-11-13 15:41:34,255 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_4| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_5| Int)) (not (= (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_5|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_4|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_4| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_5| Int)) (not (= (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_5|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_4|) 0)))) is different from true [2024-11-13 15:41:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 105 proven. 29 refuted. 0 times theorem prover too weak. 79 trivial. 21 not checked. [2024-11-13 15:41:35,392 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:41:35,874 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-13 15:41:35,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357740178] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:41:35,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:41:35,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 12] total 30 [2024-11-13 15:41:35,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119992733] [2024-11-13 15:41:35,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:41:35,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-13 15:41:35,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:41:35,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-13 15:41:35,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=670, Unknown=2, NotChecked=106, Total=870 [2024-11-13 15:41:35,877 INFO L87 Difference]: Start difference. First operand 443 states and 542 transitions. Second operand has 30 states, 30 states have (on average 5.033333333333333) internal successors, (151), 28 states have internal predecessors, (151), 12 states have call successors, (35), 5 states have call predecessors, (35), 7 states have return successors, (34), 12 states have call predecessors, (34), 11 states have call successors, (34) [2024-11-13 15:41:39,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:41:43,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:41:47,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:41:52,333 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_4| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_5| Int)) (not (= (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_5|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_4|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_4| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_5| Int)) (not (= (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_5|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_4|) 0)))) (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_3| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_4| Int)) (not (= (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_4|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_3|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_3| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_4| Int)) (not (= (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_4|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_3|) 0))))) is different from true [2024-11-13 15:41:57,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:42:01,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:42:02,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:42:02,161 INFO L93 Difference]: Finished difference Result 817 states and 1001 transitions. [2024-11-13 15:42:02,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-13 15:42:02,161 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.033333333333333) internal successors, (151), 28 states have internal predecessors, (151), 12 states have call successors, (35), 5 states have call predecessors, (35), 7 states have return successors, (34), 12 states have call predecessors, (34), 11 states have call successors, (34) Word has length 157 [2024-11-13 15:42:02,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:42:02,166 INFO L225 Difference]: With dead ends: 817 [2024-11-13 15:42:02,166 INFO L226 Difference]: Without dead ends: 602 [2024-11-13 15:42:02,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 332 SyntacticMatches, 13 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=398, Invalid=2691, Unknown=3, NotChecked=330, Total=3422 [2024-11-13 15:42:02,169 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 239 mSDsluCounter, 2032 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 94 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 2501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 892 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:42:02,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 2204 Invalid, 2501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1510 Invalid, 5 Unknown, 892 Unchecked, 21.4s Time] [2024-11-13 15:42:02,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-13 15:42:02,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 510. [2024-11-13 15:42:02,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 379 states have (on average 1.1609498680738786) internal successors, (440), 386 states have internal predecessors, (440), 79 states have call successors, (79), 47 states have call predecessors, (79), 51 states have return successors, (93), 76 states have call predecessors, (93), 77 states have call successors, (93) [2024-11-13 15:42:02,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 612 transitions. [2024-11-13 15:42:02,313 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 612 transitions. Word has length 157 [2024-11-13 15:42:02,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:42:02,314 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 612 transitions. [2024-11-13 15:42:02,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.033333333333333) internal successors, (151), 28 states have internal predecessors, (151), 12 states have call successors, (35), 5 states have call predecessors, (35), 7 states have return successors, (34), 12 states have call predecessors, (34), 11 states have call successors, (34) [2024-11-13 15:42:02,315 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 612 transitions. [2024-11-13 15:42:02,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 15:42:02,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:42:02,316 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 15:42:02,341 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-13 15:42:02,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:42:02,521 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:42:02,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:42:02,521 INFO L85 PathProgramCache]: Analyzing trace with hash -443962942, now seen corresponding path program 1 times [2024-11-13 15:42:02,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:42:02,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174867953] [2024-11-13 15:42:02,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:42:02,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:42:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:02,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:42:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:02,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 15:42:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:02,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:42:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:02,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:42:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:02,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:42:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:02,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:42:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:02,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:42:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:02,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:42:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:02,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:42:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:02,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:42:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:02,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:42:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:02,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 15:42:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:02,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 15:42:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:02,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:42:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:02,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-13 15:42:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:02,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 15:42:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:02,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:42:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:02,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-13 15:42:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:02,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-13 15:42:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:02,827 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2024-11-13 15:42:02,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:42:02,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174867953] [2024-11-13 15:42:02,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174867953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:42:02,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:42:02,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:42:02,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475396275] [2024-11-13 15:42:02,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:42:02,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:42:02,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:42:02,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:42:02,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:42:02,829 INFO L87 Difference]: Start difference. First operand 510 states and 612 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 15:42:02,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:42:02,997 INFO L93 Difference]: Finished difference Result 930 states and 1140 transitions. [2024-11-13 15:42:02,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:42:02,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 157 [2024-11-13 15:42:02,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:42:03,003 INFO L225 Difference]: With dead ends: 930 [2024-11-13 15:42:03,003 INFO L226 Difference]: Without dead ends: 510 [2024-11-13 15:42:03,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:42:03,008 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 1 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:42:03,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 511 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:42:03,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-11-13 15:42:03,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2024-11-13 15:42:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 379 states have (on average 1.1477572559366755) internal successors, (435), 386 states have internal predecessors, (435), 79 states have call successors, (79), 47 states have call predecessors, (79), 51 states have return successors, (93), 76 states have call predecessors, (93), 77 states have call successors, (93) [2024-11-13 15:42:03,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 607 transitions. [2024-11-13 15:42:03,131 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 607 transitions. Word has length 157 [2024-11-13 15:42:03,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:42:03,131 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 607 transitions. [2024-11-13 15:42:03,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 15:42:03,131 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 607 transitions. [2024-11-13 15:42:03,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 15:42:03,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:42:03,133 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2024-11-13 15:42:03,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 15:42:03,133 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:42:03,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:42:03,133 INFO L85 PathProgramCache]: Analyzing trace with hash -578824514, now seen corresponding path program 1 times [2024-11-13 15:42:03,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:42:03,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818621860] [2024-11-13 15:42:03,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:42:03,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:42:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:03,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:42:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:03,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 15:42:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:03,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:42:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:03,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:42:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:03,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:42:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:03,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:42:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:03,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:42:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:03,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:42:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:03,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:42:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:03,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:42:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:03,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:42:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:03,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 15:42:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:03,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 15:42:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:03,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:42:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:03,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-13 15:42:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:03,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 15:42:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:03,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:42:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:03,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-13 15:42:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:03,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-13 15:42:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:03,487 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2024-11-13 15:42:03,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:42:03,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818621860] [2024-11-13 15:42:03,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818621860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:42:03,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:42:03,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:42:03,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51058482] [2024-11-13 15:42:03,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:42:03,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:42:03,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:42:03,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:42:03,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:42:03,488 INFO L87 Difference]: Start difference. First operand 510 states and 607 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-13 15:42:03,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:42:03,686 INFO L93 Difference]: Finished difference Result 775 states and 937 transitions. [2024-11-13 15:42:03,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:42:03,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 157 [2024-11-13 15:42:03,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:42:03,689 INFO L225 Difference]: With dead ends: 775 [2024-11-13 15:42:03,689 INFO L226 Difference]: Without dead ends: 491 [2024-11-13 15:42:03,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:42:03,691 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 34 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:42:03,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 760 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:42:03,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-13 15:42:03,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2024-11-13 15:42:03,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 361 states have (on average 1.1440443213296398) internal successors, (413), 367 states have internal predecessors, (413), 79 states have call successors, (79), 47 states have call predecessors, (79), 50 states have return successors, (92), 76 states have call predecessors, (92), 77 states have call successors, (92) [2024-11-13 15:42:03,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 584 transitions. [2024-11-13 15:42:03,830 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 584 transitions. Word has length 157 [2024-11-13 15:42:03,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:42:03,831 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 584 transitions. [2024-11-13 15:42:03,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-13 15:42:03,831 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 584 transitions. [2024-11-13 15:42:03,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-13 15:42:03,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:42:03,833 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 15:42:03,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 15:42:03,833 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:42:03,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:42:03,833 INFO L85 PathProgramCache]: Analyzing trace with hash -455500128, now seen corresponding path program 1 times [2024-11-13 15:42:03,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:42:03,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725208869] [2024-11-13 15:42:03,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:42:03,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:42:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:05,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:42:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:05,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 15:42:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:05,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 15:42:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:05,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:42:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:05,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:42:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:05,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 15:42:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:05,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:42:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:05,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 15:42:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:05,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 15:42:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:06,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:42:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:06,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:42:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:06,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:42:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:06,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:42:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:06,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:42:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:06,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 15:42:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:06,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-13 15:42:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:06,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:42:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:06,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 15:42:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:06,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-13 15:42:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:06,458 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2024-11-13 15:42:06,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:42:06,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725208869] [2024-11-13 15:42:06,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725208869] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:42:06,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750508353] [2024-11-13 15:42:06,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:42:06,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:42:06,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:42:06,461 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:42:06,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-13 15:42:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:06,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 139 conjuncts are in the unsatisfiable core [2024-11-13 15:42:06,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:42:07,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-13 15:42:07,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-13 15:42:11,517 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|)) (.cse1 (+ 8 (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|)))) (and (= |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9|)))) is different from true [2024-11-13 15:42:13,411 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 146 proven. 15 refuted. 0 times theorem prover too weak. 62 trivial. 13 not checked. [2024-11-13 15:42:13,411 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:42:16,450 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-13 15:42:16,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750508353] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:42:16,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:42:16,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26, 20] total 55 [2024-11-13 15:42:16,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127417804] [2024-11-13 15:42:16,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:42:16,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-13 15:42:16,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:42:16,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-13 15:42:16,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2689, Unknown=1, NotChecked=104, Total=2970 [2024-11-13 15:42:16,453 INFO L87 Difference]: Start difference. First operand 491 states and 584 transitions. Second operand has 55 states, 53 states have (on average 3.660377358490566) internal successors, (194), 48 states have internal predecessors, (194), 19 states have call successors, (47), 4 states have call predecessors, (47), 12 states have return successors, (46), 17 states have call predecessors, (46), 19 states have call successors, (46) [2024-11-13 15:43:48,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 15:44:02,546 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_node_next_is_valid_#in~node.base|) |c_aws_linked_list_node_next_is_valid_#in~node.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_aws_linked_list_node_next_is_valid_#in~node.base|) |c_aws_linked_list_node_next_is_valid_#in~node.offset|) 8))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#1.base| .cse6) .cse7) |c_aws_linked_list_node_next_is_valid_#in~node.base|)) (.cse3 (= |c_aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse6) .cse7)))) (and (< 0 |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_60| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_60|) 0)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_60|) 0) 8))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_60|) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_60|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1) 0)))) (or (and |c_aws_linked_list_node_next_is_valid_#t~short316| .cse2 .cse3) (and (or (not .cse3) (not .cse2)) (not |c_aws_linked_list_node_next_is_valid_#t~short316|))) (or (and (forall ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_13| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_12| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_13|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_12|)) (+ 8 (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_13|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_12|))) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_12|)) (forall ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_13| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_12| Int)) (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_13| (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_13|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_12|)) (+ 8 (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_13|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_12|)))))) (and .cse2 .cse3) (= (mod |c_aws_linked_list_node_next_is_valid_#res| 256) 0)) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|)) (.cse5 (+ 8 (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|)))) (and (= |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5)) (= (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9|))))))) is different from false [2024-11-13 15:44:17,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:44:17,170 INFO L93 Difference]: Finished difference Result 1059 states and 1352 transitions. [2024-11-13 15:44:17,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-11-13 15:44:17,171 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 3.660377358490566) internal successors, (194), 48 states have internal predecessors, (194), 19 states have call successors, (47), 4 states have call predecessors, (47), 12 states have return successors, (46), 17 states have call predecessors, (46), 19 states have call successors, (46) Word has length 158 [2024-11-13 15:44:17,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:44:17,175 INFO L225 Difference]: With dead ends: 1059 [2024-11-13 15:44:17,176 INFO L226 Difference]: Without dead ends: 733 [2024-11-13 15:44:17,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 327 SyntacticMatches, 7 SemanticMatches, 111 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 2748 ImplicationChecksByTransitivity, 116.8s TimeCoverageRelationStatistics Valid=940, Invalid=11251, Unknown=27, NotChecked=438, Total=12656 [2024-11-13 15:44:17,181 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 442 mSDsluCounter, 4026 mSDsCounter, 0 mSdLazyCounter, 5050 mSolverCounterSat, 311 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 4205 SdHoareTripleChecker+Invalid, 5795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 5050 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 433 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:44:17,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 4205 Invalid, 5795 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [311 Valid, 5050 Invalid, 1 Unknown, 433 Unchecked, 11.3s Time] [2024-11-13 15:44:17,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-11-13 15:44:17,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 587. [2024-11-13 15:44:17,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 433 states have (on average 1.1547344110854503) internal successors, (500), 443 states have internal predecessors, (500), 92 states have call successors, (92), 51 states have call predecessors, (92), 61 states have return successors, (109), 92 states have call predecessors, (109), 89 states have call successors, (109) [2024-11-13 15:44:17,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 701 transitions. [2024-11-13 15:44:17,367 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 701 transitions. Word has length 158 [2024-11-13 15:44:17,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:44:17,367 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 701 transitions. [2024-11-13 15:44:17,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 3.660377358490566) internal successors, (194), 48 states have internal predecessors, (194), 19 states have call successors, (47), 4 states have call predecessors, (47), 12 states have return successors, (46), 17 states have call predecessors, (46), 19 states have call successors, (46) [2024-11-13 15:44:17,368 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 701 transitions. [2024-11-13 15:44:17,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 15:44:17,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:44:17,369 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 15:44:17,391 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-13 15:44:17,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:44:17,570 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:44:17,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:44:17,570 INFO L85 PathProgramCache]: Analyzing trace with hash 740305141, now seen corresponding path program 2 times [2024-11-13 15:44:17,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:44:17,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27250921] [2024-11-13 15:44:17,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:44:17,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:44:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:18,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:44:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:18,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 15:44:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:18,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-13 15:44:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:18,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:44:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:18,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:44:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:18,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:44:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:18,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:44:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:18,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 15:44:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:18,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 15:44:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:18,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:44:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:18,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:44:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:18,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 15:44:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:18,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 15:44:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:18,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:44:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:18,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-13 15:44:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:18,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-13 15:44:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:18,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:44:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:18,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 15:44:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:18,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-13 15:44:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 29 proven. 17 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-13 15:44:19,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:44:19,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27250921] [2024-11-13 15:44:19,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27250921] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:44:19,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005426224] [2024-11-13 15:44:19,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 15:44:19,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:44:19,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:44:19,003 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:44:19,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-13 15:44:19,484 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 15:44:19,484 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:44:19,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-13 15:44:19,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:44:19,581 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-13 15:44:19,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2024-11-13 15:44:19,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2024-11-13 15:44:19,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2024-11-13 15:44:19,741 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24))) (let ((.cse1 (select .cse3 .cse2))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_13) .cse1 v_arrayElimArr_17) .cse0) .cse2 .cse1) .cse3) (not (= .cse0 .cse1)) (not (= 0 .cse1))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))))) is different from true [2024-11-13 15:44:20,071 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse1 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_13) .cse1 v_arrayElimArr_17) .cse2) .cse3 .cse1) .cse4) (not (= .cse1 0)))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse7 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24))) (let ((.cse6 (select .cse8 .cse7))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse5 v_DerPreprocessor_13) .cse6 v_arrayElimArr_17) .cse5) .cse7 .cse6) .cse8) (not (= .cse5 .cse6)) (not (= 0 .cse6))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)))))) is different from true [2024-11-13 15:44:20,263 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse1 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_13) .cse1 v_arrayElimArr_17) .cse2) .cse3 .cse1) .cse4) (not (= .cse1 0)))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse7 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24))) (let ((.cse6 (select .cse8 .cse7))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse5 v_DerPreprocessor_13) .cse6 v_arrayElimArr_17) .cse5) .cse7 .cse6) .cse8) (not (= .cse5 .cse6)) (not (= 0 .cse6))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|)) (.cse11 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset| 24))) (let ((.cse10 (select .cse12 .cse11))) (let ((.cse13 (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| .cse10))) (or (and (not (= .cse10 0)) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (and (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| v_DerPreprocessor_13) .cse10 v_arrayElimArr_17) |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|) .cse11 .cse10) .cse12))) (not .cse13)) (and (not (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| (select .cse12 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) .cse13)))))) is different from true [2024-11-13 15:44:20,346 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse1 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_13) .cse1 v_arrayElimArr_17) .cse2) .cse3 .cse1) .cse4) (not (= .cse1 0)))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse7 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24))) (let ((.cse6 (select .cse8 .cse7))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse5 v_DerPreprocessor_13) .cse6 v_arrayElimArr_17) .cse5) .cse7 .cse6) .cse8) (not (= .cse5 .cse6)) (not (= 0 .cse6))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|)) (.cse12 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset| 24))) (let ((.cse11 (select .cse13 .cse12))) (let ((.cse10 (= .cse11 |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|))) (or (and (not .cse10) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| v_DerPreprocessor_13) .cse11 v_arrayElimArr_17) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) .cse12 .cse11) .cse13) (= (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|))) (not (= .cse11 0))) (and .cse10 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse13 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|)) (not (= |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| 0)))))))) is different from true [2024-11-13 15:44:20,421 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse1 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_13) .cse1 v_arrayElimArr_17) .cse2) .cse3 .cse1) .cse4) (not (= .cse1 0)))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse7 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24))) (let ((.cse6 (select .cse8 .cse7))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse5 v_DerPreprocessor_13) .cse6 v_arrayElimArr_17) .cse5) .cse7 .cse6) .cse8) (not (= .cse5 .cse6)) (not (= 0 .cse6))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse10 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse11 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse12 (select .cse14 .cse13))) (and (not (= .cse11 .cse12)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse11 v_DerPreprocessor_13) .cse12 v_arrayElimArr_17) .cse11) .cse13 .cse12) .cse14) (not (= .cse12 0))))))))) is different from true [2024-11-13 15:44:20,989 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse1 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_13) .cse1 v_arrayElimArr_17) .cse2) .cse3 .cse1) .cse4) (not (= .cse1 0)))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse7 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24))) (let ((.cse6 (select .cse8 .cse7))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse5 v_DerPreprocessor_13) .cse6 v_arrayElimArr_17) .cse5) .cse7 .cse6) .cse8) (not (= .cse5 .cse6)) (not (= 0 .cse6))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse10 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse11 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse12 (select .cse14 .cse13))) (and (not (= .cse11 .cse12)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse11 v_DerPreprocessor_13) .cse12 v_arrayElimArr_17) .cse11) .cse13 .cse12) .cse14) (not (= .cse12 0)))))))) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|)) (.cse17 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset| 24))) (let ((.cse16 (select .cse18 .cse17))) (let ((.cse15 (= .cse16 |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|))) (or (and (not .cse15) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| v_DerPreprocessor_13) .cse16 v_arrayElimArr_17) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) .cse17 .cse16) .cse18) (= (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|))) (not (= .cse16 0))) (and .cse15 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse18 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|)) (not (= |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| 0)))))))) is different from true [2024-11-13 15:44:21,086 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse1 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_13) .cse1 v_arrayElimArr_17) .cse2) .cse3 .cse1) .cse4) (not (= .cse1 0)))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse7 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24))) (let ((.cse6 (select .cse8 .cse7))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse5 v_DerPreprocessor_13) .cse6 v_arrayElimArr_17) .cse5) .cse7 .cse6) .cse8) (not (= .cse5 .cse6)) (not (= 0 .cse6))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse10 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_13) .cse11 v_arrayElimArr_17) .cse10) .cse12 .cse11) .cse13) (not (= .cse11 .cse10)) (not (= .cse11 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse16 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| .cse16)) (.cse18 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse17 (select .cse19 .cse18))) (and (not (= .cse16 .cse17)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse16 v_DerPreprocessor_13) .cse17 v_arrayElimArr_17) .cse16) .cse18 .cse17) .cse19) (not (= .cse17 0))))))))) is different from true [2024-11-13 15:44:21,854 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse1 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_13) .cse1 v_arrayElimArr_17) .cse2) .cse3 .cse1) .cse4) (not (= .cse1 0)))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse7 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24))) (let ((.cse6 (select .cse8 .cse7))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse5 v_DerPreprocessor_13) .cse6 v_arrayElimArr_17) .cse5) .cse7 .cse6) .cse8) (not (= .cse5 .cse6)) (not (= 0 .cse6))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse10 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_13) .cse11 v_arrayElimArr_17) .cse10) .cse12 .cse11) .cse13) (not (= .cse11 .cse10)) (not (= .cse11 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse16 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| .cse16)) (.cse18 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse17 (select .cse19 .cse18))) (and (not (= .cse16 .cse17)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse16 v_DerPreprocessor_13) .cse17 v_arrayElimArr_17) .cse16) .cse18 .cse17) .cse19) (not (= .cse17 0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse21 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| .cse21)) (.cse23 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (let ((.cse22 (select .cse24 .cse23))) (and (not (= .cse21 .cse22)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse21 v_DerPreprocessor_13) .cse22 v_arrayElimArr_17) .cse21) .cse23 .cse22) .cse24) (not (= .cse22 0))))))))) is different from true [2024-11-13 15:44:25,034 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse1 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_13) .cse1 v_arrayElimArr_17) .cse2) .cse3 .cse1) .cse4) (not (= .cse1 0)))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse7 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24))) (let ((.cse6 (select .cse8 .cse7))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse5 v_DerPreprocessor_13) .cse6 v_arrayElimArr_17) .cse5) .cse7 .cse6) .cse8) (not (= .cse5 .cse6)) (not (= 0 .cse6))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse10 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_13) .cse11 v_arrayElimArr_17) .cse10) .cse12 .cse11) .cse13) (not (= .cse11 .cse10)) (not (= .cse11 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse16 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| .cse16)) (.cse18 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse17 (select .cse19 .cse18))) (and (not (= .cse16 .cse17)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse16 v_DerPreprocessor_13) .cse17 v_arrayElimArr_17) .cse16) .cse18 .cse17) .cse19) (not (= .cse17 0)))))))) (let ((.cse23 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|)) (.cse22 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset| 24))) (let ((.cse21 (select .cse23 .cse22))) (let ((.cse20 (= .cse21 |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|))) (or (and (not .cse20) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| v_DerPreprocessor_13) .cse21 v_arrayElimArr_17) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) .cse22 .cse21) .cse23) (= (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|))) (not (= .cse21 0))) (and .cse20 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse23 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|)) (not (= |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int)) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse24 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse24 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse25 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse28 (select |c_#memory_$Pointer$#1.base| .cse25)) (.cse27 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (let ((.cse26 (select .cse28 .cse27))) (and (not (= .cse25 .cse26)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse25 v_DerPreprocessor_13) .cse26 v_arrayElimArr_17) .cse25) .cse27 .cse26) .cse28) (not (= .cse26 0))))))))) is different from true [2024-11-13 15:44:25,172 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse1 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_13) .cse1 v_arrayElimArr_17) .cse2) .cse3 .cse1) .cse4) (not (= .cse1 0)))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse7 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24))) (let ((.cse6 (select .cse8 .cse7))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse5 v_DerPreprocessor_13) .cse6 v_arrayElimArr_17) .cse5) .cse7 .cse6) .cse8) (not (= .cse5 .cse6)) (not (= 0 .cse6))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse10 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_13) .cse11 v_arrayElimArr_17) .cse10) .cse12 .cse11) .cse13) (not (= .cse11 .cse10)) (not (= .cse11 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse16 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| .cse16)) (.cse18 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse17 (select .cse19 .cse18))) (and (not (= .cse16 .cse17)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse16 v_DerPreprocessor_13) .cse17 v_arrayElimArr_17) .cse16) .cse18 .cse17) .cse19) (not (= .cse17 0)))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse20 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse23 (select |c_#memory_$Pointer$#1.base| .cse20)) (.cse22 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (let ((.cse21 (select .cse23 .cse22))) (and (not (= .cse20 .cse21)) (not (= .cse21 0)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse20 v_DerPreprocessor_13) .cse21 v_arrayElimArr_17) .cse20) .cse22 .cse21) .cse23)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int)) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse24 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse24 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int)) (let ((.cse25 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse25 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse25 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse26 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse29 (select |c_#memory_$Pointer$#1.base| .cse26)) (.cse28 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (let ((.cse27 (select .cse29 .cse28))) (and (not (= .cse26 .cse27)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse26 v_DerPreprocessor_13) .cse27 v_arrayElimArr_17) .cse26) .cse28 .cse27) .cse29) (not (= .cse27 0))))))))) is different from true [2024-11-13 15:44:25,618 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse1 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_13) .cse1 v_arrayElimArr_17) .cse2) .cse3 .cse1) .cse4) (not (= .cse1 0)))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse7 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24))) (let ((.cse6 (select .cse8 .cse7))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse5 v_DerPreprocessor_13) .cse6 v_arrayElimArr_17) .cse5) .cse7 .cse6) .cse8) (not (= .cse5 .cse6)) (not (= 0 .cse6))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse10 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_13) .cse11 v_arrayElimArr_17) .cse10) .cse12 .cse11) .cse13) (not (= .cse11 .cse10)) (not (= .cse11 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse16 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| .cse16)) (.cse18 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse17 (select .cse19 .cse18))) (and (not (= .cse16 .cse17)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse16 v_DerPreprocessor_13) .cse17 v_arrayElimArr_17) .cse16) .cse18 .cse17) .cse19) (not (= .cse17 0)))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse20 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse23 (select |c_#memory_$Pointer$#1.base| .cse20)) (.cse22 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (let ((.cse21 (select .cse23 .cse22))) (and (not (= .cse20 .cse21)) (not (= .cse21 0)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse20 v_DerPreprocessor_13) .cse21 v_arrayElimArr_17) .cse20) .cse22 .cse21) .cse23)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int)) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse24 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse24 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| 0)))))) (let ((.cse28 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|)) (.cse27 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset| 24))) (let ((.cse26 (select .cse28 .cse27))) (let ((.cse25 (= .cse26 |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|))) (or (and (not .cse25) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| v_DerPreprocessor_13) .cse26 v_arrayElimArr_17) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) .cse27 .cse26) .cse28) (= (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|))) (not (= .cse26 0))) (and .cse25 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse28 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|)) (not (= |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int)) (let ((.cse29 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse29 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse29 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse30 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse33 (select |c_#memory_$Pointer$#1.base| .cse30)) (.cse32 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (let ((.cse31 (select .cse33 .cse32))) (and (not (= .cse30 .cse31)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse30 v_DerPreprocessor_13) .cse31 v_arrayElimArr_17) .cse30) .cse32 .cse31) .cse33) (not (= .cse31 0))))))))) is different from true [2024-11-13 15:44:25,758 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse1 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_13) .cse1 v_arrayElimArr_17) .cse2) .cse3 .cse1) .cse4) (not (= .cse1 0)))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse7 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24))) (let ((.cse6 (select .cse8 .cse7))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse5 v_DerPreprocessor_13) .cse6 v_arrayElimArr_17) .cse5) .cse7 .cse6) .cse8) (not (= .cse5 .cse6)) (not (= 0 .cse6))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse10 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_13) .cse11 v_arrayElimArr_17) .cse10) .cse12 .cse11) .cse13) (not (= .cse11 .cse10)) (not (= .cse11 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse16 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| .cse16)) (.cse18 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse17 (select .cse19 .cse18))) (and (not (= .cse16 .cse17)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse16 v_DerPreprocessor_13) .cse17 v_arrayElimArr_17) .cse16) .cse18 .cse17) .cse19) (not (= .cse17 0)))))))) (let ((.cse21 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_front_~list#1.base|)) (.cse22 (+ |c_ULTIMATE.start_aws_linked_list_front_~list#1.offset| 24))) (let ((.cse20 (select .cse21 .cse22))) (let ((.cse23 (= |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| .cse20))) (or (and (not (= 0 .cse20)) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (and (= |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)) (= .cse21 (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| v_DerPreprocessor_13) .cse20 v_arrayElimArr_17) |c_ULTIMATE.start_aws_linked_list_front_~list#1.base|) .cse22 .cse20)))) (not .cse23)) (and (not (= |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| 0)) .cse23 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| (select .cse21 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse24 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse27 (select |c_#memory_$Pointer$#1.base| .cse24)) (.cse26 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (let ((.cse25 (select .cse27 .cse26))) (and (not (= .cse24 .cse25)) (not (= .cse25 0)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse24 v_DerPreprocessor_13) .cse25 v_arrayElimArr_17) .cse24) .cse26 .cse25) .cse27)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int)) (let ((.cse28 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse28 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse28 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int)) (let ((.cse29 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse29 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse29 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse30 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse33 (select |c_#memory_$Pointer$#1.base| .cse30)) (.cse32 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (let ((.cse31 (select .cse33 .cse32))) (and (not (= .cse30 .cse31)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse30 v_DerPreprocessor_13) .cse31 v_arrayElimArr_17) .cse30) .cse32 .cse31) .cse33) (not (= .cse31 0))))))))) is different from true [2024-11-13 15:44:25,884 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse1 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_13) .cse1 v_arrayElimArr_17) .cse2) .cse3 .cse1) .cse4) (not (= .cse1 0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|)) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| 24))) (let ((.cse6 (select .cse9 .cse8))) (and (not (= .cse6 0)) (not (= .cse7 .cse6)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_13) .cse6 v_arrayElimArr_17) .cse7) .cse8 .cse6) .cse9))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_13) .cse11 v_arrayElimArr_17) .cse10) .cse12 .cse11) .cse13) (not (= .cse10 .cse11)) (not (= 0 .cse11))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse15 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| .cse15)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))) (let ((.cse16 (select .cse18 .cse17))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse15 v_DerPreprocessor_13) .cse16 v_arrayElimArr_17) .cse15) .cse17 .cse16) .cse18) (not (= .cse16 .cse15)) (not (= .cse16 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse21 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| .cse21)) (.cse23 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse22 (select .cse24 .cse23))) (and (not (= .cse21 .cse22)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse21 v_DerPreprocessor_13) .cse22 v_arrayElimArr_17) .cse21) .cse23 .cse22) .cse24) (not (= .cse22 0)))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse25 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse28 (select |c_#memory_$Pointer$#1.base| .cse25)) (.cse27 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (let ((.cse26 (select .cse28 .cse27))) (and (not (= .cse25 .cse26)) (not (= .cse26 0)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse25 v_DerPreprocessor_13) .cse26 v_arrayElimArr_17) .cse25) .cse27 .cse26) .cse28)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int)) (let ((.cse29 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse29 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse29 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int)) (let ((.cse30 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse30 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse30 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse31 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse34 (select |c_#memory_$Pointer$#1.base| .cse31)) (.cse33 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (let ((.cse32 (select .cse34 .cse33))) (and (not (= .cse31 .cse32)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse31 v_DerPreprocessor_13) .cse32 v_arrayElimArr_17) .cse31) .cse33 .cse32) .cse34) (not (= .cse32 0))))))))) is different from true [2024-11-13 15:44:28,890 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse1 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_13) .cse1 v_arrayElimArr_17) .cse2) .cse3 .cse1) .cse4) (not (= .cse1 0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|)) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| 24))) (let ((.cse6 (select .cse9 .cse8))) (and (not (= .cse6 0)) (not (= .cse7 .cse6)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_13) .cse6 v_arrayElimArr_17) .cse7) .cse8 .cse6) .cse9))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_13) .cse11 v_arrayElimArr_17) .cse10) .cse12 .cse11) .cse13) (not (= .cse10 .cse11)) (not (= 0 .cse11))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse15 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| .cse15)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))) (let ((.cse16 (select .cse18 .cse17))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse15 v_DerPreprocessor_13) .cse16 v_arrayElimArr_17) .cse15) .cse17 .cse16) .cse18) (not (= .cse16 .cse15)) (not (= .cse16 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse21 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| .cse21)) (.cse23 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse22 (select .cse24 .cse23))) (and (not (= .cse21 .cse22)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse21 v_DerPreprocessor_13) .cse22 v_arrayElimArr_17) .cse21) .cse23 .cse22) .cse24) (not (= .cse22 0)))))))) (let ((.cse26 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_front_~list#1.base|)) (.cse27 (+ |c_ULTIMATE.start_aws_linked_list_front_~list#1.offset| 24))) (let ((.cse25 (select .cse26 .cse27))) (let ((.cse28 (= |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| .cse25))) (or (and (not (= 0 .cse25)) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (and (= |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)) (= .cse26 (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| v_DerPreprocessor_13) .cse25 v_arrayElimArr_17) |c_ULTIMATE.start_aws_linked_list_front_~list#1.base|) .cse27 .cse25)))) (not .cse28)) (and (not (= |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| 0)) .cse28 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| (select .cse26 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse29 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse32 (select |c_#memory_$Pointer$#1.base| .cse29)) (.cse31 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (let ((.cse30 (select .cse32 .cse31))) (and (not (= .cse29 .cse30)) (not (= .cse30 0)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse29 v_DerPreprocessor_13) .cse30 v_arrayElimArr_17) .cse29) .cse31 .cse30) .cse32)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int)) (let ((.cse33 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse33 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse33 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int)) (let ((.cse34 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse34 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse34 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse35 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse38 (select |c_#memory_$Pointer$#1.base| .cse35)) (.cse37 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (let ((.cse36 (select .cse38 .cse37))) (and (not (= .cse35 .cse36)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse35 v_DerPreprocessor_13) .cse36 v_arrayElimArr_17) .cse35) .cse37 .cse36) .cse38) (not (= .cse36 0))))))))) is different from true [2024-11-13 15:44:29,034 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse1 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_13) .cse1 v_arrayElimArr_17) .cse2) .cse3 .cse1) .cse4) (not (= .cse1 0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|)) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| 24))) (let ((.cse6 (select .cse9 .cse8))) (and (not (= .cse6 0)) (not (= .cse7 .cse6)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_13) .cse6 v_arrayElimArr_17) .cse7) .cse8 .cse6) .cse9))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_13) .cse11 v_arrayElimArr_17) .cse10) .cse12 .cse11) .cse13) (not (= .cse10 .cse11)) (not (= 0 .cse11))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse15 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| .cse15)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))) (let ((.cse16 (select .cse18 .cse17))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse15 v_DerPreprocessor_13) .cse16 v_arrayElimArr_17) .cse15) .cse17 .cse16) .cse18) (not (= .cse16 .cse15)) (not (= .cse16 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse21 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| .cse21)) (.cse23 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse22 (select .cse24 .cse23))) (and (not (= .cse21 .cse22)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse21 v_DerPreprocessor_13) .cse22 v_arrayElimArr_17) .cse21) .cse23 .cse22) .cse24) (not (= .cse22 0)))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse25 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse28 (select |c_#memory_$Pointer$#1.base| .cse25)) (.cse27 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (let ((.cse26 (select .cse28 .cse27))) (and (not (= .cse25 .cse26)) (not (= .cse26 0)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse25 v_DerPreprocessor_13) .cse26 v_arrayElimArr_17) .cse25) .cse27 .cse26) .cse28)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int)) (let ((.cse29 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse29 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse29 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse31 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse30 (select |c_#memory_$Pointer$#1.base| .cse31)) (.cse33 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| 24))) (let ((.cse32 (select .cse30 .cse33))) (and (= .cse30 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse31 v_DerPreprocessor_13) .cse32 v_arrayElimArr_17) .cse31) .cse33 .cse32)) (not (= .cse32 0)) (not (= .cse31 .cse32))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| Int)) (let ((.cse34 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse34 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|)) (= (select .cse34 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int)) (let ((.cse35 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse35 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse35 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse36 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse39 (select |c_#memory_$Pointer$#1.base| .cse36)) (.cse38 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (let ((.cse37 (select .cse39 .cse38))) (and (not (= .cse36 .cse37)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse36 v_DerPreprocessor_13) .cse37 v_arrayElimArr_17) .cse36) .cse38 .cse37) .cse39) (not (= .cse37 0))))))))) is different from true [2024-11-13 15:44:29,655 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse1 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_13) .cse1 v_arrayElimArr_17) .cse2) .cse3 .cse1) .cse4) (not (= .cse1 0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|)) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| 24))) (let ((.cse6 (select .cse9 .cse8))) (and (not (= .cse6 0)) (not (= .cse7 .cse6)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_13) .cse6 v_arrayElimArr_17) .cse7) .cse8 .cse6) .cse9))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_13) .cse11 v_arrayElimArr_17) .cse10) .cse12 .cse11) .cse13) (not (= .cse10 .cse11)) (not (= 0 .cse11))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse15 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| .cse15)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))) (let ((.cse16 (select .cse18 .cse17))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse15 v_DerPreprocessor_13) .cse16 v_arrayElimArr_17) .cse15) .cse17 .cse16) .cse18) (not (= .cse16 .cse15)) (not (= .cse16 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse21 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| .cse21)) (.cse23 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse22 (select .cse24 .cse23))) (and (not (= .cse21 .cse22)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse21 v_DerPreprocessor_13) .cse22 v_arrayElimArr_17) .cse21) .cse23 .cse22) .cse24) (not (= .cse22 0)))))))) (let ((.cse26 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_front_~list#1.base|)) (.cse27 (+ |c_ULTIMATE.start_aws_linked_list_front_~list#1.offset| 24))) (let ((.cse25 (select .cse26 .cse27))) (let ((.cse28 (= |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| .cse25))) (or (and (not (= 0 .cse25)) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (and (= |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)) (= .cse26 (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| v_DerPreprocessor_13) .cse25 v_arrayElimArr_17) |c_ULTIMATE.start_aws_linked_list_front_~list#1.base|) .cse27 .cse25)))) (not .cse28)) (and (not (= |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| 0)) .cse28 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| (select .cse26 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse29 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse32 (select |c_#memory_$Pointer$#1.base| .cse29)) (.cse31 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (let ((.cse30 (select .cse32 .cse31))) (and (not (= .cse29 .cse30)) (not (= .cse30 0)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse29 v_DerPreprocessor_13) .cse30 v_arrayElimArr_17) .cse29) .cse31 .cse30) .cse32)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int)) (let ((.cse33 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse33 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse33 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse35 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse34 (select |c_#memory_$Pointer$#1.base| .cse35)) (.cse37 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| 24))) (let ((.cse36 (select .cse34 .cse37))) (and (= .cse34 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse35 v_DerPreprocessor_13) .cse36 v_arrayElimArr_17) .cse35) .cse37 .cse36)) (not (= .cse36 0)) (not (= .cse35 .cse36))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| Int)) (let ((.cse38 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse38 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|)) (= (select .cse38 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int)) (let ((.cse39 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse39 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse39 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse40 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse43 (select |c_#memory_$Pointer$#1.base| .cse40)) (.cse42 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (let ((.cse41 (select .cse43 .cse42))) (and (not (= .cse40 .cse41)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse40 v_DerPreprocessor_13) .cse41 v_arrayElimArr_17) .cse40) .cse42 .cse41) .cse43) (not (= .cse41 0))))))))) is different from true [2024-11-13 15:44:30,011 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse1 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_13) .cse1 v_arrayElimArr_17) .cse2) .cse3 .cse1) .cse4) (not (= .cse1 0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|)) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| 24))) (let ((.cse6 (select .cse9 .cse8))) (and (not (= .cse6 0)) (not (= .cse7 .cse6)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_13) .cse6 v_arrayElimArr_17) .cse7) .cse8 .cse6) .cse9))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_13) .cse11 v_arrayElimArr_17) .cse10) .cse12 .cse11) .cse13) (not (= .cse10 .cse11)) (not (= 0 .cse11))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse15 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| .cse15)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))) (let ((.cse16 (select .cse18 .cse17))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse15 v_DerPreprocessor_13) .cse16 v_arrayElimArr_17) .cse15) .cse17 .cse16) .cse18) (not (= .cse16 .cse15)) (not (= .cse16 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse21 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| .cse21)) (.cse23 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse22 (select .cse24 .cse23))) (and (not (= .cse21 .cse22)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse21 v_DerPreprocessor_13) .cse22 v_arrayElimArr_17) .cse21) .cse23 .cse22) .cse24) (not (= .cse22 0)))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse25 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse28 (select |c_#memory_$Pointer$#1.base| .cse25)) (.cse27 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (let ((.cse26 (select .cse28 .cse27))) (and (not (= .cse25 .cse26)) (not (= .cse26 0)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse25 v_DerPreprocessor_13) .cse26 v_arrayElimArr_17) .cse25) .cse27 .cse26) .cse28)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int)) (let ((.cse29 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse29 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse29 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse31 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse30 (select |c_#memory_$Pointer$#1.base| .cse31)) (.cse33 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| 24))) (let ((.cse32 (select .cse30 .cse33))) (and (= .cse30 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse31 v_DerPreprocessor_13) .cse32 v_arrayElimArr_17) .cse31) .cse33 .cse32)) (not (= .cse32 0)) (not (= .cse31 .cse32))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| Int)) (let ((.cse34 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse34 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|)) (= (select .cse34 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| Int)) (let ((.cse35 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| 0)) (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| (select .cse35 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| (select .cse35 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse37 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse39 (select |c_#memory_$Pointer$#1.base| .cse37)) (.cse38 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse36 (select .cse39 .cse38))) (and (not (= .cse36 0)) (not (= .cse37 .cse36)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse37 v_DerPreprocessor_13) .cse36 v_arrayElimArr_17) .cse37) .cse38 .cse36) .cse39))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int)) (let ((.cse40 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse40 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse40 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse41 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse44 (select |c_#memory_$Pointer$#1.base| .cse41)) (.cse43 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (let ((.cse42 (select .cse44 .cse43))) (and (not (= .cse41 .cse42)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse41 v_DerPreprocessor_13) .cse42 v_arrayElimArr_17) .cse41) .cse43 .cse42) .cse44) (not (= .cse42 0))))))))) is different from true [2024-11-13 15:44:31,287 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse1 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_13) .cse1 v_arrayElimArr_17) .cse2) .cse3 .cse1) .cse4) (not (= .cse1 0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|)) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| 24))) (let ((.cse6 (select .cse9 .cse8))) (and (not (= .cse6 0)) (not (= .cse7 .cse6)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_13) .cse6 v_arrayElimArr_17) .cse7) .cse8 .cse6) .cse9))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_13) .cse11 v_arrayElimArr_17) .cse10) .cse12 .cse11) .cse13) (not (= .cse10 .cse11)) (not (= 0 .cse11))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse15 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| .cse15)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))) (let ((.cse16 (select .cse18 .cse17))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse15 v_DerPreprocessor_13) .cse16 v_arrayElimArr_17) .cse15) .cse17 .cse16) .cse18) (not (= .cse16 .cse15)) (not (= .cse16 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse21 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| .cse21)) (.cse23 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse22 (select .cse24 .cse23))) (and (not (= .cse21 .cse22)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse21 v_DerPreprocessor_13) .cse22 v_arrayElimArr_17) .cse21) .cse23 .cse22) .cse24) (not (= .cse22 0)))))))) (let ((.cse26 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_front_~list#1.base|)) (.cse27 (+ |c_ULTIMATE.start_aws_linked_list_front_~list#1.offset| 24))) (let ((.cse25 (select .cse26 .cse27))) (let ((.cse28 (= |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| .cse25))) (or (and (not (= 0 .cse25)) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (and (= |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)) (= .cse26 (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| v_DerPreprocessor_13) .cse25 v_arrayElimArr_17) |c_ULTIMATE.start_aws_linked_list_front_~list#1.base|) .cse27 .cse25)))) (not .cse28)) (and (not (= |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| 0)) .cse28 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| (select .cse26 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse29 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse32 (select |c_#memory_$Pointer$#1.base| .cse29)) (.cse31 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (let ((.cse30 (select .cse32 .cse31))) (and (not (= .cse29 .cse30)) (not (= .cse30 0)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse29 v_DerPreprocessor_13) .cse30 v_arrayElimArr_17) .cse29) .cse31 .cse30) .cse32)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int)) (let ((.cse33 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse33 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse33 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse35 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse34 (select |c_#memory_$Pointer$#1.base| .cse35)) (.cse37 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| 24))) (let ((.cse36 (select .cse34 .cse37))) (and (= .cse34 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse35 v_DerPreprocessor_13) .cse36 v_arrayElimArr_17) .cse35) .cse37 .cse36)) (not (= .cse36 0)) (not (= .cse35 .cse36))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| Int)) (let ((.cse38 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse38 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|)) (= (select .cse38 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| Int)) (let ((.cse39 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| 0)) (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| (select .cse39 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| (select .cse39 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse41 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse43 (select |c_#memory_$Pointer$#1.base| .cse41)) (.cse42 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse40 (select .cse43 .cse42))) (and (not (= .cse40 0)) (not (= .cse41 .cse40)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse41 v_DerPreprocessor_13) .cse40 v_arrayElimArr_17) .cse41) .cse42 .cse40) .cse43))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int)) (let ((.cse44 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse44 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse44 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse45 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse48 (select |c_#memory_$Pointer$#1.base| .cse45)) (.cse47 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (let ((.cse46 (select .cse48 .cse47))) (and (not (= .cse45 .cse46)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse45 v_DerPreprocessor_13) .cse46 v_arrayElimArr_17) .cse45) .cse47 .cse46) .cse48) (not (= .cse46 0))))))))) is different from true [2024-11-13 15:44:31,454 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse1 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_13) .cse1 v_arrayElimArr_17) .cse2) .cse3 .cse1) .cse4) (not (= .cse1 0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|)) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| 24))) (let ((.cse6 (select .cse9 .cse8))) (and (not (= .cse6 0)) (not (= .cse7 .cse6)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_13) .cse6 v_arrayElimArr_17) .cse7) .cse8 .cse6) .cse9))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_13) .cse11 v_arrayElimArr_17) .cse10) .cse12 .cse11) .cse13) (not (= .cse10 .cse11)) (not (= 0 .cse11))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse15 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| .cse15)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))) (let ((.cse16 (select .cse18 .cse17))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse15 v_DerPreprocessor_13) .cse16 v_arrayElimArr_17) .cse15) .cse17 .cse16) .cse18) (not (= .cse16 .cse15)) (not (= .cse16 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse21 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| .cse21)) (.cse23 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse22 (select .cse24 .cse23))) (and (not (= .cse21 .cse22)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse21 v_DerPreprocessor_13) .cse22 v_arrayElimArr_17) .cse21) .cse23 .cse22) .cse24) (not (= .cse22 0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_57| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse25 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse28 (select |c_#memory_$Pointer$#1.base| .cse25)) (.cse27 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_57| 24))) (let ((.cse26 (select .cse28 .cse27))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse25 v_DerPreprocessor_13) .cse26 v_arrayElimArr_17) .cse25) .cse27 .cse26) .cse28) (not (= .cse26 0)) (not (= .cse25 .cse26))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse29 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58|))) (and (= (select .cse29 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_57| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58|) (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58| (select .cse29 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse30 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse33 (select |c_#memory_$Pointer$#1.base| .cse30)) (.cse32 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (let ((.cse31 (select .cse33 .cse32))) (and (not (= .cse30 .cse31)) (not (= .cse31 0)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse30 v_DerPreprocessor_13) .cse31 v_arrayElimArr_17) .cse30) .cse32 .cse31) .cse33)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int)) (let ((.cse34 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse34 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse34 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse36 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse35 (select |c_#memory_$Pointer$#1.base| .cse36)) (.cse38 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| 24))) (let ((.cse37 (select .cse35 .cse38))) (and (= .cse35 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse36 v_DerPreprocessor_13) .cse37 v_arrayElimArr_17) .cse36) .cse38 .cse37)) (not (= .cse37 0)) (not (= .cse36 .cse37))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| Int)) (let ((.cse39 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse39 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|)) (= (select .cse39 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| Int)) (let ((.cse40 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| 0)) (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| (select .cse40 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| (select .cse40 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse42 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse44 (select |c_#memory_$Pointer$#1.base| .cse42)) (.cse43 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse41 (select .cse44 .cse43))) (and (not (= .cse41 0)) (not (= .cse42 .cse41)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse42 v_DerPreprocessor_13) .cse41 v_arrayElimArr_17) .cse42) .cse43 .cse41) .cse44))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int)) (let ((.cse45 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse45 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse45 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse46 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse49 (select |c_#memory_$Pointer$#1.base| .cse46)) (.cse48 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (let ((.cse47 (select .cse49 .cse48))) (and (not (= .cse46 .cse47)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse46 v_DerPreprocessor_13) .cse47 v_arrayElimArr_17) .cse46) .cse48 .cse47) .cse49) (not (= .cse47 0))))))))) is different from true [2024-11-13 15:44:32,112 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse1 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_13) .cse1 v_arrayElimArr_17) .cse2) .cse3 .cse1) .cse4) (not (= .cse1 0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|)) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| 24))) (let ((.cse6 (select .cse9 .cse8))) (and (not (= .cse6 0)) (not (= .cse7 .cse6)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_13) .cse6 v_arrayElimArr_17) .cse7) .cse8 .cse6) .cse9))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_13) .cse11 v_arrayElimArr_17) .cse10) .cse12 .cse11) .cse13) (not (= .cse10 .cse11)) (not (= 0 .cse11))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse15 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| .cse15)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))) (let ((.cse16 (select .cse18 .cse17))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse15 v_DerPreprocessor_13) .cse16 v_arrayElimArr_17) .cse15) .cse17 .cse16) .cse18) (not (= .cse16 .cse15)) (not (= .cse16 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse21 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| .cse21)) (.cse23 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse22 (select .cse24 .cse23))) (and (not (= .cse21 .cse22)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse21 v_DerPreprocessor_13) .cse22 v_arrayElimArr_17) .cse21) .cse23 .cse22) .cse24) (not (= .cse22 0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_57| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse25 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse28 (select |c_#memory_$Pointer$#1.base| .cse25)) (.cse27 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_57| 24))) (let ((.cse26 (select .cse28 .cse27))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse25 v_DerPreprocessor_13) .cse26 v_arrayElimArr_17) .cse25) .cse27 .cse26) .cse28) (not (= .cse26 0)) (not (= .cse25 .cse26))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse29 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58|))) (and (= (select .cse29 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_57| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58|) (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58| (select .cse29 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))))))) (let ((.cse31 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_front_~list#1.base|)) (.cse32 (+ |c_ULTIMATE.start_aws_linked_list_front_~list#1.offset| 24))) (let ((.cse30 (select .cse31 .cse32))) (let ((.cse33 (= |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| .cse30))) (or (and (not (= 0 .cse30)) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (and (= |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)) (= .cse31 (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| v_DerPreprocessor_13) .cse30 v_arrayElimArr_17) |c_ULTIMATE.start_aws_linked_list_front_~list#1.base|) .cse32 .cse30)))) (not .cse33)) (and (not (= |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| 0)) .cse33 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| (select .cse31 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse34 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse37 (select |c_#memory_$Pointer$#1.base| .cse34)) (.cse36 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (let ((.cse35 (select .cse37 .cse36))) (and (not (= .cse34 .cse35)) (not (= .cse35 0)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse34 v_DerPreprocessor_13) .cse35 v_arrayElimArr_17) .cse34) .cse36 .cse35) .cse37)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int)) (let ((.cse38 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse38 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse38 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse40 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse39 (select |c_#memory_$Pointer$#1.base| .cse40)) (.cse42 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| 24))) (let ((.cse41 (select .cse39 .cse42))) (and (= .cse39 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse40 v_DerPreprocessor_13) .cse41 v_arrayElimArr_17) .cse40) .cse42 .cse41)) (not (= .cse41 0)) (not (= .cse40 .cse41))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| Int)) (let ((.cse43 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse43 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|)) (= (select .cse43 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| Int)) (let ((.cse44 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| 0)) (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| (select .cse44 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| (select .cse44 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse46 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse48 (select |c_#memory_$Pointer$#1.base| .cse46)) (.cse47 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse45 (select .cse48 .cse47))) (and (not (= .cse45 0)) (not (= .cse46 .cse45)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse46 v_DerPreprocessor_13) .cse45 v_arrayElimArr_17) .cse46) .cse47 .cse45) .cse48))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int)) (let ((.cse49 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse49 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse49 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse50 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse53 (select |c_#memory_$Pointer$#1.base| .cse50)) (.cse52 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (let ((.cse51 (select .cse53 .cse52))) (and (not (= .cse50 .cse51)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse50 v_DerPreprocessor_13) .cse51 v_arrayElimArr_17) .cse50) .cse52 .cse51) .cse53) (not (= .cse51 0))))))))) is different from true [2024-11-13 15:44:32,509 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse1 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_13) .cse1 v_arrayElimArr_17) .cse2) .cse3 .cse1) .cse4) (not (= .cse1 0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|)) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| 24))) (let ((.cse6 (select .cse9 .cse8))) (and (not (= .cse6 0)) (not (= .cse7 .cse6)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_13) .cse6 v_arrayElimArr_17) .cse7) .cse8 .cse6) .cse9))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_13) .cse11 v_arrayElimArr_17) .cse10) .cse12 .cse11) .cse13) (not (= .cse10 .cse11)) (not (= 0 .cse11))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse15 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| .cse15)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))) (let ((.cse16 (select .cse18 .cse17))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse15 v_DerPreprocessor_13) .cse16 v_arrayElimArr_17) .cse15) .cse17 .cse16) .cse18) (not (= .cse16 .cse15)) (not (= .cse16 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse21 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| .cse21)) (.cse23 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse22 (select .cse24 .cse23))) (and (not (= .cse21 .cse22)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse21 v_DerPreprocessor_13) .cse22 v_arrayElimArr_17) .cse21) .cse23 .cse22) .cse24) (not (= .cse22 0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_57| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse25 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse28 (select |c_#memory_$Pointer$#1.base| .cse25)) (.cse27 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_57| 24))) (let ((.cse26 (select .cse28 .cse27))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse25 v_DerPreprocessor_13) .cse26 v_arrayElimArr_17) .cse25) .cse27 .cse26) .cse28) (not (= .cse26 0)) (not (= .cse25 .cse26))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse29 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58|))) (and (= (select .cse29 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_57| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58|) (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58| (select .cse29 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse30 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse33 (select |c_#memory_$Pointer$#1.base| .cse30)) (.cse32 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (let ((.cse31 (select .cse33 .cse32))) (and (not (= .cse30 .cse31)) (not (= .cse31 0)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse30 v_DerPreprocessor_13) .cse31 v_arrayElimArr_17) .cse30) .cse32 .cse31) .cse33)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int)) (let ((.cse34 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse34 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse34 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse36 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse35 (select |c_#memory_$Pointer$#1.base| .cse36)) (.cse38 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| 24))) (let ((.cse37 (select .cse35 .cse38))) (and (= .cse35 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse36 v_DerPreprocessor_13) .cse37 v_arrayElimArr_17) .cse36) .cse38 .cse37)) (not (= .cse37 0)) (not (= .cse36 .cse37))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| Int)) (let ((.cse39 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse39 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|)) (= (select .cse39 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_59| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_58| Int)) (let ((.cse40 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_59|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse40 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_59|)) (= (select .cse40 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_58| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_59|) (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_59| 0))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_58| Int)) (let ((.cse42 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse44 (select |c_#memory_$Pointer$#1.base| .cse42)) (.cse43 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_58| 24))) (let ((.cse41 (select .cse44 .cse43))) (and (not (= .cse41 0)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse42 v_DerPreprocessor_13) .cse41 v_arrayElimArr_17) .cse42) .cse43 .cse41) .cse44) (not (= .cse41 .cse42)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| Int)) (let ((.cse45 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| 0)) (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| (select .cse45 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| (select .cse45 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse47 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse49 (select |c_#memory_$Pointer$#1.base| .cse47)) (.cse48 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse46 (select .cse49 .cse48))) (and (not (= .cse46 0)) (not (= .cse47 .cse46)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse47 v_DerPreprocessor_13) .cse46 v_arrayElimArr_17) .cse47) .cse48 .cse46) .cse49))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int)) (let ((.cse50 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse50 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse50 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse51 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse54 (select |c_#memory_$Pointer$#1.base| .cse51)) (.cse53 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (let ((.cse52 (select .cse54 .cse53))) (and (not (= .cse51 .cse52)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse51 v_DerPreprocessor_13) .cse52 v_arrayElimArr_17) .cse51) .cse53 .cse52) .cse54) (not (= .cse52 0))))))))) is different from true [2024-11-13 15:44:32,744 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse1 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_13) .cse1 v_arrayElimArr_17) .cse2) .cse3 .cse1) .cse4) (not (= .cse1 0)))))))) (= |c_aws_linked_list_is_valid_~list#1.offset| |c_aws_linked_list_is_valid_#in~list#1.offset|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|)) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| 24))) (let ((.cse6 (select .cse9 .cse8))) (and (not (= .cse6 0)) (not (= .cse7 .cse6)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_13) .cse6 v_arrayElimArr_17) .cse7) .cse8 .cse6) .cse9))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_13) .cse11 v_arrayElimArr_17) .cse10) .cse12 .cse11) .cse13) (not (= .cse10 .cse11)) (not (= 0 .cse11))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))))) (= |c_aws_linked_list_is_valid_~list#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse15 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| .cse15)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))) (let ((.cse16 (select .cse18 .cse17))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse15 v_DerPreprocessor_13) .cse16 v_arrayElimArr_17) .cse15) .cse17 .cse16) .cse18) (not (= .cse16 .cse15)) (not (= .cse16 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse21 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| .cse21)) (.cse23 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse22 (select .cse24 .cse23))) (and (not (= .cse21 .cse22)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse21 v_DerPreprocessor_13) .cse22 v_arrayElimArr_17) .cse21) .cse23 .cse22) .cse24) (not (= .cse22 0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_57| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse25 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse28 (select |c_#memory_$Pointer$#1.base| .cse25)) (.cse27 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_57| 24))) (let ((.cse26 (select .cse28 .cse27))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse25 v_DerPreprocessor_13) .cse26 v_arrayElimArr_17) .cse25) .cse27 .cse26) .cse28) (not (= .cse26 0)) (not (= .cse25 .cse26))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse29 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58|))) (and (= (select .cse29 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_57| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58|) (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58| (select .cse29 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse30 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse33 (select |c_#memory_$Pointer$#1.base| .cse30)) (.cse32 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (let ((.cse31 (select .cse33 .cse32))) (and (not (= .cse30 .cse31)) (not (= .cse31 0)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse30 v_DerPreprocessor_13) .cse31 v_arrayElimArr_17) .cse30) .cse32 .cse31) .cse33)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int)) (let ((.cse34 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse34 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse34 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse36 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse35 (select |c_#memory_$Pointer$#1.base| .cse36)) (.cse38 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| 24))) (let ((.cse37 (select .cse35 .cse38))) (and (= .cse35 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse36 v_DerPreprocessor_13) .cse37 v_arrayElimArr_17) .cse36) .cse38 .cse37)) (not (= .cse37 0)) (not (= .cse36 .cse37))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| Int)) (let ((.cse39 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse39 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|)) (= (select .cse39 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_59| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_58| Int)) (let ((.cse40 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_59|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse40 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_59|)) (= (select .cse40 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_58| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_59|) (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_59| 0))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_58| Int)) (let ((.cse42 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse44 (select |c_#memory_$Pointer$#1.base| .cse42)) (.cse43 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_58| 24))) (let ((.cse41 (select .cse44 .cse43))) (and (not (= .cse41 0)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse42 v_DerPreprocessor_13) .cse41 v_arrayElimArr_17) .cse42) .cse43 .cse41) .cse44) (not (= .cse41 .cse42)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| Int)) (let ((.cse45 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| 0)) (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| (select .cse45 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| (select .cse45 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse47 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse49 (select |c_#memory_$Pointer$#1.base| .cse47)) (.cse48 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse46 (select .cse49 .cse48))) (and (not (= .cse46 0)) (not (= .cse47 .cse46)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse47 v_DerPreprocessor_13) .cse46 v_arrayElimArr_17) .cse47) .cse48 .cse46) .cse49))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int)) (let ((.cse50 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse50 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse50 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse51 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse54 (select |c_#memory_$Pointer$#1.base| .cse51)) (.cse53 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (let ((.cse52 (select .cse54 .cse53))) (and (not (= .cse51 .cse52)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse51 v_DerPreprocessor_13) .cse52 v_arrayElimArr_17) .cse51) .cse53 .cse52) .cse54) (not (= .cse52 0))))))))) is different from true [2024-11-13 15:44:33,782 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse1 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_13) .cse1 v_arrayElimArr_17) .cse2) .cse3 .cse1) .cse4) (not (= .cse1 0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|)) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| 24))) (let ((.cse6 (select .cse9 .cse8))) (and (not (= .cse6 0)) (not (= .cse7 .cse6)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_13) .cse6 v_arrayElimArr_17) .cse7) .cse8 .cse6) .cse9))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_13) .cse11 v_arrayElimArr_17) .cse10) .cse12 .cse11) .cse13) (not (= .cse10 .cse11)) (not (= 0 .cse11))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse15 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| .cse15)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))) (let ((.cse16 (select .cse18 .cse17))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse15 v_DerPreprocessor_13) .cse16 v_arrayElimArr_17) .cse15) .cse17 .cse16) .cse18) (not (= .cse16 .cse15)) (not (= .cse16 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse21 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| .cse21)) (.cse23 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse22 (select .cse24 .cse23))) (and (not (= .cse21 .cse22)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse21 v_DerPreprocessor_13) .cse22 v_arrayElimArr_17) .cse21) .cse23 .cse22) .cse24) (not (= .cse22 0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_57| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse25 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse28 (select |c_#memory_$Pointer$#1.base| .cse25)) (.cse27 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_57| 24))) (let ((.cse26 (select .cse28 .cse27))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse25 v_DerPreprocessor_13) .cse26 v_arrayElimArr_17) .cse25) .cse27 .cse26) .cse28) (not (= .cse26 0)) (not (= .cse25 .cse26))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse29 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58|))) (and (= (select .cse29 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_57| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58|) (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58| (select .cse29 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))))))) (or (= (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 0) |c_aws_linked_list_is_valid_#t~short308#1|) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse30 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse33 (select |c_#memory_$Pointer$#1.base| .cse30)) (.cse32 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (let ((.cse31 (select .cse33 .cse32))) (and (not (= .cse30 .cse31)) (not (= .cse31 0)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse30 v_DerPreprocessor_13) .cse31 v_arrayElimArr_17) .cse30) .cse32 .cse31) .cse33)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int)) (let ((.cse34 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse34 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse34 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse36 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse35 (select |c_#memory_$Pointer$#1.base| .cse36)) (.cse38 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| 24))) (let ((.cse37 (select .cse35 .cse38))) (and (= .cse35 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse36 v_DerPreprocessor_13) .cse37 v_arrayElimArr_17) .cse36) .cse38 .cse37)) (not (= .cse37 0)) (not (= .cse36 .cse37))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| Int)) (let ((.cse39 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse39 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|)) (= (select .cse39 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_59| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_58| Int)) (let ((.cse40 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_59|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse40 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_59|)) (= (select .cse40 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_58| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_59|) (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_59| 0))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_58| Int)) (let ((.cse42 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse44 (select |c_#memory_$Pointer$#1.base| .cse42)) (.cse43 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_58| 24))) (let ((.cse41 (select .cse44 .cse43))) (and (not (= .cse41 0)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse42 v_DerPreprocessor_13) .cse41 v_arrayElimArr_17) .cse42) .cse43 .cse41) .cse44) (not (= .cse41 .cse42)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| Int)) (let ((.cse45 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| 0)) (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| (select .cse45 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| (select .cse45 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse47 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse49 (select |c_#memory_$Pointer$#1.base| .cse47)) (.cse48 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse46 (select .cse49 .cse48))) (and (not (= .cse46 0)) (not (= .cse47 .cse46)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse47 v_DerPreprocessor_13) .cse46 v_arrayElimArr_17) .cse47) .cse48 .cse46) .cse49))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int)) (let ((.cse50 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse50 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse50 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse51 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse54 (select |c_#memory_$Pointer$#1.base| .cse51)) (.cse53 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (let ((.cse52 (select .cse54 .cse53))) (and (not (= .cse51 .cse52)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse51 v_DerPreprocessor_13) .cse52 v_arrayElimArr_17) .cse51) .cse53 .cse52) .cse54) (not (= .cse52 0))))))))) is different from true [2024-11-13 15:44:34,012 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_62|))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse1 (select .cse4 .cse3))) (and (not (= .cse1 .cse2)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_13) .cse1 v_arrayElimArr_17) .cse2) .cse3 .cse1) .cse4) (not (= .cse1 0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|)) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_55|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_54| 24))) (let ((.cse6 (select .cse9 .cse8))) (and (not (= .cse6 0)) (not (= .cse7 .cse6)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_13) .cse6 v_arrayElimArr_17) .cse7) .cse8 .cse6) .cse9))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_13) .cse11 v_arrayElimArr_17) .cse10) .cse12 .cse11) .cse13) (not (= .cse10 .cse11)) (not (= 0 .cse11))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_49| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_61|))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse15 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| .cse15)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))) (let ((.cse16 (select .cse18 .cse17))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse15 v_DerPreprocessor_13) .cse16 v_arrayElimArr_17) .cse15) .cse17 .cse16) .cse18) (not (= .cse16 .cse15)) (not (= .cse16 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_57| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| Int)) (let ((.cse21 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| .cse21)) (.cse23 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse22 (select .cse24 .cse23))) (and (not (= .cse21 .cse22)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse21 v_DerPreprocessor_13) .cse22 v_arrayElimArr_17) .cse21) .cse23 .cse22) .cse24) (not (= .cse22 0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_57| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse25 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse28 (select |c_#memory_$Pointer$#1.base| .cse25)) (.cse27 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_57| 24))) (let ((.cse26 (select .cse28 .cse27))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse25 v_DerPreprocessor_13) .cse26 v_arrayElimArr_17) .cse25) .cse27 .cse26) .cse28) (not (= .cse26 0)) (not (= .cse25 .cse26))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_57| Int)) (let ((.cse29 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58|))) (and (= (select .cse29 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_57| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58|) (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58| (select .cse29 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))))))) (or (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse30 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse33 (select |c_#memory_$Pointer$#1.base| .cse30)) (.cse32 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (let ((.cse31 (select .cse33 .cse32))) (and (not (= .cse30 .cse31)) (not (= .cse31 0)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse30 v_DerPreprocessor_13) .cse31 v_arrayElimArr_17) .cse30) .cse32 .cse31) .cse33)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| Int)) (let ((.cse34 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse34 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| (select .cse34 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_59| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_66| 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse36 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse35 (select |c_#memory_$Pointer$#1.base| .cse36)) (.cse38 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| 24))) (let ((.cse37 (select .cse35 .cse38))) (and (= .cse35 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse36 v_DerPreprocessor_13) .cse37 v_arrayElimArr_17) .cse36) .cse38 .cse37)) (not (= .cse37 0)) (not (= .cse36 .cse37))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| Int)) (let ((.cse39 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse39 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|)) (= (select .cse39 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_55| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_56|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_59| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_58| Int)) (let ((.cse40 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_59|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse40 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_59|)) (= (select .cse40 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_58| 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_59|) (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_59| 0))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_58| Int)) (let ((.cse42 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse44 (select |c_#memory_$Pointer$#1.base| .cse42)) (.cse43 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_58| 24))) (let ((.cse41 (select .cse44 .cse43))) (and (not (= .cse41 0)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse42 v_DerPreprocessor_13) .cse41 v_arrayElimArr_17) .cse42) .cse43 .cse41) .cse44) (not (= .cse41 .cse42)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| Int)) (let ((.cse45 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| 0)) (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| (select .cse45 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_57| (select .cse45 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| Int) (v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse47 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse49 (select |c_#memory_$Pointer$#1.base| .cse47)) (.cse48 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_56| 24))) (let ((.cse46 (select .cse49 .cse48))) (and (not (= .cse46 0)) (not (= .cse47 .cse46)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse47 v_DerPreprocessor_13) .cse46 v_arrayElimArr_17) .cse47) .cse48 .cse46) .cse49))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int)) (let ((.cse50 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse50 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| (select .cse50 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)))))) (exists ((v_arrayElimArr_17 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse51 (select v_arrayElimArr_17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse54 (select |c_#memory_$Pointer$#1.base| .cse51)) (.cse53 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_58| 24))) (let ((.cse52 (select .cse54 .cse53))) (and (not (= .cse51 .cse52)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse51 v_DerPreprocessor_13) .cse52 v_arrayElimArr_17) .cse51) .cse53 .cse52) .cse54) (not (= .cse52 0)))))))) (or (= (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 0) |c_aws_linked_list_is_valid_#t~short310#1|)) is different from true [2024-11-13 15:44:35,237 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 193 not checked. [2024-11-13 15:44:35,238 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:44:35,814 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2024-11-13 15:44:35,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 198 treesize of output 185 [2024-11-13 15:44:35,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:44:35,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 119 [2024-11-13 15:44:35,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2024-11-13 15:44:35,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-13 15:44:35,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:44:35,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 52 [2024-11-13 15:44:35,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:44:35,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-13 15:44:35,995 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-11-13 15:44:35,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005426224] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 15:44:35,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:44:35,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14, 32] total 51 [2024-11-13 15:44:35,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322032618] [2024-11-13 15:44:35,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:44:35,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:44:35,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:44:35,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:44:35,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=612, Unknown=71, NotChecked=1752, Total=2550 [2024-11-13 15:44:35,998 INFO L87 Difference]: Start difference. First operand 587 states and 701 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2024-11-13 15:44:36,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:44:36,745 INFO L93 Difference]: Finished difference Result 870 states and 1050 transitions. [2024-11-13 15:44:36,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 15:44:36,746 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 162 [2024-11-13 15:44:36,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:44:36,748 INFO L225 Difference]: With dead ends: 870 [2024-11-13 15:44:36,748 INFO L226 Difference]: Without dead ends: 599 [2024-11-13 15:44:36,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 24 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=137, Invalid=812, Unknown=77, NotChecked=1944, Total=2970 [2024-11-13 15:44:36,750 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 28 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:44:36,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 928 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:44:36,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2024-11-13 15:44:36,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 493. [2024-11-13 15:44:36,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 368 states have (on average 1.1548913043478262) internal successors, (425), 376 states have internal predecessors, (425), 73 states have call successors, (73), 43 states have call predecessors, (73), 51 states have return successors, (84), 73 states have call predecessors, (84), 70 states have call successors, (84) [2024-11-13 15:44:36,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 582 transitions. [2024-11-13 15:44:36,921 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 582 transitions. Word has length 162 [2024-11-13 15:44:36,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:44:36,921 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 582 transitions. [2024-11-13 15:44:36,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2024-11-13 15:44:36,921 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 582 transitions. [2024-11-13 15:44:36,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 15:44:36,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:44:36,922 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-13 15:44:36,940 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-13 15:44:37,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-13 15:44:37,123 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:44:37,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:44:37,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1221993681, now seen corresponding path program 1 times [2024-11-13 15:44:37,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:44:37,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109280130] [2024-11-13 15:44:37,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:44:37,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:44:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:37,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:44:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:37,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 15:44:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:37,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:44:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:37,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:44:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:37,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:44:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:37,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:44:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:37,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:44:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:37,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:44:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:37,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:44:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:37,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:44:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:37,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:44:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:37,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 15:44:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:37,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 15:44:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:37,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:44:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:37,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 15:44:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:37,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 15:44:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:37,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:44:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:37,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 15:44:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:37,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-13 15:44:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:37,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:44:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:37,648 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-13 15:44:37,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:44:37,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109280130] [2024-11-13 15:44:37,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109280130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:44:37,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:44:37,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:44:37,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863418714] [2024-11-13 15:44:37,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:44:37,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:44:37,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:44:37,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:44:37,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:44:37,650 INFO L87 Difference]: Start difference. First operand 493 states and 582 transitions. Second operand has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 15:44:37,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:44:37,828 INFO L93 Difference]: Finished difference Result 517 states and 608 transitions. [2024-11-13 15:44:37,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:44:37,829 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 176 [2024-11-13 15:44:37,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:44:37,833 INFO L225 Difference]: With dead ends: 517 [2024-11-13 15:44:37,833 INFO L226 Difference]: Without dead ends: 515 [2024-11-13 15:44:37,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:44:37,834 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 3 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:44:37,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1179 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:44:37,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-11-13 15:44:37,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 502. [2024-11-13 15:44:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 374 states have (on average 1.1524064171122994) internal successors, (431), 383 states have internal predecessors, (431), 74 states have call successors, (74), 44 states have call predecessors, (74), 53 states have return successors, (87), 74 states have call predecessors, (87), 71 states have call successors, (87) [2024-11-13 15:44:37,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 592 transitions. [2024-11-13 15:44:38,000 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 592 transitions. Word has length 176 [2024-11-13 15:44:38,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:44:38,001 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 592 transitions. [2024-11-13 15:44:38,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 15:44:38,001 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 592 transitions. [2024-11-13 15:44:38,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-13 15:44:38,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:44:38,002 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-13 15:44:38,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-13 15:44:38,003 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:44:38,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:44:38,003 INFO L85 PathProgramCache]: Analyzing trace with hash -599187151, now seen corresponding path program 1 times [2024-11-13 15:44:38,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:44:38,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331944018] [2024-11-13 15:44:38,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:44:38,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:44:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:38,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:44:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:38,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 15:44:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:38,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:44:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:38,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:44:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:38,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:44:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:38,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 15:44:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:38,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:44:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:38,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:44:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:38,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:44:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:39,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:44:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:39,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:44:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:39,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 15:44:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:39,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 15:44:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:39,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:44:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:39,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 15:44:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:39,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 15:44:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:39,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 15:44:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:39,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 15:44:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:39,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-13 15:44:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:39,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 15:44:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:39,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:44:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 48 proven. 64 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 15:44:39,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:44:39,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331944018] [2024-11-13 15:44:39,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331944018] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:44:39,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024117408] [2024-11-13 15:44:39,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:44:39,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:44:39,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:44:39,393 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:44:39,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35be82c3-1d1c-40ee-91d2-81c168cd51f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-13 15:44:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:44:39,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-13 15:44:39,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:44:39,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 15:44:39,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 15:45:05,737 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 209 proven. 15 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-13 15:45:05,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:45:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 63 proven. 28 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-11-13 15:45:06,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024117408] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:45:06,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:45:06,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 13] total 44 [2024-11-13 15:45:06,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172912310] [2024-11-13 15:45:06,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:45:06,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-13 15:45:06,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:45:06,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-13 15:45:06,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1729, Unknown=6, NotChecked=0, Total=1892 [2024-11-13 15:45:06,925 INFO L87 Difference]: Start difference. First operand 502 states and 592 transitions. Second operand has 44 states, 43 states have (on average 4.325581395348837) internal successors, (186), 43 states have internal predecessors, (186), 23 states have call successors, (53), 4 states have call predecessors, (53), 9 states have return successors, (52), 22 states have call predecessors, (52), 22 states have call successors, (52) [2024-11-13 15:45:12,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:45:20,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:45:24,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:45:28,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:45:32,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:45:36,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:45:40,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:45:44,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:45:48,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:45:52,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:45:56,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:46:00,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:46:04,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:46:08,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:46:13,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:46:17,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:46:21,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:46:25,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:46:33,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:46:41,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:46:45,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:46:49,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:46:53,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:46:57,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:47:01,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:47:05,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:47:09,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:47:17,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:47:25,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:47:29,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:47:33,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:47:37,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:47:45,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:47:54,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:48:02,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:48:06,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:48:10,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:48:14,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:48:18,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:48:26,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:48:30,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:48:34,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:48:38,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:48:42,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:48:46,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:48:50,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:48:54,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:48:58,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:49:02,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:49:06,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:49:10,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:49:14,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:49:18,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:49:22,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:49:26,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:49:30,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:49:34,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:49:38,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:49:42,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:49:46,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:49:50,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:49:54,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:49:58,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:50:02,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:50:06,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:50:10,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:50:14,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:50:18,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:50:22,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:50:26,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:50:30,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:50:38,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:50:42,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:50:46,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:50:50,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:50:54,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:50:58,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:51:02,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:51:06,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:51:10,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:51:14,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:51:18,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:51:26,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:51:30,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:51:35,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:51:39,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:51:43,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:51:47,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:51:51,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:51:55,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:51:59,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:52:03,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:52:07,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:52:11,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:52:15,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:52:23,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:52:27,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:52:31,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:52:35,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:52:39,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:52:43,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:52:47,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:52:51,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:52:56,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:53:04,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:53:08,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:53:12,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:53:16,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:53:24,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:53:28,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:53:32,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:53:36,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:53:40,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:53:44,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:53:48,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:53:52,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:53:56,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:54:00,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:54:04,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:54:08,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:54:12,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:54:16,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:54:20,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]