./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/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_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/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 32bit --witnessprinter.graph.data.programhash e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:30:42,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:30:42,248 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 16:30:42,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:30:42,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:30:42,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:30:42,293 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:30:42,293 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:30:42,294 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:30:42,294 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:30:42,295 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:30:42,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:30:42,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:30:42,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:30:42,296 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:30:42,296 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:30:42,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:30:42,297 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:30:42,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:30:42,297 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:30:42,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:30:42,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:30:42,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:30:42,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:30:42,298 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:30:42,298 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:30:42,298 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:30:42,298 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:30:42,298 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:30:42,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:30:42,299 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:30:42,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:30:42,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:30:42,299 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:30:42,300 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:30:42,300 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:30:42,300 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 16:30:42,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 16:30:42,301 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:30:42,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:30:42,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:30:42,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:30:42,301 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_dfb7af1f-6e2b-4022-a22f-14ea10280465/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2024-11-13 16:30:42,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:30:42,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:30:42,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:30:42,626 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:30:42,626 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:30:42,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i Unable to find full path for "g++" [2024-11-13 16:30:44,431 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:30:44,831 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:30:44,832 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2024-11-13 16:30:44,858 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/data/4a1c83a83/4e5007de0b5645c3b70fdd11f66bafe9/FLAGef5022236 [2024-11-13 16:30:44,888 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/data/4a1c83a83/4e5007de0b5645c3b70fdd11f66bafe9 [2024-11-13 16:30:44,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:30:44,892 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:30:44,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:30:44,894 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:30:44,902 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:30:44,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:30:44" (1/1) ... [2024-11-13 16:30:44,906 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4578267c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:30:44, skipping insertion in model container [2024-11-13 16:30:44,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:30:44" (1/1) ... [2024-11-13 16:30:44,954 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:30:45,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_dfb7af1f-6e2b-4022-a22f-14ea10280465/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2024-11-13 16:30:45,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:30:45,346 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:30:45,391 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_dfb7af1f-6e2b-4022-a22f-14ea10280465/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2024-11-13 16:30:45,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:30:45,421 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:30:45,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:30:45 WrapperNode [2024-11-13 16:30:45,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:30:45,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:30:45,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:30:45,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:30:45,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:30:45" (1/1) ... [2024-11-13 16:30:45,448 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:30:45" (1/1) ... [2024-11-13 16:30:45,477 INFO L138 Inliner]: procedures = 127, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 102 [2024-11-13 16:30:45,481 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:30:45,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:30:45,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:30:45,482 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:30:45,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:30:45" (1/1) ... [2024-11-13 16:30:45,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:30:45" (1/1) ... [2024-11-13 16:30:45,497 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:30:45" (1/1) ... [2024-11-13 16:30:45,515 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 1, 4]. [2024-11-13 16:30:45,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:30:45" (1/1) ... [2024-11-13 16:30:45,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:30:45" (1/1) ... [2024-11-13 16:30:45,524 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:30:45" (1/1) ... [2024-11-13 16:30:45,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:30:45" (1/1) ... [2024-11-13 16:30:45,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:30:45" (1/1) ... [2024-11-13 16:30:45,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:30:45" (1/1) ... [2024-11-13 16:30:45,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:30:45,534 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:30:45,534 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:30:45,534 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:30:45,535 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:30:45" (1/1) ... [2024-11-13 16:30:45,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:30:45,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:30:45,570 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:30:45,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:30:45,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 16:30:45,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 16:30:45,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 16:30:45,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 16:30:45,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 16:30:45,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 16:30:45,600 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-13 16:30:45,601 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-13 16:30:45,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 16:30:45,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:30:45,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 16:30:45,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 16:30:45,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 16:30:45,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 16:30:45,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 16:30:45,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 16:30:45,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 16:30:45,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 16:30:45,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 16:30:45,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 16:30:45,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 16:30:45,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 16:30:45,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 16:30:45,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 16:30:45,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:30:45,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:30:45,752 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:30:45,754 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:30:45,999 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-13 16:30:45,999 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:30:46,009 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:30:46,009 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-13 16:30:46,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:30:46 BoogieIcfgContainer [2024-11-13 16:30:46,010 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:30:46,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:30:46,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:30:46,017 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:30:46,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:30:44" (1/3) ... [2024-11-13 16:30:46,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68b598b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:30:46, skipping insertion in model container [2024-11-13 16:30:46,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:30:45" (2/3) ... [2024-11-13 16:30:46,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68b598b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:30:46, skipping insertion in model container [2024-11-13 16:30:46,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:30:46" (3/3) ... [2024-11-13 16:30:46,022 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2024-11-13 16:30:46,041 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:30:46,043 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_prepend_equal.i that has 2 procedures, 26 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2024-11-13 16:30:46,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:30:46,123 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;@7a269186, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:30:46,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 16:30:46,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:30:46,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 16:30:46,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:30:46,133 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:30:46,134 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:30:46,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:30:46,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1194701330, now seen corresponding path program 1 times [2024-11-13 16:30:46,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:30:46,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515349120] [2024-11-13 16:30:46,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:30:46,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:30:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:30:46,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:30:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:30:46,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:30:46,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:30:46,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515349120] [2024-11-13 16:30:46,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515349120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:30:46,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:30:46,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:30:46,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221341152] [2024-11-13 16:30:46,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:30:46,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:30:46,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:30:46,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:30:46,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:30:46,744 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 16:30:46,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:30:46,837 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2024-11-13 16:30:46,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:30:46,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-13 16:30:46,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:30:46,845 INFO L225 Difference]: With dead ends: 50 [2024-11-13 16:30:46,846 INFO L226 Difference]: Without dead ends: 23 [2024-11-13 16:30:46,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 16:30:46,856 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:30:46,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 72 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:30:46,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-13 16:30:46,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-11-13 16:30:46,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:30:46,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-11-13 16:30:46,900 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2024-11-13 16:30:46,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:30:46,901 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-13 16:30:46,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 16:30:46,903 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-11-13 16:30:46,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 16:30:46,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:30:46,905 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:30:46,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 16:30:46,906 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:30:46,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:30:46,908 INFO L85 PathProgramCache]: Analyzing trace with hash 2015825873, now seen corresponding path program 1 times [2024-11-13 16:30:46,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:30:46,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506330189] [2024-11-13 16:30:46,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:30:46,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:30:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:30:47,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 16:30:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:30:47,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 16:30:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:30:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 16:30:47,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:30:47,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506330189] [2024-11-13 16:30:47,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506330189] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:30:47,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256587564] [2024-11-13 16:30:47,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:30:47,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:30:47,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:30:47,296 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:30:47,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 16:30:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:30:47,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 16:30:47,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:30:47,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:30:47,642 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:30:47,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 16:30:47,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256587564] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:30:47,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:30:47,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-11-13 16:30:47,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456464543] [2024-11-13 16:30:47,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:30:47,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:30:47,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:30:47,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:30:47,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:30:47,710 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 16:30:47,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:30:47,785 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2024-11-13 16:30:47,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:30:47,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-11-13 16:30:47,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:30:47,786 INFO L225 Difference]: With dead ends: 39 [2024-11-13 16:30:47,787 INFO L226 Difference]: Without dead ends: 24 [2024-11-13 16:30:47,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:30:47,788 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:30:47,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 49 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:30:47,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-13 16:30:47,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-13 16:30:47,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 16:30:47,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-13 16:30:47,798 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 24 [2024-11-13 16:30:47,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:30:47,798 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-13 16:30:47,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 16:30:47,799 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-11-13 16:30:47,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 16:30:47,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:30:47,799 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:30:47,822 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 16:30:48,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:30:48,000 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:30:48,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:30:48,001 INFO L85 PathProgramCache]: Analyzing trace with hash -544962727, now seen corresponding path program 2 times [2024-11-13 16:30:48,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:30:48,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143329836] [2024-11-13 16:30:48,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:30:48,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:30:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:30:48,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 16:30:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:30:48,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:30:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:30:48,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 16:30:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:30:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 16:30:48,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:30:48,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143329836] [2024-11-13 16:30:48,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143329836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:30:48,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:30:48,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 16:30:48,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715591661] [2024-11-13 16:30:48,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:30:48,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 16:30:48,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:30:48,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 16:30:48,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:30:48,753 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:30:48,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:30:48,871 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-11-13 16:30:48,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 16:30:48,872 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-11-13 16:30:48,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:30:48,873 INFO L225 Difference]: With dead ends: 28 [2024-11-13 16:30:48,873 INFO L226 Difference]: Without dead ends: 25 [2024-11-13 16:30:48,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-13 16:30:48,875 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:30:48,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 113 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:30:48,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-13 16:30:48,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-13 16:30:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 16:30:48,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-11-13 16:30:48,887 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 32 [2024-11-13 16:30:48,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:30:48,889 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-13 16:30:48,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:30:48,889 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-11-13 16:30:48,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 16:30:48,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:30:48,890 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:30:48,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 16:30:48,891 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:30:48,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:30:48,892 INFO L85 PathProgramCache]: Analyzing trace with hash -544961053, now seen corresponding path program 1 times [2024-11-13 16:30:48,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:30:48,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268202590] [2024-11-13 16:30:48,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:30:48,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:30:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:30:49,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 16:30:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:30:49,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:30:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:30:49,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 16:30:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:30:49,905 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 16:30:49,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:30:49,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268202590] [2024-11-13 16:30:49,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268202590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:30:49,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:30:49,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 16:30:49,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322660439] [2024-11-13 16:30:49,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:30:49,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 16:30:49,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:30:49,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 16:30:49,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-13 16:30:49,907 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:30:50,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:30:50,088 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-13 16:30:50,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 16:30:50,090 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-11-13 16:30:50,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:30:50,090 INFO L225 Difference]: With dead ends: 30 [2024-11-13 16:30:50,090 INFO L226 Difference]: Without dead ends: 28 [2024-11-13 16:30:50,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-13 16:30:50,091 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:30:50,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 90 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:30:50,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-13 16:30:50,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-11-13 16:30:50,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 16:30:50,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-11-13 16:30:50,102 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2024-11-13 16:30:50,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:30:50,102 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-13 16:30:50,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:30:50,103 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-11-13 16:30:50,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 16:30:50,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:30:50,104 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:30:50,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 16:30:50,104 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:30:50,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:30:50,105 INFO L85 PathProgramCache]: Analyzing trace with hash 278471220, now seen corresponding path program 1 times [2024-11-13 16:30:50,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:30:50,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316488267] [2024-11-13 16:30:50,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:30:50,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:30:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:30:51,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 16:30:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:30:51,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:30:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:30:51,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 16:30:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:30:51,257 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 16:30:51,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:30:51,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316488267] [2024-11-13 16:30:51,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316488267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:30:51,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338036633] [2024-11-13 16:30:51,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:30:51,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:30:51,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:30:51,261 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:30:51,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 16:30:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:30:51,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-13 16:30:51,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:30:51,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-13 16:30:51,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 16:30:51,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 12 treesize of output 4 [2024-11-13 16:30:51,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 9 treesize of output 3 [2024-11-13 16:30:52,371 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-13 16:30:52,372 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 1 case distinctions, treesize of input 21 treesize of output 24 [2024-11-13 16:30:52,402 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-13 16:30:52,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-13 16:30:52,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2024-11-13 16:30:52,631 INFO L349 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2024-11-13 16:30:52,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 71 treesize of output 82 [2024-11-13 16:30:52,678 INFO L349 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2024-11-13 16:30:52,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2024-11-13 16:30:53,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:30:53,441 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 7 new quantified variables, introduced 21 case distinctions, treesize of input 253 treesize of output 377 [2024-11-13 16:30:53,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:30:53,689 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 7 new quantified variables, introduced 21 case distinctions, treesize of input 169 treesize of output 353 [2024-11-13 16:32:23,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:32:23,529 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2024-11-13 16:32:23,538 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 16:32:23,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:32:28,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:32:28,863 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 44 treesize of output 48 [2024-11-13 16:32:29,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338036633] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:32:29,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:32:29,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 28 [2024-11-13 16:32:29,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583888984] [2024-11-13 16:32:29,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:32:29,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-13 16:32:29,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:32:29,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-13 16:32:29,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=848, Unknown=2, NotChecked=0, Total=930 [2024-11-13 16:32:29,201 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 28 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 22 states have internal predecessors, (44), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-13 16:32:32,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:32:32,871 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-11-13 16:32:32,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 16:32:32,872 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 22 states have internal predecessors, (44), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 34 [2024-11-13 16:32:32,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:32:32,874 INFO L225 Difference]: With dead ends: 36 [2024-11-13 16:32:32,874 INFO L226 Difference]: Without dead ends: 33 [2024-11-13 16:32:32,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=130, Invalid=1350, Unknown=2, NotChecked=0, Total=1482 [2024-11-13 16:32:32,876 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-13 16:32:32,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 326 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-13 16:32:32,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-13 16:32:32,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-11-13 16:32:32,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 16:32:32,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-11-13 16:32:32,885 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 34 [2024-11-13 16:32:32,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:32:32,886 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-11-13 16:32:32,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 22 states have internal predecessors, (44), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-13 16:32:32,886 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-11-13 16:32:32,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 16:32:32,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:32:32,887 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:32:32,908 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 16:32:33,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:32:33,088 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:32:33,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:32:33,088 INFO L85 PathProgramCache]: Analyzing trace with hash 278472894, now seen corresponding path program 1 times [2024-11-13 16:32:33,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:32:33,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551666001] [2024-11-13 16:32:33,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:32:33,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:32:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:32:35,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 16:32:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:32:35,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:32:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:32:36,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 16:32:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:32:36,518 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 16:32:36,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:32:36,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551666001] [2024-11-13 16:32:36,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551666001] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:32:36,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301821668] [2024-11-13 16:32:36,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:32:36,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:32:36,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:32:36,521 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:32:36,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 16:32:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:32:36,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-13 16:32:36,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:32:37,100 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 11 treesize of output 7 [2024-11-13 16:32:37,445 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 23 treesize of output 11 [2024-11-13 16:32:38,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 3 [2024-11-13 16:32:38,792 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-13 16:32:38,792 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-13 16:32:39,122 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 19 treesize of output 11 [2024-11-13 16:32:39,138 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 23 treesize of output 15 [2024-11-13 16:32:39,219 INFO L349 Elim1Store]: treesize reduction 29, result has 42.0 percent of original size [2024-11-13 16:32:39,219 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2024-11-13 16:32:39,229 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 38 [2024-11-13 16:32:39,311 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-13 16:32:39,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 16:32:39,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 50 treesize of output 30 [2024-11-13 16:32:39,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 15 [2024-11-13 16:32:39,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16:32:40,718 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 16:32:40,718 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:32:41,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 208 treesize of output 178 [2024-11-13 16:32:41,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 314 treesize of output 254 [2024-11-13 16:32:43,589 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse14 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse20 |c_ULTIMATE.start_sll_prepend_~head#1.offset| 0)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (= .cse14 0)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse5 (select .cse20 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18|) (forall ((v_arrayElimCell_39 Int) (v_arrayElimCell_38 Int) (v_ArrVal_682 (Array Int Int))) (let ((.cse2 (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18| v_ArrVal_682))) (let ((.cse1 (select .cse2 v_arrayElimCell_38))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 v_arrayElimCell_39)) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse2 .cse3) .cse4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 .cse5)))))))) (or (not .cse6) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18| Int) (v_ArrVal_682 (Array Int Int))) (let ((.cse8 (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18| v_ArrVal_682)) (.cse7 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse7 |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse8 .cse9) .cse5)) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse8 .cse7) 0))))))) (or .cse6 (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18| Int) (v_arrayElimCell_39 Int) (v_arrayElimCell_38 Int) (v_ArrVal_682 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18| v_ArrVal_682))) (let ((.cse10 (select .cse11 v_arrayElimCell_38))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 v_arrayElimCell_39)) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse11 .cse3) .cse4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 .cse5))))))) (or (and (or .cse6 (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18| Int) (v_arrayElimCell_39 Int) (v_arrayElimCell_38 Int) (v_ArrVal_682 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18| v_ArrVal_682))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse12 v_arrayElimCell_38) v_arrayElimCell_39)) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse12 .cse3) .cse4))))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18| Int) (v_arrayElimCell_39 Int) (v_arrayElimCell_38 Int) (v_ArrVal_682 (Array Int Int))) (let ((.cse13 (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18| v_ArrVal_682))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse13 v_arrayElimCell_38) v_arrayElimCell_39)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse13 .cse9) .cse5)) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse13 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse14))))))) (= .cse4 0)) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18| Int) (v_arrayElimCell_39 Int) (v_arrayElimCell_38 Int) (v_ArrVal_682 (Array Int Int))) (let ((.cse16 (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18| v_ArrVal_682))) (let ((.cse15 (select .cse16 v_arrayElimCell_38))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 v_arrayElimCell_39)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 .cse9) .cse5)) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse14))))))) (or (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18| Int) (v_arrayElimCell_39 Int) (v_arrayElimCell_38 Int) (v_ArrVal_682 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18| v_ArrVal_682))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse17 v_arrayElimCell_38) v_arrayElimCell_39)) (= .cse3 |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18|) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse17 .cse3) .cse4)))))) .cse6) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18|) (forall ((v_arrayElimCell_39 Int) (v_arrayElimCell_38 Int) (v_ArrVal_682 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18| v_ArrVal_682))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse18 v_arrayElimCell_38) v_arrayElimCell_39)) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse18 .cse3) .cse4)))))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18| Int)) (or (= .cse3 |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18|) (forall ((v_arrayElimCell_39 Int) (v_arrayElimCell_38 Int) (v_ArrVal_682 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18| v_ArrVal_682))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse19 v_arrayElimCell_38) v_arrayElimCell_39)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse19 .cse9) .cse5)) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse19 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse14)))))))))))) is different from false [2024-11-13 16:32:43,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301821668] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:32:43,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:32:43,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2024-11-13 16:32:43,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203960650] [2024-11-13 16:32:43,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:32:43,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-13 16:32:43,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:32:43,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-13 16:32:43,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1294, Unknown=27, NotChecked=72, Total=1482 [2024-11-13 16:32:43,602 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 34 states, 32 states have (on average 1.53125) internal successors, (49), 28 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-13 16:32:48,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:32:48,738 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2024-11-13 16:32:48,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 16:32:48,739 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.53125) internal successors, (49), 28 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2024-11-13 16:32:48,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:32:48,740 INFO L225 Difference]: With dead ends: 37 [2024-11-13 16:32:48,740 INFO L226 Difference]: Without dead ends: 35 [2024-11-13 16:32:48,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=193, Invalid=2641, Unknown=32, NotChecked=104, Total=2970 [2024-11-13 16:32:48,743 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 24 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:32:48,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 292 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-13 16:32:48,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-13 16:32:48,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-11-13 16:32:48,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 16:32:48,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-13 16:32:48,751 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 34 [2024-11-13 16:32:48,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:32:48,752 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-13 16:32:48,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.53125) internal successors, (49), 28 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-13 16:32:48,752 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-13 16:32:48,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 16:32:48,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:32:48,753 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:32:48,774 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 16:32:48,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:32:48,954 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:32:48,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:32:48,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1324511823, now seen corresponding path program 2 times [2024-11-13 16:32:48,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:32:48,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393291996] [2024-11-13 16:32:48,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:32:48,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:32:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:32:51,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 16:32:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:32:51,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:32:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:32:51,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 16:32:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:32:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 16:32:52,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:32:52,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393291996] [2024-11-13 16:32:52,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393291996] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:32:52,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304359630] [2024-11-13 16:32:52,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 16:32:52,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:32:52,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:32:52,384 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:32:52,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 16:32:52,586 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 16:32:52,586 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:32:52,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-13 16:32:52,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:32:52,686 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 16:32:52,805 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 15 treesize of output 1 [2024-11-13 16:32:52,966 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 9 treesize of output 3 [2024-11-13 16:32:52,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 12 treesize of output 4 [2024-11-13 16:32:53,649 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-13 16:32:53,649 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2024-11-13 16:32:53,720 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-13 16:32:53,720 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 15 treesize of output 15 [2024-11-13 16:32:53,950 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 25 treesize of output 17 [2024-11-13 16:32:54,045 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-13 16:32:54,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 22 [2024-11-13 16:32:54,055 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 42 treesize of output 37 [2024-11-13 16:32:54,063 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 34 [2024-11-13 16:32:54,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 69 treesize of output 49 [2024-11-13 16:32:54,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 53 treesize of output 37 [2024-11-13 16:32:54,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 9 treesize of output 3 [2024-11-13 16:32:55,196 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-13 16:32:55,196 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 15 [2024-11-13 16:32:55,210 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 16:32:55,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:32:56,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 236 treesize of output 206 [2024-11-13 16:32:56,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:32:56,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 262 treesize of output 311 [2024-11-13 16:32:57,224 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-13 16:32:57,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 40 [2024-11-13 16:32:57,514 INFO L349 Elim1Store]: treesize reduction 98, result has 14.8 percent of original size [2024-11-13 16:32:57,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 222 treesize of output 183 [2024-11-13 16:32:57,594 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-13 16:32:57,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 8 [2024-11-13 16:32:58,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304359630] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:32:58,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:32:58,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 30 [2024-11-13 16:32:58,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20624091] [2024-11-13 16:32:58,660 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:32:58,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-13 16:32:58,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:32:58,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-13 16:32:58,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1176, Unknown=0, NotChecked=0, Total=1260 [2024-11-13 16:32:58,662 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 30 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 24 states have internal predecessors, (41), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 16:33:03,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:33:03,168 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-11-13 16:33:03,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 16:33:03,169 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 24 states have internal predecessors, (41), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2024-11-13 16:33:03,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:33:03,172 INFO L225 Difference]: With dead ends: 38 [2024-11-13 16:33:03,173 INFO L226 Difference]: Without dead ends: 35 [2024-11-13 16:33:03,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=167, Invalid=2185, Unknown=0, NotChecked=0, Total=2352 [2024-11-13 16:33:03,174 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:33:03,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 343 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-13 16:33:03,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-13 16:33:03,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-11-13 16:33:03,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 16:33:03,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-13 16:33:03,190 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 36 [2024-11-13 16:33:03,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:33:03,191 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-13 16:33:03,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 24 states have internal predecessors, (41), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 16:33:03,191 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-13 16:33:03,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 16:33:03,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:33:03,192 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:33:03,217 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 16:33:03,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-13 16:33:03,393 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:33:03,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:33:03,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1324513497, now seen corresponding path program 2 times [2024-11-13 16:33:03,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:33:03,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574680564] [2024-11-13 16:33:03,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:33:03,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:33:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:06,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 16:33:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:06,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:33:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:07,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 16:33:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:08,563 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 16:33:08,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:33:08,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574680564] [2024-11-13 16:33:08,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574680564] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:33:08,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766096751] [2024-11-13 16:33:08,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 16:33:08,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:33:08,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:33:08,565 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:33:08,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 16:33:08,759 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 16:33:08,759 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:33:08,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 147 conjuncts are in the unsatisfiable core [2024-11-13 16:33:08,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:33:09,022 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 16:33:09,063 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 11 treesize of output 7 [2024-11-13 16:33:09,382 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 23 treesize of output 11 [2024-11-13 16:33:10,428 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 16:33:10,428 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-13 16:33:10,532 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 16:33:10,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 16:33:10,837 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 20 treesize of output 15 [2024-11-13 16:33:10,854 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 15 treesize of output 1 [2024-11-13 16:33:10,892 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 11 treesize of output 7 [2024-11-13 16:33:11,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 45 treesize of output 21 [2024-11-13 16:33:11,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 treesize of output 3 [2024-11-13 16:33:11,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-13 16:33:11,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-13 16:33:13,128 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-13 16:33:13,128 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-13 16:33:13,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:33:13,238 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 53 treesize of output 36 [2024-11-13 16:33:13,329 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-13 16:33:13,329 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 28 treesize of output 30 [2024-11-13 16:33:13,357 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 24 treesize of output 19 [2024-11-13 16:33:13,744 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-13 16:33:13,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 16:33:13,783 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 71 treesize of output 50 [2024-11-13 16:33:13,795 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 58 [2024-11-13 16:33:13,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2024-11-13 16:33:13,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:33:13,856 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 35 treesize of output 30 [2024-11-13 16:33:14,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 97 treesize of output 65 [2024-11-13 16:33:15,308 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 16:33:15,309 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 33 [2024-11-13 16:33:15,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2024-11-13 16:33:16,078 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:33:16,078 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:33:17,593 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1037 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse8 (+ |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse8 (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse8 (select .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (+ (select (select .cse3 .cse4) .cse5) 4))) (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_1037) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))))) is different from false [2024-11-13 16:33:17,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:17,903 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 202 treesize of output 192 [2024-11-13 16:33:17,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:17,922 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 181 treesize of output 171 [2024-11-13 16:33:18,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766096751] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:33:18,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:33:18,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 45 [2024-11-13 16:33:18,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639852565] [2024-11-13 16:33:18,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:33:18,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-13 16:33:18,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:33:18,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-13 16:33:18,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2519, Unknown=1, NotChecked=100, Total=2756 [2024-11-13 16:33:18,486 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 45 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 36 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 16:33:25,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:33:25,751 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2024-11-13 16:33:25,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 16:33:25,752 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 36 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2024-11-13 16:33:25,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:33:25,753 INFO L225 Difference]: With dead ends: 41 [2024-11-13 16:33:25,753 INFO L226 Difference]: Without dead ends: 39 [2024-11-13 16:33:25,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=278, Invalid=4555, Unknown=1, NotChecked=136, Total=4970 [2024-11-13 16:33:25,756 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 32 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:33:25,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 327 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-13 16:33:25,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-13 16:33:25,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2024-11-13 16:33:25,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 16:33:25,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-13 16:33:25,769 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 36 [2024-11-13 16:33:25,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:33:25,769 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-13 16:33:25,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 36 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 16:33:25,769 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-13 16:33:25,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 16:33:25,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:33:25,770 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:33:25,791 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 16:33:25,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-13 16:33:25,975 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:33:25,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:33:25,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1547184042, now seen corresponding path program 3 times [2024-11-13 16:33:25,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:33:25,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082516942] [2024-11-13 16:33:25,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:33:25,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:33:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:26,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 16:33:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:26,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:33:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:26,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 16:33:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 16:33:26,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:33:26,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082516942] [2024-11-13 16:33:26,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082516942] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:33:26,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458557618] [2024-11-13 16:33:26,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 16:33:26,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:33:26,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:33:26,447 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:33:26,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 16:33:26,936 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-13 16:33:26,936 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:33:26,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 16:33:26,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:33:27,336 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 16:33:27,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:33:27,603 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 16:33:27,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458557618] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:33:27,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:33:27,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2024-11-13 16:33:27,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871317486] [2024-11-13 16:33:27,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:33:27,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 16:33:27,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:33:27,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 16:33:27,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-13 16:33:27,605 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 16:33:28,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:33:28,013 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2024-11-13 16:33:28,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 16:33:28,014 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-11-13 16:33:28,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:33:28,015 INFO L225 Difference]: With dead ends: 44 [2024-11-13 16:33:28,015 INFO L226 Difference]: Without dead ends: 41 [2024-11-13 16:33:28,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-13 16:33:28,016 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 15 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:33:28,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 146 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 16:33:28,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-13 16:33:28,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2024-11-13 16:33:28,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 16:33:28,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-13 16:33:28,035 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 38 [2024-11-13 16:33:28,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:33:28,035 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-13 16:33:28,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 16:33:28,036 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-13 16:33:28,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 16:33:28,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:33:28,038 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:33:28,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 16:33:28,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-13 16:33:28,238 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:33:28,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:33:28,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1547185716, now seen corresponding path program 3 times [2024-11-13 16:33:28,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:33:28,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103458515] [2024-11-13 16:33:28,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:33:28,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:33:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:31,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 16:33:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:32,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:33:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:33,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 16:33:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:33,719 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 16:33:33,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:33:33,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103458515] [2024-11-13 16:33:33,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103458515] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:33:33,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170175569] [2024-11-13 16:33:33,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 16:33:33,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:33:33,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:33:33,721 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:33:33,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 16:33:34,220 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-13 16:33:34,220 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:33:34,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 139 conjuncts are in the unsatisfiable core [2024-11-13 16:33:34,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:33:34,280 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 16:33:34,393 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 11 treesize of output 7 [2024-11-13 16:33:34,411 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 11 treesize of output 7 [2024-11-13 16:33:39,400 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (or (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse1))))) (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#2.offset|))) (and (= 0 (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2))) (= .cse2 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from false [2024-11-13 16:33:39,409 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (or (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse1))))) (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#2.offset|))) (and (= 0 (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2))) (= .cse2 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from true [2024-11-13 16:33:39,525 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-11-13 16:33:39,526 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2024-11-13 16:33:39,613 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-13 16:33:39,613 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2024-11-13 16:33:39,660 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (or (exists ((|v_#memory_$Pointer$#2.offset_68| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$#2.offset_68| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_68| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_68|))) (and (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse0) 4) 0) (= |v_#memory_$Pointer$#2.offset_68| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse1 (select |v_#memory_$Pointer$#2.offset_68| .cse1))) (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1))) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2024-11-13 16:33:39,668 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (or (exists ((|v_#memory_$Pointer$#2.offset_68| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$#2.offset_68| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_68| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_68|))) (and (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse0) 4) 0) (= |v_#memory_$Pointer$#2.offset_68| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse1 (select |v_#memory_$Pointer$#2.offset_68| .cse1))) (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1))) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2024-11-13 16:33:39,764 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (or (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2024-11-13 16:33:39,771 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (or (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2024-11-13 16:33:39,869 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (or (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) is different from false [2024-11-13 16:33:39,878 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (or (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) is different from true [2024-11-13 16:33:40,028 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (or (= .cse1 .cse0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0)) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1))) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2024-11-13 16:33:40,036 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (or (= .cse1 .cse0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0)) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1))) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2024-11-13 16:33:40,070 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-13 16:33:40,070 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2024-11-13 16:33:40,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:33:40,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-13 16:33:40,160 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-13 16:33:40,166 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-13 16:33:40,249 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-13 16:33:40,256 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-13 16:33:40,437 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-13 16:33:40,443 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-13 16:33:40,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:33:40,599 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-13 16:33:40,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 51 [2024-11-13 16:33:40,765 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2024-11-13 16:33:40,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 73 [2024-11-13 16:33:40,998 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (or (= .cse0 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_#valid_BEFORE_CALL_11| .cse2)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1)))) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4)))) (= 0 (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse3) 0))) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= .cse3 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (or (= .cse0 .cse3) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2024-11-13 16:33:41,006 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (or (= .cse0 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_#valid_BEFORE_CALL_11| .cse2)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1)))) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4)))) (= 0 (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse3) 0))) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= .cse3 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (or (= .cse0 .cse3) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2024-11-13 16:33:41,355 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-11-13 16:33:41,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 133 [2024-11-13 16:33:41,431 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-13 16:33:41,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 16:33:42,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:33:42,188 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2024-11-13 16:33:42,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 61 [2024-11-13 16:33:42,380 INFO L349 Elim1Store]: treesize reduction 72, result has 57.9 percent of original size [2024-11-13 16:33:42,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 152 [2024-11-13 16:33:42,950 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (or (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= .cse1 .cse0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_#valid_BEFORE_CALL_11| .cse4)))) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_19| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1)))))))) (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6)))) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= .cse7 .cse1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse7) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse7) 1)))))))) (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (not (= |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select |v_old(#valid)_AFTER_CALL_19| .cse8) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse8) 1)))) (= |v_#valid_BEFORE_CALL_11| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse9 (select |v_#valid_BEFORE_CALL_11| .cse9)))))))) (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse10 (select |v_#valid_BEFORE_CALL_11| .cse10)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-13 16:33:42,960 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (or (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= .cse1 .cse0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_#valid_BEFORE_CALL_11| .cse4)))) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_19| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1)))))))) (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6)))) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= .cse7 .cse1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse7) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse7) 1)))))))) (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (not (= |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select |v_old(#valid)_AFTER_CALL_19| .cse8) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse8) 1)))) (= |v_#valid_BEFORE_CALL_11| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse9 (select |v_#valid_BEFORE_CALL_11| .cse9)))))))) (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse10 (select |v_#valid_BEFORE_CALL_11| .cse10)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-13 16:33:43,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:43,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 345 treesize of output 333 [2024-11-13 16:33:43,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:43,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 165 treesize of output 221 [2024-11-13 16:33:50,801 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= .cse1 .cse0)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse2 (select |v_old(#valid)_AFTER_CALL_20| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0)))) is different from false [2024-11-13 16:33:50,807 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= .cse1 .cse0)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse2 (select |v_old(#valid)_AFTER_CALL_20| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0)))) is different from true [2024-11-13 16:33:50,998 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4) 0) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse0 (select |v_old(#valid)_AFTER_CALL_20| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 1) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2024-11-13 16:33:51,004 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4) 0) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse0 (select |v_old(#valid)_AFTER_CALL_20| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 1) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2024-11-13 16:33:51,109 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4) 0) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse0 (select |v_old(#valid)_AFTER_CALL_20| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)))))) is different from false [2024-11-13 16:33:51,115 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4) 0) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse0 (select |v_old(#valid)_AFTER_CALL_20| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)))))) is different from true [2024-11-13 16:33:51,220 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4) 0) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse0 (select |v_old(#valid)_AFTER_CALL_20| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 1) (= .cse2 |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2024-11-13 16:33:51,226 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4) 0) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse0 (select |v_old(#valid)_AFTER_CALL_20| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 1) (= .cse2 |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2024-11-13 16:33:51,329 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4) 0) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse0 (select |v_old(#valid)_AFTER_CALL_20| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_main_~ptr~0#1.base|)))))) is different from false [2024-11-13 16:33:51,335 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4) 0) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse0 (select |v_old(#valid)_AFTER_CALL_20| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_main_~ptr~0#1.base|)))))) is different from true [2024-11-13 16:33:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2024-11-13 16:33:51,374 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:33:53,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:53,135 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 423 treesize of output 385 [2024-11-13 16:33:53,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:53,154 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 374 treesize of output 336 [2024-11-13 16:33:54,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170175569] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:33:54,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:33:54,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 41 [2024-11-13 16:33:54,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584920329] [2024-11-13 16:33:54,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:33:54,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-13 16:33:54,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:33:54,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-13 16:33:54,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1042, Unknown=30, NotChecked=1170, Total=2352 [2024-11-13 16:33:54,076 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 41 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 33 states have internal predecessors, (49), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-13 16:33:54,738 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse3 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))) (and .cse0 (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or .cse0 (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse2))))) .cse3 (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#2.offset|))) (and (= 0 (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse4 (select |c_#memory_$Pointer$#2.offset| .cse4))) (= .cse4 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))) .cse3) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1))) is different from false [2024-11-13 16:33:54,747 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse3 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))) (and .cse0 (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or .cse0 (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse2))))) .cse3 (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#2.offset|))) (and (= 0 (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse4 (select |c_#memory_$Pointer$#2.offset| .cse4))) (= .cse4 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))) .cse3) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1))) is different from true [2024-11-13 16:33:54,760 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse3 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (.cse5 (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0))) (and (or (exists ((|v_#memory_$Pointer$#2.offset_68| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$#2.offset_68| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_68| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_68|))) (and (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse0) 4) 0) (= |v_#memory_$Pointer$#2.offset_68| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse1 (select |v_#memory_$Pointer$#2.offset_68| .cse1))) (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (and .cse2 .cse3)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1))) .cse5 .cse2 (= (select |c_#valid| .cse0) 1) .cse3 (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse5) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2024-11-13 16:33:54,768 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse3 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (.cse5 (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0))) (and (or (exists ((|v_#memory_$Pointer$#2.offset_68| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$#2.offset_68| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_68| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_68|))) (and (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse0) 4) 0) (= |v_#memory_$Pointer$#2.offset_68| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse1 (select |v_#memory_$Pointer$#2.offset_68| .cse1))) (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (and .cse2 .cse3)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1))) .cse5 .cse2 (= (select |c_#valid| .cse0) 1) .cse3 (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse5) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from true [2024-11-13 16:33:54,777 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1))) .cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (or (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2024-11-13 16:33:54,783 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1))) .cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (or (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from true [2024-11-13 16:33:54,792 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse1 (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) .cse1 (or (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) .cse1) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |c_#valid| .cse2)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)))) is different from false [2024-11-13 16:33:54,798 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse1 (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) .cse1 (or (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) .cse1) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |c_#valid| .cse2)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)))) is different from true [2024-11-13 16:33:54,808 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (or (= .cse2 .cse1) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0)) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1))) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse3) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2024-11-13 16:33:54,815 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (or (= .cse2 .cse1) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0)) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1))) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse3) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2024-11-13 16:33:54,823 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-13 16:33:54,829 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-13 16:33:54,837 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-13 16:33:54,844 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-13 16:33:54,856 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (or (= .cse2 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (or (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= .cse3 |c_node_create_#res#1.base|)) (= |c_#valid| (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse4 (select |c_#valid| .cse4)))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|))) is different from false [2024-11-13 16:33:54,864 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1)))) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (or (= .cse2 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (or (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= .cse3 |c_node_create_#res#1.base|)) (= |c_#valid| (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse4 (select |c_#valid| .cse4)))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|))) is different from true [2024-11-13 16:33:54,883 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (= .cse1 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0)) (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3)))) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1)))) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse4 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse0 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| .cse5) 1) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse6 (select |v_old(#valid)_AFTER_CALL_20| .cse6)))) (= 0 (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse5) 0))) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (= .cse5 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (or (= .cse1 .cse5) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2024-11-13 16:33:54,891 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (= .cse1 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0)) (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3)))) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1)))) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse4 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse0 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| .cse5) 1) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse6 (select |v_old(#valid)_AFTER_CALL_20| .cse6)))) (= 0 (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse5) 0))) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (= .cse5 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (or (= .cse1 .cse5) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2024-11-13 16:33:55,525 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0))) (and (or .cse0 (= .cse1 .cse2)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0))) .cse0 (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (or (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_19| .cse6) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse6) 1)))))))) (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse7 (select |v_#valid_BEFORE_CALL_11| .cse7)))) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= .cse8 .cse1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse8) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse8) 1)))))))) (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (not (= |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select |v_old(#valid)_AFTER_CALL_19| .cse9) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse9) 1)))) (= |v_#valid_BEFORE_CALL_11| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse10 (select |v_#valid_BEFORE_CALL_11| .cse10)))))))) (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse11 (select |v_#valid_BEFORE_CALL_11| .cse11)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2024-11-13 16:33:55,534 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0))) (and (or .cse0 (= .cse1 .cse2)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0))) .cse0 (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (or (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_19| .cse6) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse6) 1)))))))) (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse7 (select |v_#valid_BEFORE_CALL_11| .cse7)))) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= .cse8 .cse1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse8) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse8) 1)))))))) (exists ((v_arrayElimIndex_4 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (not (= |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select |v_old(#valid)_AFTER_CALL_19| .cse9) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse9) 1)))) (= |v_#valid_BEFORE_CALL_11| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse10 (select |v_#valid_BEFORE_CALL_11| .cse10)))))))) (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimIndex_4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_19| .cse11 (select |v_#valid_BEFORE_CALL_11| .cse11)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2024-11-13 16:33:55,543 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0))) (and .cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or .cse0 (= .cse1 .cse2)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0))))) is different from false [2024-11-13 16:33:55,552 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0))) (and .cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or .cse0 (= .cse1 .cse2)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0))))) is different from true [2024-11-13 16:33:55,566 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4))) (and (= 0 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4) 0) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_old(#valid)_AFTER_CALL_20| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse3) 1) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from false [2024-11-13 16:33:55,576 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4))) (and (= 0 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4) 0) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_old(#valid)_AFTER_CALL_20| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse3) 1) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from true [2024-11-13 16:33:55,588 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4) 0) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_old(#valid)_AFTER_CALL_20| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse3) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) is different from false [2024-11-13 16:33:55,598 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4) 0) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_old(#valid)_AFTER_CALL_20| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse3) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) is different from true [2024-11-13 16:33:55,611 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4) 0) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse0 (select |v_old(#valid)_AFTER_CALL_20| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 1) (= .cse2 |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2024-11-13 16:33:55,621 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4) 0) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse0 (select |v_old(#valid)_AFTER_CALL_20| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 1) (= .cse2 |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2024-11-13 16:33:55,633 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4) 0) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse0 (select |v_old(#valid)_AFTER_CALL_20| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_main_~ptr~0#1.base|)))))) is different from false [2024-11-13 16:33:55,642 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4) 0) (= |v_old(#valid)_AFTER_CALL_20| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_21| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_21| .cse0 (select |v_old(#valid)_AFTER_CALL_20| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_main_~ptr~0#1.base|)))))) is different from true [2024-11-13 16:33:56,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:33:56,113 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2024-11-13 16:33:56,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 16:33:56,114 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 33 states have internal predecessors, (49), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 38 [2024-11-13 16:33:56,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:33:56,116 INFO L225 Difference]: With dead ends: 61 [2024-11-13 16:33:56,116 INFO L226 Difference]: Without dead ends: 39 [2024-11-13 16:33:56,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 30 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=140, Invalid=1042, Unknown=60, NotChecked=2790, Total=4032 [2024-11-13 16:33:56,118 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1143 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:33:56,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 287 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 268 Invalid, 0 Unknown, 1143 Unchecked, 1.1s Time] [2024-11-13 16:33:56,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-13 16:33:56,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-13 16:33:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 16:33:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-11-13 16:33:56,134 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 38 [2024-11-13 16:33:56,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:33:56,134 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-11-13 16:33:56,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 33 states have internal predecessors, (49), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-13 16:33:56,135 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-11-13 16:33:56,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-13 16:33:56,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:33:56,137 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:33:56,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 16:33:56,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:33:56,338 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:33:56,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:33:56,338 INFO L85 PathProgramCache]: Analyzing trace with hash -674637892, now seen corresponding path program 4 times [2024-11-13 16:33:56,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:33:56,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541996592] [2024-11-13 16:33:56,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:33:56,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:33:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:56,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 16:33:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:56,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:33:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:56,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-13 16:33:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:56,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:33:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:56,614 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-13 16:33:56,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:33:56,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541996592] [2024-11-13 16:33:56,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541996592] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:33:56,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169135240] [2024-11-13 16:33:56,614 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 16:33:56,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:33:56,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:33:56,617 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:33:56,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 16:33:56,851 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 16:33:56,851 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:33:56,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 16:33:56,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:33:56,943 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 16:33:56,943 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:33:56,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169135240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:33:56,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:33:56,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-11-13 16:33:56,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909476965] [2024-11-13 16:33:56,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:33:56,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:33:56,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:33:56,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:33:56,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:33:56,945 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 16:33:57,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:33:57,001 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2024-11-13 16:33:57,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:33:57,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2024-11-13 16:33:57,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:33:57,002 INFO L225 Difference]: With dead ends: 44 [2024-11-13 16:33:57,002 INFO L226 Difference]: Without dead ends: 0 [2024-11-13 16:33:57,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:33:57,003 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 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.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:33:57,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:33:57,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-13 16:33:57,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-13 16:33:57,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:33:57,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-13 16:33:57,004 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2024-11-13 16:33:57,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:33:57,005 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 16:33:57,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 16:33:57,005 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-13 16:33:57,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 16:33:57,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 16:33:57,027 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 16:33:57,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:33:57,212 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1] [2024-11-13 16:33:57,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-13 16:34:03,147 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 16:34:03,159 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:587) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:280) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:355) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:480) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:402) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:166) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:109) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:91) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionWithContext(BacktranslationService.java:111) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createInvariantResults(FloydHoareUtils.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-13 16:34:03,164 INFO L158 Benchmark]: Toolchain (without parser) took 198271.52ms. Allocated memory was 117.4MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 93.6MB in the beginning and 702.5MB in the end (delta: -608.9MB). Peak memory consumption was 585.5MB. Max. memory is 16.1GB. [2024-11-13 16:34:03,164 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 142.6MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:34:03,164 INFO L158 Benchmark]: CACSL2BoogieTranslator took 528.44ms. Allocated memory is still 117.4MB. Free memory was 93.3MB in the beginning and 75.8MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 16:34:03,165 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.68ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 74.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:34:03,165 INFO L158 Benchmark]: Boogie Preprocessor took 51.07ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 71.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:34:03,165 INFO L158 Benchmark]: RCFGBuilder took 476.01ms. Allocated memory is still 117.4MB. Free memory was 71.7MB in the beginning and 57.2MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:34:03,165 INFO L158 Benchmark]: TraceAbstraction took 197150.39ms. Allocated memory was 117.4MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 56.4MB in the beginning and 702.5MB in the end (delta: -646.2MB). Peak memory consumption was 551.9MB. Max. memory is 16.1GB. [2024-11-13 16:34:03,167 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02ms. Allocated memory is still 142.6MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 528.44ms. Allocated memory is still 117.4MB. Free memory was 93.3MB in the beginning and 75.8MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.68ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 74.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.07ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 71.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 476.01ms. Allocated memory is still 117.4MB. Free memory was 71.7MB in the beginning and 57.2MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 197150.39ms. Allocated memory was 117.4MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 56.4MB in the beginning and 702.5MB in the end (delta: -646.2MB). Peak memory consumption was 551.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 624]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 191.1s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 23.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 11.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 126 mSDsluCounter, 2076 SdHoareTripleChecker+Invalid, 11.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1143 IncrementalHoareTripleChecker+Unchecked, 1882 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3049 IncrementalHoareTripleChecker+Invalid, 4207 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 194 mSDtfsCounter, 3049 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 646 GetRequests, 333 SyntacticMatches, 4 SemanticMatches, 309 ConstructedPredicates, 32 IntricatePredicates, 0 DeprecatedPredicates, 1666 ImplicationChecksByTransitivity, 51.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=10, InterpolantAutomatonStates: 151, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 17 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 162.6s InterpolantComputationTime, 652 NumberOfCodeBlocks, 651 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 693 ConstructedInterpolants, 49 QuantifiedInterpolants, 8893 SizeOfPredicates, 35 NumberOfNonLiveVariables, 2718 ConjunctsInSsa, 561 ConjunctsInUnsatCore, 21 InterpolantComputations, 4 PerfectInterpolantSequences, 306/503 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:587) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-13 16:34:03,377 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-13 16:34:03,417 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/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_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/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 32bit --witnessprinter.graph.data.programhash e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:34:05,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:34:05,942 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 16:34:05,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:34:05,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:34:06,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:34:06,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:34:06,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:34:06,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:34:06,025 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:34:06,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:34:06,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:34:06,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:34:06,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:34:06,025 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:34:06,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:34:06,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:34:06,026 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:34:06,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:34:06,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:34:06,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:34:06,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:34:06,026 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:34:06,026 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 16:34:06,027 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 16:34:06,027 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:34:06,031 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 16:34:06,031 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:34:06,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:34:06,032 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:34:06,032 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:34:06,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:34:06,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:34:06,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:34:06,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:34:06,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:34:06,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:34:06,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:34:06,032 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 16:34:06,032 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 16:34:06,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:34:06,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:34:06,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:34:06,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:34:06,033 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_dfb7af1f-6e2b-4022-a22f-14ea10280465/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2024-11-13 16:34:06,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:34:06,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:34:06,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:34:06,377 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:34:06,378 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:34:06,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i Unable to find full path for "g++" [2024-11-13 16:34:08,214 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:34:08,562 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:34:08,566 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2024-11-13 16:34:08,587 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/data/5c1e6389c/eb807747b4dd44ee9182038c104cad36/FLAG0b0a93e72 [2024-11-13 16:34:08,612 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/data/5c1e6389c/eb807747b4dd44ee9182038c104cad36 [2024-11-13 16:34:08,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:34:08,616 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:34:08,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:34:08,619 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:34:08,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:34:08,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:34:08" (1/1) ... [2024-11-13 16:34:08,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@369b1ea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:34:08, skipping insertion in model container [2024-11-13 16:34:08,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:34:08" (1/1) ... [2024-11-13 16:34:08,673 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:34:09,079 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_dfb7af1f-6e2b-4022-a22f-14ea10280465/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2024-11-13 16:34:09,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:34:09,098 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:34:09,171 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_dfb7af1f-6e2b-4022-a22f-14ea10280465/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2024-11-13 16:34:09,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:34:09,212 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:34:09,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:34:09 WrapperNode [2024-11-13 16:34:09,214 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:34:09,215 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:34:09,215 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:34:09,216 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:34:09,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:34:09" (1/1) ... [2024-11-13 16:34:09,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:34:09" (1/1) ... [2024-11-13 16:34:09,271 INFO L138 Inliner]: procedures = 130, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 103 [2024-11-13 16:34:09,274 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:34:09,275 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:34:09,275 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:34:09,275 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:34:09,285 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:34:09" (1/1) ... [2024-11-13 16:34:09,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:34:09" (1/1) ... [2024-11-13 16:34:09,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:34:09" (1/1) ... [2024-11-13 16:34:09,321 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 7, 5]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2024-11-13 16:34:09,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:34:09" (1/1) ... [2024-11-13 16:34:09,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:34:09" (1/1) ... [2024-11-13 16:34:09,340 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:34:09" (1/1) ... [2024-11-13 16:34:09,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:34:09" (1/1) ... [2024-11-13 16:34:09,352 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:34:09" (1/1) ... [2024-11-13 16:34:09,353 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:34:09" (1/1) ... [2024-11-13 16:34:09,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:34:09,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:34:09,362 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:34:09,362 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:34:09,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:34:09" (1/1) ... [2024-11-13 16:34:09,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:34:09,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:34:09,398 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:34:09,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:34:09,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 16:34:09,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 16:34:09,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-13 16:34:09,428 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-13 16:34:09,429 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-13 16:34:09,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 16:34:09,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:34:09,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 16:34:09,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 16:34:09,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 16:34:09,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 16:34:09,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 16:34:09,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 16:34:09,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 16:34:09,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 16:34:09,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 16:34:09,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 16:34:09,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-13 16:34:09,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 16:34:09,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 16:34:09,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 16:34:09,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 16:34:09,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 16:34:09,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-13 16:34:09,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:34:09,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:34:09,606 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:34:09,608 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:34:09,852 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-13 16:34:09,852 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:34:09,861 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:34:09,862 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-13 16:34:09,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:34:09 BoogieIcfgContainer [2024-11-13 16:34:09,862 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:34:09,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:34:09,865 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:34:09,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:34:09,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:34:08" (1/3) ... [2024-11-13 16:34:09,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e344c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:34:09, skipping insertion in model container [2024-11-13 16:34:09,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:34:09" (2/3) ... [2024-11-13 16:34:09,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e344c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:34:09, skipping insertion in model container [2024-11-13 16:34:09,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:34:09" (3/3) ... [2024-11-13 16:34:09,874 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2024-11-13 16:34:09,890 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:34:09,892 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_prepend_equal.i that has 2 procedures, 26 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2024-11-13 16:34:09,945 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:34:09,959 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;@5fd1e7ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:34:09,960 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 16:34:09,964 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:34:09,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 16:34:09,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:34:09,973 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:34:09,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:34:09,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:34:09,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1194701330, now seen corresponding path program 1 times [2024-11-13 16:34:10,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:34:10,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1795703966] [2024-11-13 16:34:10,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:34:10,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:34:10,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:34:10,008 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:34:10,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 16:34:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:34:10,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 16:34:10,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:34:10,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:34:10,267 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:34:10,268 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:34:10,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795703966] [2024-11-13 16:34:10,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795703966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:34:10,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:34:10,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:34:10,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830653935] [2024-11-13 16:34:10,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:34:10,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 16:34:10,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:34:10,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 16:34:10,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 16:34:10,306 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 16:34:10,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:34:10,324 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2024-11-13 16:34:10,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 16:34:10,326 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-13 16:34:10,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:34:10,333 INFO L225 Difference]: With dead ends: 47 [2024-11-13 16:34:10,333 INFO L226 Difference]: Without dead ends: 20 [2024-11-13 16:34:10,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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 16:34:10,341 INFO L432 NwaCegarLoop]: 31 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, 31 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 16:34:10,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:34:10,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-13 16:34:10,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-13 16:34:10,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:34:10,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-11-13 16:34:10,385 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 16 [2024-11-13 16:34:10,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:34:10,387 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-13 16:34:10,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 16:34:10,388 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-11-13 16:34:10,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 16:34:10,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:34:10,390 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:34:10,412 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 16:34:10,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:34:10,595 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:34:10,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:34:10,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1194692681, now seen corresponding path program 1 times [2024-11-13 16:34:10,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:34:10,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1796098849] [2024-11-13 16:34:10,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:34:10,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:34:10,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:34:10,598 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:34:10,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 16:34:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:34:10,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 16:34:10,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:34:10,970 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 15 treesize of output 1 [2024-11-13 16:34:11,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 8 [2024-11-13 16:34:11,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:34:11,030 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:34:11,030 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:34:11,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796098849] [2024-11-13 16:34:11,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796098849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:34:11,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:34:11,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 16:34:11,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528635516] [2024-11-13 16:34:11,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:34:11,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 16:34:11,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:34:11,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 16:34:11,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:34:11,033 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 16:34:11,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:34:11,398 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2024-11-13 16:34:11,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 16:34:11,399 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-13 16:34:11,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:34:11,399 INFO L225 Difference]: With dead ends: 24 [2024-11-13 16:34:11,399 INFO L226 Difference]: Without dead ends: 21 [2024-11-13 16:34:11,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:34:11,401 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:34:11,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 107 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 16:34:11,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-13 16:34:11,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-13 16:34:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:34:11,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-11-13 16:34:11,406 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2024-11-13 16:34:11,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:34:11,407 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-13 16:34:11,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 16:34:11,407 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-11-13 16:34:11,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 16:34:11,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:34:11,408 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:34:11,428 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 16:34:11,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:34:11,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:34:11,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:34:11,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1194694355, now seen corresponding path program 1 times [2024-11-13 16:34:11,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:34:11,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [670590524] [2024-11-13 16:34:11,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:34:11,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:34:11,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:34:11,616 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:34:11,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 16:34:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:34:11,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 16:34:11,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:34:11,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:34:11,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:34:11,752 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:34:11,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670590524] [2024-11-13 16:34:11,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670590524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:34:11,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:34:11,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:34:11,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043344256] [2024-11-13 16:34:11,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:34:11,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:34:11,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:34:11,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:34:11,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:34:11,754 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 16:34:11,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:34:11,790 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-11-13 16:34:11,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:34:11,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-13 16:34:11,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:34:11,793 INFO L225 Difference]: With dead ends: 40 [2024-11-13 16:34:11,794 INFO L226 Difference]: Without dead ends: 24 [2024-11-13 16:34:11,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:34:11,795 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:34:11,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 39 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:34:11,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-13 16:34:11,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-11-13 16:34:11,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:34:11,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-13 16:34:11,806 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 16 [2024-11-13 16:34:11,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:34:11,806 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-13 16:34:11,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 16:34:11,807 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-11-13 16:34:11,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 16:34:11,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:34:11,808 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:34:11,829 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 16:34:12,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:34:12,010 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:34:12,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:34:12,010 INFO L85 PathProgramCache]: Analyzing trace with hash 2015827547, now seen corresponding path program 1 times [2024-11-13 16:34:12,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:34:12,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [849078973] [2024-11-13 16:34:12,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:34:12,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:34:12,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:34:12,014 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:34:12,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 16:34:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:34:12,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 16:34:12,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:34:12,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:34:12,220 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:34:12,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 16:34:12,300 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:34:12,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849078973] [2024-11-13 16:34:12,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849078973] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:34:12,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:34:12,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2024-11-13 16:34:12,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297695970] [2024-11-13 16:34:12,300 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:34:12,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 16:34:12,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:34:12,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 16:34:12,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:34:12,302 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 16:34:12,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:34:12,451 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2024-11-13 16:34:12,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:34:12,451 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-11-13 16:34:12,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:34:12,454 INFO L225 Difference]: With dead ends: 47 [2024-11-13 16:34:12,454 INFO L226 Difference]: Without dead ends: 31 [2024-11-13 16:34:12,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:34:12,457 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:34:12,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 112 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:34:12,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-13 16:34:12,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-13 16:34:12,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 16:34:12,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-11-13 16:34:12,464 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 24 [2024-11-13 16:34:12,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:34:12,465 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-11-13 16:34:12,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 16:34:12,465 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-11-13 16:34:12,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 16:34:12,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:34:12,466 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:34:12,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 16:34:12,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:34:12,667 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:34:12,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:34:12,667 INFO L85 PathProgramCache]: Analyzing trace with hash -544961053, now seen corresponding path program 2 times [2024-11-13 16:34:12,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:34:12,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [921965241] [2024-11-13 16:34:12,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 16:34:12,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:34:12,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:34:12,670 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:34:12,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 16:34:12,807 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 16:34:12,807 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:34:12,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 16:34:12,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:34:12,869 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 11 treesize of output 7 [2024-11-13 16:34:12,983 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2024-11-13 16:34:12,996 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 15 treesize of output 1 [2024-11-13 16:34:13,005 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 15 treesize of output 1 [2024-11-13 16:34:13,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 15 [2024-11-13 16:34:13,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 11 [2024-11-13 16:34:13,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 [2024-11-13 16:34:13,120 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 16:34:13,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:34:13,121 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:34:13,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921965241] [2024-11-13 16:34:13,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921965241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:34:13,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:34:13,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 16:34:13,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597667543] [2024-11-13 16:34:13,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:34:13,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 16:34:13,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:34:13,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 16:34:13,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:34:13,126 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:34:13,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:34:13,748 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-11-13 16:34:13,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 16:34:13,749 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-11-13 16:34:13,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:34:13,750 INFO L225 Difference]: With dead ends: 36 [2024-11-13 16:34:13,750 INFO L226 Difference]: Without dead ends: 34 [2024-11-13 16:34:13,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-13 16:34:13,751 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:34:13,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 95 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 16:34:13,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-13 16:34:13,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-13 16:34:13,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 16:34:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-11-13 16:34:13,761 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 32 [2024-11-13 16:34:13,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:34:13,762 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-11-13 16:34:13,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:34:13,762 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-11-13 16:34:13,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 16:34:13,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:34:13,763 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:34:13,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 16:34:13,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:34:13,968 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:34:13,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:34:13,968 INFO L85 PathProgramCache]: Analyzing trace with hash 278471220, now seen corresponding path program 1 times [2024-11-13 16:34:13,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:34:13,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [543586879] [2024-11-13 16:34:13,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:34:13,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:34:13,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:34:13,971 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:34:13,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 16:34:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:34:14,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 16:34:14,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:34:14,575 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 23 treesize of output 15 [2024-11-13 16:34:14,664 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-11-13 16:34:14,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 47 [2024-11-13 16:34:14,774 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 11 treesize of output 7 [2024-11-13 16:34:14,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 12 [2024-11-13 16:34:14,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 8 [2024-11-13 16:34:14,957 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 16:34:14,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:34:15,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 108 treesize of output 78 [2024-11-13 16:34:15,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 21 [2024-11-13 16:34:15,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:34:15,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:34:15,246 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 16:34:15,246 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:34:15,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543586879] [2024-11-13 16:34:15,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543586879] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:34:15,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:34:15,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 18 [2024-11-13 16:34:15,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054962093] [2024-11-13 16:34:15,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:34:15,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 16:34:15,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:34:15,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 16:34:15,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2024-11-13 16:34:15,249 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 15 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 16:34:19,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:34:20,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:34:20,651 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-11-13 16:34:20,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 16:34:20,653 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 15 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2024-11-13 16:34:20,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:34:20,654 INFO L225 Difference]: With dead ends: 41 [2024-11-13 16:34:20,654 INFO L226 Difference]: Without dead ends: 38 [2024-11-13 16:34:20,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2024-11-13 16:34:20,655 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:34:20,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 221 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2024-11-13 16:34:20,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-13 16:34:20,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-13 16:34:20,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 16:34:20,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-11-13 16:34:20,676 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 34 [2024-11-13 16:34:20,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:34:20,676 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-11-13 16:34:20,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 15 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 16:34:20,677 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-11-13 16:34:20,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 16:34:20,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:34:20,677 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:34:20,699 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 16:34:20,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:34:20,878 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:34:20,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:34:20,879 INFO L85 PathProgramCache]: Analyzing trace with hash 278472894, now seen corresponding path program 1 times [2024-11-13 16:34:20,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:34:20,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1407071457] [2024-11-13 16:34:20,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:34:20,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:34:20,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:34:20,882 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:34:20,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 16:34:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:34:21,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-13 16:34:21,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:34:21,110 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 7 [2024-11-13 16:34:21,166 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 11 treesize of output 7 [2024-11-13 16:34:21,277 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 23 treesize of output 11 [2024-11-13 16:34:21,472 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 11 treesize of output 5 [2024-11-13 16:34:21,735 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-13 16:34:21,735 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 17 treesize of output 17 [2024-11-13 16:34:21,767 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 20 treesize of output 15 [2024-11-13 16:34:21,905 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-13 16:34:21,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 16:34:21,925 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 23 treesize of output 15 [2024-11-13 16:34:21,932 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 27 [2024-11-13 16:34:21,940 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 32 treesize of output 19 [2024-11-13 16:34:21,956 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 19 treesize of output 11 [2024-11-13 16:34:22,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 50 treesize of output 30 [2024-11-13 16:34:22,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 15 [2024-11-13 16:34:22,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-13 16:34:22,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 [2024-11-13 16:34:22,398 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 16:34:22,398 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:34:22,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 208 treesize of output 178 [2024-11-13 16:34:22,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 314 treesize of output 254 [2024-11-13 16:34:23,109 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse1 (select .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse4 (forall ((v_arrayElimCell_25 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32)) (v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_330))) (or (= (select (select .cse11 v_arrayElimCell_25) v_arrayElimCell_26) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse11 .cse3) .cse1)))))) (.cse6 (and (forall ((v_arrayElimCell_25 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32)) (v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_330) v_arrayElimCell_25) v_arrayElimCell_26) |c_ULTIMATE.start_main_~data~0#1|)) (forall ((v_arrayElimCell_25 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32)) (v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_330) v_arrayElimCell_25))) (or (= (select .cse10 v_arrayElimCell_26) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 .cse1))))))) (.cse7 (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) (.cse5 (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (forall ((v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_330))) (or (forall ((v_arrayElimCell_25 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32))) (let ((.cse0 (select .cse2 v_arrayElimCell_25))) (or (= (select .cse0 v_arrayElimCell_26) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse2 .cse3) .cse1))))) (or .cse4 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (or .cse4 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) (or .cse5 .cse6) (or .cse6 .cse7) (or (not .cse7) (forall ((v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_330) .cse3) .cse1))) (not .cse5)))))) is different from false [2024-11-13 16:34:24,176 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse4 (select .cse2 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse1 (select .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse5 (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|))) (forall ((v_arrayElimCell_25 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32)) (v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| v_ArrVal_330) v_arrayElimCell_25))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 v_arrayElimCell_26))))) (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|))) (forall ((v_arrayElimCell_25 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32)) (v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| v_ArrVal_330))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse3 v_arrayElimCell_25) v_arrayElimCell_26)) (= (select (select .cse3 .cse4) .cse1) |c_ULTIMATE.start_main_~data~0#1|)))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|))) (forall ((v_arrayElimCell_25 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32)) (v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| v_ArrVal_330) v_arrayElimCell_25) v_arrayElimCell_26))) (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or .cse5 (and (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|))) (forall ((v_arrayElimCell_25 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32)) (v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| v_ArrVal_330) v_arrayElimCell_25) v_arrayElimCell_26))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|))) (forall ((v_arrayElimCell_25 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32)) (v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| v_ArrVal_330) v_arrayElimCell_25))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 v_arrayElimCell_26))))))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|))) (forall ((v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| v_ArrVal_330))) (or (forall ((v_arrayElimCell_25 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32))) (let ((.cse7 (select .cse8 v_arrayElimCell_25))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 v_arrayElimCell_26))))) (= (select (select .cse8 .cse4) .cse1) |c_ULTIMATE.start_main_~data~0#1|)))))) (or (= (_ bv0 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_arrayElimCell_25 (_ BitVec 32)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32)) (v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| v_ArrVal_330))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse9 v_arrayElimCell_25) v_arrayElimCell_26)) (= (select (select .cse9 .cse4) .cse1) |c_ULTIMATE.start_main_~data~0#1|))))) (or (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| (_ BitVec 32)) (v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|))) (not (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| v_ArrVal_330) .cse4) .cse1) |c_ULTIMATE.start_main_~data~0#1|))) (not .cse5))))) is different from false [2024-11-13 16:34:24,226 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:34:24,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407071457] [2024-11-13 16:34:24,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407071457] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:34:24,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2103058928] [2024-11-13 16:34:24,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:34:24,226 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 16:34:24,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/cvc4 [2024-11-13 16:34:24,230 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 16:34:24,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-13 16:34:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:34:24,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-13 16:34:24,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:34:24,750 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 7 [2024-11-13 16:34:24,792 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 11 treesize of output 7 [2024-11-13 16:34:25,007 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 23 treesize of output 11 [2024-11-13 16:34:25,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 3 [2024-11-13 16:34:25,534 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 11 treesize of output 5 [2024-11-13 16:34:30,034 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-13 16:34:30,034 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 17 treesize of output 17 [2024-11-13 16:34:30,049 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 20 treesize of output 15 [2024-11-13 16:34:30,280 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 19 treesize of output 11 [2024-11-13 16:34:30,316 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-13 16:34:30,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 16:34:30,338 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 23 treesize of output 15 [2024-11-13 16:34:30,346 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 28 treesize of output 15 [2024-11-13 16:34:30,353 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 27 [2024-11-13 16:34:30,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 50 treesize of output 30 [2024-11-13 16:34:30,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 15 [2024-11-13 16:34:30,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-13 16:34:31,028 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 16:34:31,028 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:34:31,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 208 treesize of output 178 [2024-11-13 16:34:31,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 314 treesize of output 254 [2024-11-13 16:34:32,652 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse10 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse4 (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse3 (select .cse2 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse1 (select .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_41 (_ BitVec 32)) (v_arrayElimCell_40 (_ BitVec 32))) (let ((.cse0 (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24| v_ArrVal_410) v_arrayElimCell_40))) (or (= (select .cse0 .cse1) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 v_arrayElimCell_41))))) (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24|))))) (or (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24| (_ BitVec 32))) (or (not (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24| v_ArrVal_410) .cse3) .cse1) |c_ULTIMATE.start_main_~data~0#1|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24|))))) (not .cse4)) (or .cse4 (and (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_41 (_ BitVec 32)) (v_arrayElimCell_40 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24| v_ArrVal_410) v_arrayElimCell_40) v_arrayElimCell_41))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24|))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_41 (_ BitVec 32)) (v_arrayElimCell_40 (_ BitVec 32))) (let ((.cse5 (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24| v_ArrVal_410) v_arrayElimCell_40))) (or (= (select .cse5 .cse1) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse5 v_arrayElimCell_41))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24|))))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24| v_ArrVal_410))) (or (forall ((v_arrayElimCell_41 (_ BitVec 32)) (v_arrayElimCell_40 (_ BitVec 32))) (let ((.cse6 (select .cse7 v_arrayElimCell_40))) (or (= (select .cse6 .cse1) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 v_arrayElimCell_41))))) (= (select (select .cse7 .cse3) .cse1) |c_ULTIMATE.start_main_~data~0#1|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24|))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_41 (_ BitVec 32)) (v_arrayElimCell_40 (_ BitVec 32))) (let ((.cse8 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24| v_ArrVal_410))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse8 v_arrayElimCell_40) v_arrayElimCell_41)) (= (select (select .cse8 .cse3) .cse1) |c_ULTIMATE.start_main_~data~0#1|)))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24|))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24| (_ BitVec 32))) (or (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_41 (_ BitVec 32)) (v_arrayElimCell_40 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24| v_ArrVal_410) v_arrayElimCell_40) v_arrayElimCell_41))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24|))))) (or (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32)) (v_arrayElimCell_40 (_ BitVec 32))) (let ((.cse9 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24| v_ArrVal_410))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse9 v_arrayElimCell_40) v_arrayElimCell_41)) (= (select (select .cse9 .cse3) .cse1) |c_ULTIMATE.start_main_~data~0#1|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_24|)))))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2024-11-13 16:34:32,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2103058928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:34:32,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:34:32,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2024-11-13 16:34:32,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482241809] [2024-11-13 16:34:32,665 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:34:32,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-13 16:34:32,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:34:32,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-13 16:34:32,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1212, Unknown=31, NotChecked=216, Total=1560 [2024-11-13 16:34:32,667 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 32 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 26 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-13 16:34:35,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:34:35,931 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2024-11-13 16:34:35,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 16:34:35,934 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 26 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2024-11-13 16:34:35,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:34:35,935 INFO L225 Difference]: With dead ends: 43 [2024-11-13 16:34:35,935 INFO L226 Difference]: Without dead ends: 41 [2024-11-13 16:34:35,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=160, Invalid=1888, Unknown=34, NotChecked=270, Total=2352 [2024-11-13 16:34:35,937 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:34:35,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 243 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-13 16:34:35,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-13 16:34:35,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-11-13 16:34:35,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 16:34:35,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-11-13 16:34:35,956 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 34 [2024-11-13 16:34:35,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:34:35,957 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-11-13 16:34:35,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 26 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-13 16:34:35,957 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-11-13 16:34:35,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 16:34:35,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:34:35,958 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:34:35,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2024-11-13 16:34:36,171 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 16:34:36,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:34:36,359 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:34:36,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:34:36,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1324511823, now seen corresponding path program 2 times [2024-11-13 16:34:36,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:34:36,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [328077381] [2024-11-13 16:34:36,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 16:34:36,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:34:36,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:34:36,361 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:34:36,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 16:34:36,565 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 16:34:36,565 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:34:36,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-13 16:34:36,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:34:36,641 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 7 [2024-11-13 16:34:36,758 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 15 treesize of output 1 [2024-11-13 16:34:36,947 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 11 treesize of output 5 [2024-11-13 16:34:36,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 12 treesize of output 4 [2024-11-13 16:34:37,268 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-13 16:34:37,269 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 17 treesize of output 17 [2024-11-13 16:34:37,283 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 21 treesize of output 16 [2024-11-13 16:34:37,476 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-13 16:34:37,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 16:34:37,495 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 36 treesize of output 31 [2024-11-13 16:34:37,502 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 28 [2024-11-13 16:34:37,520 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 19 treesize of output 11 [2024-11-13 16:34:37,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 51 treesize of output 31 [2024-11-13 16:34:37,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16:34:37,991 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 16:34:37,992 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2024-11-13 16:34:38,124 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 16:34:38,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:34:38,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 236 treesize of output 206 [2024-11-13 16:34:41,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:34:41,352 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 176 treesize of output 159 [2024-11-13 16:34:41,818 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse4 (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse0 (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (or .cse0 (forall ((v_arrayElimCell_55 (_ BitVec 32)) (v_arrayElimArr_1 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_28| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_28| v_arrayElimArr_1))) (select .cse1 (select (select .cse1 .cse2) .cse3))) (bvadd (_ bv4 32) v_arrayElimCell_55)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_28|))) (not (= (select v_arrayElimArr_1 (_ bv4 32)) .cse4))))) (forall ((v_arrayElimArr_1 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_55 (_ BitVec 32)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_28| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_28| v_arrayElimArr_1))) (select .cse5 (select (select .cse5 .cse2) .cse3))) (bvadd (_ bv4 32) v_arrayElimCell_55)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_28|))) (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_28| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_28|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= (select v_arrayElimArr_1 (_ bv4 32)) .cse4)))) (or (forall ((v_arrayElimArr_1 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_28| (_ BitVec 32))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_28|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_28| .cse7)) (not (= (_ bv0 32) (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_28| v_arrayElimArr_1))) (select .cse8 (select (select .cse8 .cse7) (_ bv4 32)))) (bvadd (_ bv4 32) (select .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_28|))) (not (= (select v_arrayElimArr_1 (_ bv4 32)) .cse4))))) (not .cse0))))) is different from false [2024-11-13 16:34:41,862 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:34:41,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328077381] [2024-11-13 16:34:41,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328077381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:34:41,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [626863737] [2024-11-13 16:34:41,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 16:34:41,863 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 16:34:41,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/cvc4 [2024-11-13 16:34:41,870 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 16:34:41,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-13 16:34:42,200 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 16:34:42,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161127139] [2024-11-13 16:34:42,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 16:34:42,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 16:34:42,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:34:42,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 1 [2024-11-13 16:34:42,209 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 16:34:42,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-13 16:34:42,460 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 16:34:42,460 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:34:42,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-13 16:34:42,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:34:42,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 16:34:43,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 12 treesize of output 4 [2024-11-13 16:34:43,786 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-13 16:34:43,786 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 1 case distinctions, treesize of input 21 treesize of output 24 [2024-11-13 16:34:44,123 INFO L349 Elim1Store]: treesize reduction 29, result has 44.2 percent of original size [2024-11-13 16:34:44,124 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 1 case distinctions, treesize of input 48 treesize of output 55 [2024-11-13 16:34:44,240 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-11-13 16:34:44,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 74 [2024-11-13 16:34:44,309 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-13 16:34:44,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 16:34:44,351 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 19 treesize of output 11 [2024-11-13 16:34:44,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 47 treesize of output 31 [2024-11-13 16:34:44,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16:34:45,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:34:45,059 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2024-11-13 16:34:45,068 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 16:34:45,068 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:34:45,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 236 treesize of output 206 [2024-11-13 16:34:45,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:34:45,779 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 50 treesize of output 47 [2024-11-13 16:34:45,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:34:45,840 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 60 treesize of output 57 [2024-11-13 16:34:45,972 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse4 (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse0 (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (or .cse0 (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_32| (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32)) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_32| v_arrayElimArr_3))) (select .cse1 (select (select .cse1 .cse2) .cse3))) (bvadd (_ bv4 32) v_arrayElimCell_55)))) (not (= .cse4 (select v_arrayElimArr_3 (_ bv4 32))))))) (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_32| (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (or (not (= (_ bv0 32) (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_32| v_arrayElimArr_3))) (select .cse5 (select (select .cse5 .cse2) .cse3))) (bvadd (_ bv4 32) v_arrayElimCell_55)))) (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_32| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_32|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= .cse4 (select v_arrayElimArr_3 (_ bv4 32)))))) (or (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_32| (_ BitVec 32)) (v_arrayElimArr_2 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_32|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (_ bv0 32) (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_32| v_arrayElimArr_2))) (select .cse7 (select (select .cse7 .cse8) (_ bv4 32)))) (bvadd (_ bv4 32) (select .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (not (= (select v_arrayElimArr_2 (_ bv4 32)) .cse4)) (not (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_32| .cse8))))) (not .cse0))))) is different from false [2024-11-13 16:34:46,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161127139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:34:46,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:34:46,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 36 [2024-11-13 16:34:46,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028912524] [2024-11-13 16:34:46,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:34:46,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-13 16:34:46,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:34:46,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-13 16:34:46,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1542, Unknown=2, NotChecked=158, Total=1806 [2024-11-13 16:34:46,006 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 36 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 29 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-13 16:34:50,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:34:50,871 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-11-13 16:34:50,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 16:34:50,872 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 29 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 36 [2024-11-13 16:34:50,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:34:50,873 INFO L225 Difference]: With dead ends: 43 [2024-11-13 16:34:50,873 INFO L226 Difference]: Without dead ends: 40 [2024-11-13 16:34:50,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=212, Invalid=2986, Unknown=2, NotChecked=222, Total=3422 [2024-11-13 16:34:50,875 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:34:50,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 518 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-13 16:34:50,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-13 16:34:50,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-13 16:34:50,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 16:34:50,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-11-13 16:34:50,888 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 36 [2024-11-13 16:34:50,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:34:50,889 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-11-13 16:34:50,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 29 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-13 16:34:50,889 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-11-13 16:34:50,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 16:34:50,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:34:50,890 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:34:50,896 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-13 16:34:51,104 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 16:34:51,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:34:51,291 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:34:51,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:34:51,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1324513497, now seen corresponding path program 2 times [2024-11-13 16:34:51,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:34:51,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1639801510] [2024-11-13 16:34:51,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 16:34:51,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:34:51,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:34:51,294 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:34:51,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 16:34:51,533 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 16:34:51,533 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:34:51,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-11-13 16:34:51,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:34:51,561 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 7 [2024-11-13 16:34:51,605 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 11 treesize of output 7 [2024-11-13 16:34:51,703 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 23 treesize of output 11 [2024-11-13 16:34:51,935 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-13 16:34:51,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-13 16:34:51,960 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 16:34:52,074 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 11 treesize of output 7 [2024-11-13 16:34:52,091 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 20 treesize of output 15 [2024-11-13 16:34:52,109 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 15 treesize of output 1 [2024-11-13 16:34:52,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 32 treesize of output 16 [2024-11-13 16:34:52,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 treesize of output 3 [2024-11-13 16:34:52,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 16:34:52,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:34:52,876 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 55 treesize of output 38 [2024-11-13 16:34:52,921 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-13 16:34:52,921 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 32 treesize of output 34 [2024-11-13 16:34:52,943 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 24 treesize of output 19 [2024-11-13 16:34:52,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-13 16:34:53,200 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-13 16:34:53,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 16:34:53,220 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 66 [2024-11-13 16:34:53,234 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 91 treesize of output 43 [2024-11-13 16:34:53,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2024-11-13 16:34:53,265 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 35 treesize of output 30 [2024-11-13 16:34:53,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 97 treesize of output 65 [2024-11-13 16:34:53,993 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 16:34:53,994 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 33 [2024-11-13 16:34:54,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2024-11-13 16:34:54,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 [2024-11-13 16:34:54,276 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:34:54,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:34:56,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:34:56,626 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 202 treesize of output 192 [2024-11-13 16:34:56,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:34:56,659 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 181 treesize of output 171 [2024-11-13 16:34:56,809 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_36| (_ BitVec 32)) (v_ArrVal_707 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (or (not (= (select v_arrayElimArr_5 (_ bv4 32)) (select .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (not (= (select .cse1 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (select v_arrayElimArr_4 (_ bv4 32)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_36|))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_36| v_arrayElimArr_5)) (.cse2 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_36| v_arrayElimArr_4)) (.cse6 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_36|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (bvadd (select (select .cse5 .cse6) .cse7) (_ bv4 32)))) (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_36| v_ArrVal_707) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2024-11-13 16:34:56,822 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:34:56,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639801510] [2024-11-13 16:34:56,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639801510] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:34:56,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1407239522] [2024-11-13 16:34:56,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 16:34:56,822 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 16:34:56,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/cvc4 [2024-11-13 16:34:56,824 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 16:34:56,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-13 16:34:57,192 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 16:34:57,192 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:34:57,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-11-13 16:34:57,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:34:57,373 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 7 [2024-11-13 16:34:57,402 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 11 treesize of output 7 [2024-11-13 16:34:57,616 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 23 treesize of output 11 [2024-11-13 16:34:57,890 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 16:34:57,890 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-13 16:34:57,944 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-13 16:34:57,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-13 16:34:58,173 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 15 treesize of output 1 [2024-11-13 16:34:58,179 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 11 treesize of output 7 [2024-11-13 16:34:58,197 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 20 treesize of output 15 [2024-11-13 16:34:58,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 47 treesize of output 23 [2024-11-13 16:34:58,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 treesize of output 3 [2024-11-13 16:34:58,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-13 16:34:58,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 16:34:59,447 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 9 treesize of output 12 [2024-11-13 16:34:59,924 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-13 16:34:59,924 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-13 16:34:59,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:34:59,952 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 55 treesize of output 38 [2024-11-13 16:34:59,996 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-13 16:34:59,996 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 1 case distinctions, treesize of input 24 treesize of output 31 [2024-11-13 16:35:00,054 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-13 16:35:00,054 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 32 treesize of output 34 [2024-11-13 16:35:00,412 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-13 16:35:00,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 16:35:00,436 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 71 treesize of output 50 [2024-11-13 16:35:00,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2024-11-13 16:35:00,463 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 54 treesize of output 33 [2024-11-13 16:35:00,473 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 58 [2024-11-13 16:35:00,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 108 treesize of output 72 [2024-11-13 16:35:01,725 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 16:35:01,725 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 33 [2024-11-13 16:35:01,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2024-11-13 16:35:02,382 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:35:02,382 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:35:06,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:35:06,222 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 202 treesize of output 192 [2024-11-13 16:35:06,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:35:06,294 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 181 treesize of output 171 [2024-11-13 16:35:06,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:35:06,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 6 [2024-11-13 16:35:06,747 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_40| (_ BitVec 32)) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_40| v_arrayElimArr_8)) (.cse0 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_40| v_arrayElimArr_7)) (.cse4 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_40|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 .cse4) .cse5)))) (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_40| v_ArrVal_804) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))) (not (= (select v_arrayElimArr_8 (_ bv4 32)) (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_40|))) (not (= (select v_ArrVal_804 (_ bv0 32)) |c_ULTIMATE.start_sll_prepend_~data#1|)) (not (= (select .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (select v_arrayElimArr_7 (_ bv4 32))))))) is different from false [2024-11-13 16:35:06,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1407239522] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:35:06,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:35:06,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 43 [2024-11-13 16:35:06,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560724863] [2024-11-13 16:35:06,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:35:06,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-13 16:35:06,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:35:06,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-13 16:35:06,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2373, Unknown=39, NotChecked=198, Total=2756 [2024-11-13 16:35:06,763 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 43 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 34 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 16:35:14,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:35:14,291 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2024-11-13 16:35:14,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 16:35:14,292 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 34 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2024-11-13 16:35:14,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:35:14,292 INFO L225 Difference]: With dead ends: 45 [2024-11-13 16:35:14,292 INFO L226 Difference]: Without dead ends: 43 [2024-11-13 16:35:14,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=269, Invalid=4121, Unknown=40, NotChecked=262, Total=4692 [2024-11-13 16:35:14,294 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 33 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-13 16:35:14,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 296 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-13 16:35:14,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-13 16:35:14,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-11-13 16:35:14,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 16:35:14,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-13 16:35:14,309 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 36 [2024-11-13 16:35:14,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:35:14,309 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-13 16:35:14,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 34 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 16:35:14,310 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-13 16:35:14,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 16:35:14,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:35:14,310 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:35:14,314 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-11-13 16:35:14,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-13 16:35:14,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:35:14,711 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:35:14,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:35:14,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1547184042, now seen corresponding path program 3 times [2024-11-13 16:35:14,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:35:14,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [437560784] [2024-11-13 16:35:14,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 16:35:14,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:35:14,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:35:14,714 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:35:14,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 16:35:16,395 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-13 16:35:16,395 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:35:16,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 16:35:16,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:35:16,551 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 16:35:16,551 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:35:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 16:35:16,736 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:35:16,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437560784] [2024-11-13 16:35:16,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437560784] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:35:16,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:35:16,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-11-13 16:35:16,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236138856] [2024-11-13 16:35:16,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:35:16,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 16:35:16,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:35:16,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 16:35:16,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:35:16,738 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 16:35:16,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:35:16,852 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2024-11-13 16:35:16,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:35:16,853 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2024-11-13 16:35:16,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:35:16,854 INFO L225 Difference]: With dead ends: 50 [2024-11-13 16:35:16,854 INFO L226 Difference]: Without dead ends: 47 [2024-11-13 16:35:16,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:35:16,855 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:35:16,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 128 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:35:16,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-13 16:35:16,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2024-11-13 16:35:16,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 16:35:16,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-11-13 16:35:16,876 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 38 [2024-11-13 16:35:16,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:35:16,877 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-11-13 16:35:16,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 16:35:16,877 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-11-13 16:35:16,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 16:35:16,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:35:16,878 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:35:16,901 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 16:35:17,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:35:17,079 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:35:17,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:35:17,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1547185716, now seen corresponding path program 3 times [2024-11-13 16:35:17,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:35:17,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1078611857] [2024-11-13 16:35:17,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 16:35:17,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:35:17,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:35:17,081 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:35:17,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 16:35:18,983 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-13 16:35:18,983 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:35:18,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-13 16:35:18,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:35:19,029 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 7 [2024-11-13 16:35:19,160 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 11 treesize of output 7 [2024-11-13 16:35:19,175 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 11 treesize of output 7 [2024-11-13 16:35:19,487 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 16:35:19,487 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-13 16:35:19,551 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 16:35:19,551 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-13 16:35:19,626 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-13 16:35:19,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-13 16:35:19,728 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 23 treesize of output 22 [2024-11-13 16:35:19,759 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 15 [2024-11-13 16:35:20,204 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-13 16:35:20,205 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 29 [2024-11-13 16:35:20,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-13 16:35:20,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 16:35:28,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:35:28,585 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-13 16:35:28,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 53 [2024-11-13 16:35:28,657 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-11-13 16:35:28,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 53 [2024-11-13 16:35:28,746 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-13 16:35:28,746 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 32 treesize of output 34 [2024-11-13 16:35:28,986 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-13 16:35:28,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 16:35:29,042 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-13 16:35:29,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 63 [2024-11-13 16:35:29,050 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 69 [2024-11-13 16:35:29,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:35:29,082 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2024-11-13 16:35:29,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 116 treesize of output 80 [2024-11-13 16:35:30,507 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:35:30,507 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:35:32,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:35:32,746 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 423 treesize of output 385 [2024-11-13 16:35:32,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:35:32,800 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 374 treesize of output 336 [2024-11-13 16:35:33,547 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse14 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse0 (select .cse14 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse6 (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse14 |c_ULTIMATE.start_sll_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse8 (select .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_48| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_48|))) (forall ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_10 (_ bv4 32)) .cse0)) (forall ((v_arrayElimArr_9 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_48| v_arrayElimArr_10)) (.cse1 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_48| v_arrayElimArr_9)) (.cse5 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_48|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (bvadd (select (select .cse4 .cse5) .cse6) (_ bv4 32)))) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (bvadd (_ bv4 32) (select (select .cse4 .cse2) .cse3)))))) (not (= (select v_arrayElimArr_9 (_ bv4 32)) .cse8)))))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_48| (_ BitVec 32))) (or (forall ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_10 (_ bv4 32)) .cse0)) (forall ((v_arrayElimArr_9 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (let ((.cse9 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_48| v_arrayElimArr_10)) (.cse10 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_48| v_arrayElimArr_9)) (.cse13 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_48|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select (select .cse10 .cse13) .cse6)) (.cse12 (bvadd (select (select .cse9 .cse13) .cse6) (_ bv4 32)))) (select (select .cse9 (select (select .cse10 .cse11) .cse12)) (bvadd (_ bv4 32) (select (select .cse9 .cse11) .cse12)))))) (not (= (select v_arrayElimArr_9 (_ bv4 32)) .cse8)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_48|)))))))) is different from false [2024-11-13 16:35:33,586 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:35:33,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078611857] [2024-11-13 16:35:33,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078611857] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:35:33,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [460368143] [2024-11-13 16:35:33,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 16:35:33,587 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 16:35:33,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/cvc4 [2024-11-13 16:35:33,589 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 16:35:33,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-13 16:35:34,124 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-13 16:35:34,124 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:35:34,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-13 16:35:34,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:35:34,277 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 7 [2024-11-13 16:35:34,470 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 11 treesize of output 7 [2024-11-13 16:35:34,482 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 11 treesize of output 7 [2024-11-13 16:35:34,822 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 16:35:34,822 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-13 16:35:34,878 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-13 16:35:34,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-13 16:35:34,914 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 16:35:35,144 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 23 treesize of output 22 [2024-11-13 16:35:35,194 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 15 [2024-11-13 16:35:36,022 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-13 16:35:36,023 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 29 [2024-11-13 16:35:36,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 16:35:36,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-13 16:35:48,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:35:48,848 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-13 16:35:48,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 53 [2024-11-13 16:35:48,901 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-13 16:35:48,901 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 32 treesize of output 34 [2024-11-13 16:35:48,927 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-11-13 16:35:49,341 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-13 16:35:49,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 63 [2024-11-13 16:35:49,353 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 69 [2024-11-13 16:35:49,365 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2024-11-13 16:35:49,455 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-13 16:35:49,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 16:35:49,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 116 treesize of output 80 [2024-11-13 16:35:50,240 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:35:50,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:35:50,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:35:50,747 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 423 treesize of output 385 [2024-11-13 16:35:50,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:35:50,801 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 374 treesize of output 336 [2024-11-13 16:36:20,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [460368143] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:36:20,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:36:20,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 38 [2024-11-13 16:36:20,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978308269] [2024-11-13 16:36:20,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:36:20,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-13 16:36:20,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:36:20,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-13 16:36:20,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1936, Unknown=14, NotChecked=88, Total=2162 [2024-11-13 16:36:20,197 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 38 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 29 states have internal predecessors, (46), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 16:36:25,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:36:30,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:36:34,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:36:39,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:36:43,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:36:48,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:36:52,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:37:31,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:37:31,192 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2024-11-13 16:37:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 16:37:31,192 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 29 states have internal predecessors, (46), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2024-11-13 16:37:31,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:37:31,193 INFO L225 Difference]: With dead ends: 64 [2024-11-13 16:37:31,193 INFO L226 Difference]: Without dead ends: 42 [2024-11-13 16:37:31,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 74.5s TimeCoverageRelationStatistics Valid=191, Invalid=2879, Unknown=14, NotChecked=108, Total=3192 [2024-11-13 16:37:31,195 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 15 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 7 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:37:31,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 302 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 662 Invalid, 7 Unknown, 0 Unchecked, 52.0s Time] [2024-11-13 16:37:31,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-13 16:37:31,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-13 16:37:31,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 16:37:31,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2024-11-13 16:37:31,210 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 38 [2024-11-13 16:37:31,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:37:31,210 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2024-11-13 16:37:31,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 29 states have internal predecessors, (46), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 16:37:31,211 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2024-11-13 16:37:31,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-13 16:37:31,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:37:31,211 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:37:31,218 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2024-11-13 16:37:31,429 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-13 16:37:31,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:37:31,612 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:37:31,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:37:31,612 INFO L85 PathProgramCache]: Analyzing trace with hash 603814212, now seen corresponding path program 4 times [2024-11-13 16:37:31,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:37:31,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1061008470] [2024-11-13 16:37:31,613 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 16:37:31,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:37:31,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:37:31,614 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:37:31,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-13 16:37:31,821 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 16:37:31,821 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:37:31,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 16:37:31,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:37:32,859 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 16:37:32,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:37:35,090 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-13 16:37:35,090 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:37:35,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061008470] [2024-11-13 16:37:35,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061008470] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:37:35,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:37:35,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-13 16:37:35,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402295523] [2024-11-13 16:37:35,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:37:35,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 16:37:35,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:37:35,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 16:37:35,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:37:35,092 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-13 16:37:35,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:37:35,875 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2024-11-13 16:37:35,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:37:35,876 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 54 [2024-11-13 16:37:35,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:37:35,877 INFO L225 Difference]: With dead ends: 47 [2024-11-13 16:37:35,877 INFO L226 Difference]: Without dead ends: 0 [2024-11-13 16:37:35,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:37:35,878 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 16:37:35,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 16:37:35,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-13 16:37:35,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-13 16:37:35,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:37:35,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-13 16:37:35,879 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2024-11-13 16:37:35,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:37:35,879 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 16:37:35,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-13 16:37:35,879 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-13 16:37:35,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 16:37:35,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 16:37:35,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-13 16:37:36,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:37:36,087 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1] [2024-11-13 16:37:36,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-13 16:37:44,438 WARN L286 SmtUtils]: Spent 6.00s on a formula simplification. DAG size of input: 58 DAG size of output: 56 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-13 16:38:02,287 WARN L286 SmtUtils]: Spent 16.14s on a formula simplification. DAG size of input: 205 DAG size of output: 160 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-13 16:38:05,143 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 16:38:05,165 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 16:38:05,165 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 16:38:05,166 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] [2024-11-13 16:38:05,166 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 16:38:05,166 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 16:38:05,166 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-13 16:38:05,167 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-13 16:38:05,167 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-13 16:38:05,167 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-13 16:38:05,167 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-13 16:38:05,167 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-13 16:38:05,167 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:38:05,167 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:38:05,168 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] [2024-11-13 16:38:05,168 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 16:38:05,168 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!offset [2024-11-13 16:38:05,168 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 16:38:05,169 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 16:38:05,169 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,169 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 16:38:05,169 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 16:38:05,169 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,169 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 16:38:05,169 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 16:38:05,169 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,170 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:38:05,170 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:38:05,170 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] [2024-11-13 16:38:05,170 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 16:38:05,170 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 16:38:05,170 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] [2024-11-13 16:38:05,170 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-13 16:38:05,171 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 16:38:05,171 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 16:38:05,171 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,171 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:38:05,171 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:38:05,171 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,171 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:38:05,171 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:38:05,172 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,172 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 16:38:05,172 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 16:38:05,172 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] [2024-11-13 16:38:05,172 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 16:38:05,172 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 16:38:05,172 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~ptr~0!base,]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,173 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-13 16:38:05,173 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-13 16:38:05,173 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-13 16:38:05,173 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-13 16:38:05,173 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-13 16:38:05,173 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-13 16:38:05,173 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 16:38:05,174 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 16:38:05,174 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] [2024-11-13 16:38:05,174 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:38:05,174 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:38:05,174 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] [2024-11-13 16:38:05,174 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!offset [2024-11-13 16:38:05,174 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 16:38:05,174 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 16:38:05,175 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,175 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 16:38:05,175 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 16:38:05,175 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~ptr~0!base,]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,175 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 16:38:05,175 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 16:38:05,175 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,175 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!base [2024-11-13 16:38:05,176 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 16:38:05,176 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 16:38:05,176 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,176 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 16:38:05,176 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 16:38:05,176 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~ptr~0!base,]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,176 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:38:05,177 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:38:05,177 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] [2024-11-13 16:38:05,177 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:38:05,177 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:38:05,177 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~ptr~0!base,]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,177 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 16:38:05,177 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 16:38:05,178 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] [2024-11-13 16:38:05,178 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 16:38:05,178 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 16:38:05,178 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] [2024-11-13 16:38:05,178 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 16:38:05,178 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 16:38:05,178 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~ptr~0!base,]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,178 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-13 16:38:05,178 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 16:38:05,178 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 16:38:05,179 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,179 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:38:05,179 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:38:05,179 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,179 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:38:05,179 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:38:05,179 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~ptr~0!base,]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,179 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:38:05,179 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:38:05,179 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,179 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 16:38:05,179 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 16:38:05,179 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] [2024-11-13 16:38:05,180 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-13 16:38:05,180 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-13 16:38:05,180 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-13 16:38:05,180 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-13 16:38:05,180 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-13 16:38:05,180 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-13 16:38:05,180 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!base [2024-11-13 16:38:05,181 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:38:05,181 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:38:05,181 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] [2024-11-13 16:38:05,181 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!offset [2024-11-13 16:38:05,181 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 16:38:05,181 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 16:38:05,182 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,182 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 16:38:05,182 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 16:38:05,182 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,182 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 16:38:05,182 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 16:38:05,182 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,182 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 16:38:05,183 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 16:38:05,183 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] [2024-11-13 16:38:05,183 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-13 16:38:05,183 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 16:38:05,183 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 16:38:05,183 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,183 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:38:05,184 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:38:05,184 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,184 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:38:05,184 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:38:05,184 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,184 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 16:38:05,184 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 16:38:05,184 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] [2024-11-13 16:38:05,185 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 16:38:05,185 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-13 16:38:05,185 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-13 16:38:05,185 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-13 16:38:05,185 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-13 16:38:05,185 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-13 16:38:05,185 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-13 16:38:05,186 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:38:05,186 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:38:05,186 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] [2024-11-13 16:38:05,186 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!offset [2024-11-13 16:38:05,186 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 16:38:05,186 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 16:38:05,186 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,186 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 16:38:05,186 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 16:38:05,186 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,186 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!base [2024-11-13 16:38:05,186 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 16:38:05,187 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 16:38:05,187 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,187 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:38:05,187 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:38:05,187 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] [2024-11-13 16:38:05,187 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 16:38:05,187 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 16:38:05,187 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] [2024-11-13 16:38:05,187 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-13 16:38:05,187 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 16:38:05,187 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 16:38:05,187 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,187 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:38:05,187 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:38:05,187 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,188 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:38:05,188 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:38:05,188 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,191 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 16:38:05,191 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 16:38:05,191 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-13 16:38:05,191 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-13 16:38:05,192 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 16:38:05,192 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 16:38:05,192 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-13 16:38:05,192 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 16:38:05,192 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 16:38:05,192 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-13 16:38:05,193 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-13 16:38:05,193 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:38:05,193 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:38:05,193 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-13 16:38:05,193 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-13 16:38:05,193 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 16:38:05,193 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 16:38:05,193 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-13 16:38:05,194 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:38:05,194 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:38:05,194 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,194 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 16:38:05,194 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 16:38:05,194 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,194 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 16:38:05,195 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 16:38:05,195 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 16:38:05,195 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-13 16:38:05,195 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[BitvecLiteral[4,32]]]]] [2024-11-13 16:38:05,195 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 16:38:05,195 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-13 16:38:05,195 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-13 16:38:05,195 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 16:38:05,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 16:38:05,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-13 16:38:05,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-13 16:38:05,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:38:05,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:38:05,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-13 16:38:05,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-13 16:38:05,197 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-13 16:38:05,197 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-13 16:38:05,199 WARN L162 FloydHoareUtils]: Requires clause for node_create contained old-variable. Original clause: (and (= |#memory_$Pointer$#1.base| |old(#memory_$Pointer$#1.base)|) (= |old(#memory_int#1)| |#memory_int#1|) (= |old(#valid)| |#valid|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|)) Eliminated clause: true [2024-11-13 16:38:05,204 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 16:38:05,204 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-13 16:38:05,204 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:38:05,204 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:38:05,204 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#res!base,]]] [2024-11-13 16:38:05,204 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 16:38:05,205 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 16:38:05,205 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 16:38:05,205 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#valid,GLOBAL]] [2024-11-13 16:38:05,205 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 16:38:05,205 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:38:05,205 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-13 16:38:05,205 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!base [2024-11-13 16:38:05,205 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-13 16:38:05,205 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 16:38:05,208 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-13 16:38:05,208 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-13 16:38:05,208 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-13 16:38:05,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 04:38:05 BoogieIcfgContainer [2024-11-13 16:38:05,208 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 16:38:05,209 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 16:38:05,209 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 16:38:05,209 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 16:38:05,210 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:34:09" (3/4) ... [2024-11-13 16:38:05,212 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 16:38:05,217 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2024-11-13 16:38:05,224 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-13 16:38:05,225 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-13 16:38:05,225 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 16:38:05,226 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 16:38:05,314 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 16:38:05,314 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/witness.yml [2024-11-13 16:38:05,314 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 16:38:05,316 INFO L158 Benchmark]: Toolchain (without parser) took 236698.68ms. Allocated memory was 117.4MB in the beginning and 260.0MB in the end (delta: 142.6MB). Free memory was 91.2MB in the beginning and 131.4MB in the end (delta: -40.1MB). Peak memory consumption was 100.8MB. Max. memory is 16.1GB. [2024-11-13 16:38:05,316 INFO L158 Benchmark]: CDTParser took 4.08ms. Allocated memory is still 117.4MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:38:05,316 INFO L158 Benchmark]: CACSL2BoogieTranslator took 596.37ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 72.4MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 16:38:05,317 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.90ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 70.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:38:05,317 INFO L158 Benchmark]: Boogie Preprocessor took 86.26ms. Allocated memory is still 117.4MB. Free memory was 70.6MB in the beginning and 67.9MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:38:05,319 INFO L158 Benchmark]: RCFGBuilder took 500.64ms. Allocated memory is still 117.4MB. Free memory was 67.9MB in the beginning and 51.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 16:38:05,319 INFO L158 Benchmark]: TraceAbstraction took 235343.89ms. Allocated memory was 117.4MB in the beginning and 260.0MB in the end (delta: 142.6MB). Free memory was 51.1MB in the beginning and 134.3MB in the end (delta: -83.2MB). Peak memory consumption was 109.9MB. Max. memory is 16.1GB. [2024-11-13 16:38:05,319 INFO L158 Benchmark]: Witness Printer took 105.19ms. Allocated memory is still 260.0MB. Free memory was 134.3MB in the beginning and 131.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:38:05,320 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 4.08ms. Allocated memory is still 117.4MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 596.37ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 72.4MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.90ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 70.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 86.26ms. Allocated memory is still 117.4MB. Free memory was 70.6MB in the beginning and 67.9MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 500.64ms. Allocated memory is still 117.4MB. Free memory was 67.9MB in the beginning and 51.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 235343.89ms. Allocated memory was 117.4MB in the beginning and 260.0MB in the end (delta: 142.6MB). Free memory was 51.1MB in the beginning and 134.3MB in the end (delta: -83.2MB). Peak memory consumption was 109.9MB. Max. memory is 16.1GB. * Witness Printer took 105.19ms. Allocated memory is still 260.0MB. Free memory was 134.3MB in the beginning and 131.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~ptr~0!base,]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~ptr~0!base,]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~ptr~0!base,]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~ptr~0!base,]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~ptr~0!base,]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~ptr~0!base,]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#res!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#valid,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 624]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 206.2s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 94.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 155 SdHoareTripleChecker+Valid, 68.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 149 mSDsluCounter, 2137 SdHoareTripleChecker+Invalid, 67.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1912 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2850 IncrementalHoareTripleChecker+Invalid, 2873 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 225 mSDtfsCounter, 2850 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 791 GetRequests, 501 SyntacticMatches, 3 SemanticMatches, 287 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 2266 ImplicationChecksByTransitivity, 109.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=10, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 13 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 4.6s SatisfiabilityAnalysisTime, 101.1s InterpolantComputationTime, 518 NumberOfCodeBlocks, 501 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 648 ConstructedInterpolants, 79 QuantifiedInterpolants, 7989 SizeOfPredicates, 81 NumberOfNonLiveVariables, 3199 ConjunctsInSsa, 688 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 330/508 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: ((((((1 == count) && (2 == len)) && (data == 1)) || (((2 == len) && (0 == count)) && (data == 1))) || (((3 == count) && (2 == len)) && (data == 1))) || (((2 == count) && (2 == len)) && (data == 1))) - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((((((1 == data) && (len == 1)) && (2 == len)) && (data == 1)) || ((((1 == data) && (len == 0)) && (2 == len)) && (data == 1))) || ((((1 == data) && (len == 2)) && (2 == len)) && (data == 1))) RESULT: Ultimate proved your program to be correct! [2024-11-13 16:38:05,548 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-13 16:38:05,650 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfb7af1f-6e2b-4022-a22f-14ea10280465/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE