./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0236.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/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_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0236.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9284cc089e563ce2bdd0201592786c36b8d718b3efb8766c887a82d2ff3babc3 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:53:37,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:53:37,880 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 14:53:37,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:53:37,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:53:37,924 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:53:37,925 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:53:37,925 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:53:37,926 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:53:37,926 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:53:37,926 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:53:37,926 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:53:37,926 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:53:37,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:53:37,927 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:53:37,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:53:37,927 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:53:37,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:53:37,927 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:53:37,929 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:53:37,929 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 14:53:37,930 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 14:53:37,930 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 14:53:37,930 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:53:37,930 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:53:37,930 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:53:37,930 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 14:53:37,930 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:53:37,930 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:53:37,931 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:53:37,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:53:37,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:53:37,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:53:37,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:53:37,931 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:53:37,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:53:37,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:53:37,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:53:37,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:53:37,932 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:53:37,932 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:53:37,932 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:53:37,932 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_13b0d621-05da-4bc3-a31d-7c86b0be74e0/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 9284cc089e563ce2bdd0201592786c36b8d718b3efb8766c887a82d2ff3babc3 [2024-11-13 14:53:38,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:53:38,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:53:38,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:53:38,270 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:53:38,271 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:53:38,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/memsafety/test-0236.i Unable to find full path for "g++" [2024-11-13 14:53:40,198 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:53:40,588 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:53:40,589 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/sv-benchmarks/c/memsafety/test-0236.i [2024-11-13 14:53:40,611 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/data/f76ac046e/2540169eb847487ba195f53e1c153d50/FLAG9d9d32854 [2024-11-13 14:53:40,786 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/data/f76ac046e/2540169eb847487ba195f53e1c153d50 [2024-11-13 14:53:40,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:53:40,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:53:40,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:53:40,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:53:40,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:53:40,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:53:40" (1/1) ... [2024-11-13 14:53:40,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d54ec3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:40, skipping insertion in model container [2024-11-13 14:53:40,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:53:40" (1/1) ... [2024-11-13 14:53:40,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:53:41,258 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 14:53:41,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:53:41,296 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:53:41,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:53:41,402 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:53:41,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:41 WrapperNode [2024-11-13 14:53:41,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:53:41,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:53:41,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:53:41,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:53:41,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:41" (1/1) ... [2024-11-13 14:53:41,429 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:41" (1/1) ... [2024-11-13 14:53:41,455 INFO L138 Inliner]: procedures = 188, calls = 67, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 211 [2024-11-13 14:53:41,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:53:41,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:53:41,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:53:41,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:53:41,466 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:41" (1/1) ... [2024-11-13 14:53:41,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:41" (1/1) ... [2024-11-13 14:53:41,477 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:41" (1/1) ... [2024-11-13 14:53:41,505 INFO L175 MemorySlicer]: Split 39 memory accesses to 2 slices as follows [2, 37]. 95 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 19 writes are split as follows [0, 19]. [2024-11-13 14:53:41,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:41" (1/1) ... [2024-11-13 14:53:41,506 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:41" (1/1) ... [2024-11-13 14:53:41,517 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:41" (1/1) ... [2024-11-13 14:53:41,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:41" (1/1) ... [2024-11-13 14:53:41,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:41" (1/1) ... [2024-11-13 14:53:41,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:41" (1/1) ... [2024-11-13 14:53:41,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:53:41,540 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:53:41,540 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:53:41,540 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:53:41,541 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:41" (1/1) ... [2024-11-13 14:53:41,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:53:41,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:53:41,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:53:41,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:53:41,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 14:53:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:53:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 14:53:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 14:53:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 14:53:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 14:53:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2024-11-13 14:53:41,606 INFO L138 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2024-11-13 14:53:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 14:53:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 14:53:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 14:53:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:53:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 14:53:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:53:41,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:53:41,781 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:53:41,784 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:53:42,560 INFO L? ?]: Removed 220 outVars from TransFormulas that were not future-live. [2024-11-13 14:53:42,560 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:53:42,583 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:53:42,584 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-13 14:53:42,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:53:42 BoogieIcfgContainer [2024-11-13 14:53:42,587 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:53:42,589 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:53:42,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:53:42,596 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:53:42,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:53:40" (1/3) ... [2024-11-13 14:53:42,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c864aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:53:42, skipping insertion in model container [2024-11-13 14:53:42,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:41" (2/3) ... [2024-11-13 14:53:42,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c864aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:53:42, skipping insertion in model container [2024-11-13 14:53:42,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:53:42" (3/3) ... [2024-11-13 14:53:42,601 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0236.i [2024-11-13 14:53:42,619 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:53:42,622 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0236.i that has 2 procedures, 208 locations, 1 initial locations, 11 loop locations, and 89 error locations. [2024-11-13 14:53:42,681 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:53:42,693 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=None, 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;@3cc41091, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:53:42,694 INFO L334 AbstractCegarLoop]: Starting to check reachability of 89 error locations. [2024-11-13 14:53:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 208 states, 111 states have (on average 2.0) internal successors, (222), 200 states have internal predecessors, (222), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:53:42,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 14:53:42,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:42,705 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 14:53:42,706 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-13 14:53:42,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:42,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1546182, now seen corresponding path program 1 times [2024-11-13 14:53:42,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:53:42,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181244907] [2024-11-13 14:53:42,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:42,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:53:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:42,857 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 14:53:42,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:53:42,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181244907] [2024-11-13 14:53:42,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181244907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:53:42,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:53:42,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:53:42,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894240417] [2024-11-13 14:53:42,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:53:42,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:53:42,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:53:42,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:53:42,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:53:42,894 INFO L87 Difference]: Start difference. First operand has 208 states, 111 states have (on average 2.0) internal successors, (222), 200 states have internal predecessors, (222), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 14:53:42,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:53:42,920 INFO L93 Difference]: Finished difference Result 208 states and 223 transitions. [2024-11-13 14:53:42,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:53:42,922 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) Word has length 4 [2024-11-13 14:53:42,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:53:42,931 INFO L225 Difference]: With dead ends: 208 [2024-11-13 14:53:42,932 INFO L226 Difference]: Without dead ends: 206 [2024-11-13 14:53:42,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 14:53:42,938 INFO L432 NwaCegarLoop]: 223 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, 223 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 14:53:42,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:53:42,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-13 14:53:42,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2024-11-13 14:53:42,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 110 states have (on average 1.9) internal successors, (209), 198 states have internal predecessors, (209), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:53:42,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 221 transitions. [2024-11-13 14:53:42,982 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 221 transitions. Word has length 4 [2024-11-13 14:53:42,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:53:42,982 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 221 transitions. [2024-11-13 14:53:42,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 14:53:42,983 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 221 transitions. [2024-11-13 14:53:42,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 14:53:42,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:42,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 14:53:42,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:53:42,984 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-13 14:53:42,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:42,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1481489133, now seen corresponding path program 1 times [2024-11-13 14:53:42,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:53:42,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409278630] [2024-11-13 14:53:42,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:42,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:53:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:43,176 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 14:53:43,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:53:43,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409278630] [2024-11-13 14:53:43,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409278630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:53:43,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:53:43,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:53:43,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687228377] [2024-11-13 14:53:43,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:53:43,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:53:43,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:53:43,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:53:43,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:53:43,179 INFO L87 Difference]: Start difference. First operand 206 states and 221 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:53:43,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:53:43,407 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2024-11-13 14:53:43,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:53:43,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-13 14:53:43,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:53:43,409 INFO L225 Difference]: With dead ends: 205 [2024-11-13 14:53:43,409 INFO L226 Difference]: Without dead ends: 205 [2024-11-13 14:53:43,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 14:53:43,410 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 4 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:53:43,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 345 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:53:43,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-13 14:53:43,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-13 14:53:43,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 110 states have (on average 1.8909090909090909) internal successors, (208), 197 states have internal predecessors, (208), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:53:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 220 transitions. [2024-11-13 14:53:43,423 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 220 transitions. Word has length 6 [2024-11-13 14:53:43,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:53:43,423 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 220 transitions. [2024-11-13 14:53:43,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:53:43,423 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 220 transitions. [2024-11-13 14:53:43,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 14:53:43,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:43,423 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:53:43,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:53:43,424 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-13 14:53:43,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:43,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1318477099, now seen corresponding path program 1 times [2024-11-13 14:53:43,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:53:43,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977825750] [2024-11-13 14:53:43,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:43,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:53:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:53:43,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1623929176] [2024-11-13 14:53:43,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:43,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:43,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:53:43,456 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:53:43,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:53:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:43,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-13 14:53:43,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:53:43,679 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 14:53:43,707 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 14:53:43,707 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:53:43,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:53:43,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977825750] [2024-11-13 14:53:43,708 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 14:53:43,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623929176] [2024-11-13 14:53:43,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623929176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:53:43,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:53:43,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:53:43,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315236183] [2024-11-13 14:53:43,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:53:43,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:53:43,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:53:43,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:53:43,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:53:43,710 INFO L87 Difference]: Start difference. First operand 205 states and 220 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:53:43,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:53:43,942 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2024-11-13 14:53:43,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:53:43,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-13 14:53:43,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:53:43,945 INFO L225 Difference]: With dead ends: 214 [2024-11-13 14:53:43,945 INFO L226 Difference]: Without dead ends: 214 [2024-11-13 14:53:43,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:53:43,946 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 11 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:53:43,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 557 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:53:43,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-13 14:53:43,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2024-11-13 14:53:43,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 118 states have (on average 1.8389830508474576) internal successors, (217), 205 states have internal predecessors, (217), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:53:43,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 229 transitions. [2024-11-13 14:53:43,969 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 229 transitions. Word has length 7 [2024-11-13 14:53:43,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:53:43,969 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 229 transitions. [2024-11-13 14:53:43,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:53:43,970 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 229 transitions. [2024-11-13 14:53:43,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-13 14:53:43,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:43,975 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:53:43,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:53:44,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:44,176 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-13 14:53:44,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:44,177 INFO L85 PathProgramCache]: Analyzing trace with hash 321188344, now seen corresponding path program 1 times [2024-11-13 14:53:44,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:53:44,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795168018] [2024-11-13 14:53:44,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:44,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:53:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:53:44,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [51928347] [2024-11-13 14:53:44,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:44,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:44,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:53:44,321 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:53:44,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:53:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:44,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-13 14:53:44,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:53:44,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-13 14:53:44,685 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 13 treesize of output 9 [2024-11-13 14:53:44,794 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 14:53:44,794 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:53:44,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:53:44,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795168018] [2024-11-13 14:53:44,795 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 14:53:44,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51928347] [2024-11-13 14:53:44,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51928347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:53:44,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:53:44,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:53:44,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119507036] [2024-11-13 14:53:44,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:53:44,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:53:44,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:53:44,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:53:44,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:53:44,797 INFO L87 Difference]: Start difference. First operand 214 states and 229 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 14:53:45,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:53:45,045 INFO L93 Difference]: Finished difference Result 226 states and 241 transitions. [2024-11-13 14:53:45,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:53:45,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2024-11-13 14:53:45,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:53:45,047 INFO L225 Difference]: With dead ends: 226 [2024-11-13 14:53:45,048 INFO L226 Difference]: Without dead ends: 216 [2024-11-13 14:53:45,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:53:45,049 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 3 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:53:45,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 768 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:53:45,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-13 14:53:45,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2024-11-13 14:53:45,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 120 states have (on average 1.825) internal successors, (219), 207 states have internal predecessors, (219), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:53:45,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 231 transitions. [2024-11-13 14:53:45,068 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 231 transitions. Word has length 66 [2024-11-13 14:53:45,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:53:45,069 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 231 transitions. [2024-11-13 14:53:45,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 14:53:45,069 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 231 transitions. [2024-11-13 14:53:45,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 14:53:45,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:45,071 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:53:45,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 14:53:45,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:45,271 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-13 14:53:45,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:45,272 INFO L85 PathProgramCache]: Analyzing trace with hash 622064248, now seen corresponding path program 1 times [2024-11-13 14:53:45,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:53:45,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469215779] [2024-11-13 14:53:45,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:45,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:53:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:53:45,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1734837560] [2024-11-13 14:53:45,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:45,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:45,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:53:45,559 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:53:45,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 14:53:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:45,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 14:53:45,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:53:45,973 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 8 treesize of output 1 [2024-11-13 14:53:46,032 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 13 treesize of output 9 [2024-11-13 14:53:46,159 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 88 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-13 14:53:46,159 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:53:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 26 proven. 34 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-13 14:53:46,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:53:46,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469215779] [2024-11-13 14:53:46,476 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 14:53:46,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734837560] [2024-11-13 14:53:46,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734837560] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:53:46,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:53:46,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2024-11-13 14:53:46,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186102242] [2024-11-13 14:53:46,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:53:46,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 14:53:46,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:53:46,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 14:53:46,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:53:46,478 INFO L87 Difference]: Start difference. First operand 216 states and 231 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-13 14:53:47,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:53:47,033 INFO L93 Difference]: Finished difference Result 235 states and 251 transitions. [2024-11-13 14:53:47,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 14:53:47,034 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 71 [2024-11-13 14:53:47,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:53:47,035 INFO L225 Difference]: With dead ends: 235 [2024-11-13 14:53:47,035 INFO L226 Difference]: Without dead ends: 220 [2024-11-13 14:53:47,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2024-11-13 14:53:47,036 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 13 mSDsluCounter, 1725 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1939 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:53:47,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1939 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:53:47,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-13 14:53:47,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2024-11-13 14:53:47,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 124 states have (on average 1.7983870967741935) internal successors, (223), 211 states have internal predecessors, (223), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:53:47,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 235 transitions. [2024-11-13 14:53:47,045 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 235 transitions. Word has length 71 [2024-11-13 14:53:47,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:53:47,045 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 235 transitions. [2024-11-13 14:53:47,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-13 14:53:47,046 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 235 transitions. [2024-11-13 14:53:47,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 14:53:47,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:47,051 INFO L215 NwaCegarLoop]: trace histogram [20, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:53:47,076 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-13 14:53:47,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:47,252 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-13 14:53:47,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:47,252 INFO L85 PathProgramCache]: Analyzing trace with hash -588811784, now seen corresponding path program 2 times [2024-11-13 14:53:47,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:53:47,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777537855] [2024-11-13 14:53:47,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:47,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:53:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:53:47,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1901023922] [2024-11-13 14:53:47,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:53:47,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:47,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:53:47,637 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:53:47,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 14:53:48,386 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 14:53:48,386 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:53:48,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-13 14:53:48,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:53:48,477 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 8 treesize of output 7 [2024-11-13 14:53:48,525 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 13 treesize of output 9 [2024-11-13 14:53:48,732 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 115 proven. 158 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-11-13 14:53:48,733 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:53:49,225 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 143 proven. 10 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-13 14:53:49,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:53:49,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777537855] [2024-11-13 14:53:49,226 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 14:53:49,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901023922] [2024-11-13 14:53:49,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901023922] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:53:49,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:53:49,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-13 14:53:49,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615802285] [2024-11-13 14:53:49,226 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:53:49,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 14:53:49,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:53:49,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 14:53:49,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-11-13 14:53:49,228 INFO L87 Difference]: Start difference. First operand 220 states and 235 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-13 14:53:50,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:53:50,612 INFO L93 Difference]: Finished difference Result 244 states and 265 transitions. [2024-11-13 14:53:50,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 14:53:50,612 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 86 [2024-11-13 14:53:50,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:53:50,614 INFO L225 Difference]: With dead ends: 244 [2024-11-13 14:53:50,614 INFO L226 Difference]: Without dead ends: 229 [2024-11-13 14:53:50,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=318, Invalid=942, Unknown=0, NotChecked=0, Total=1260 [2024-11-13 14:53:50,615 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 33 mSDsluCounter, 2372 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 2586 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:53:50,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 2586 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 14:53:50,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-13 14:53:50,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-11-13 14:53:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 133 states have (on average 1.744360902255639) internal successors, (232), 220 states have internal predecessors, (232), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:53:50,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 244 transitions. [2024-11-13 14:53:50,624 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 244 transitions. Word has length 86 [2024-11-13 14:53:50,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:53:50,624 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 244 transitions. [2024-11-13 14:53:50,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-13 14:53:50,625 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 244 transitions. [2024-11-13 14:53:50,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 14:53:50,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:50,627 INFO L215 NwaCegarLoop]: trace histogram [50, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:53:50,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-13 14:53:50,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-13 14:53:50,832 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-13 14:53:50,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:50,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1293757960, now seen corresponding path program 3 times [2024-11-13 14:53:50,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:53:50,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502564595] [2024-11-13 14:53:50,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:50,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:53:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:53:51,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2068183061] [2024-11-13 14:53:51,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 14:53:51,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:51,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:53:51,301 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:53:51,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 14:53:51,640 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-13 14:53:51,641 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:53:51,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-13 14:53:51,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:53:51,698 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 14:53:51,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1580 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1565 trivial. 0 not checked. [2024-11-13 14:53:51,726 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:53:51,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:53:51,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502564595] [2024-11-13 14:53:51,727 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 14:53:51,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068183061] [2024-11-13 14:53:51,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068183061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:53:51,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:53:51,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:53:51,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986255280] [2024-11-13 14:53:51,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:53:51,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:53:51,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:53:51,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:53:51,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:53:51,730 INFO L87 Difference]: Start difference. First operand 229 states and 244 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-13 14:53:51,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:53:51,906 INFO L93 Difference]: Finished difference Result 228 states and 243 transitions. [2024-11-13 14:53:51,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:53:51,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 116 [2024-11-13 14:53:51,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:53:51,908 INFO L225 Difference]: With dead ends: 228 [2024-11-13 14:53:51,909 INFO L226 Difference]: Without dead ends: 228 [2024-11-13 14:53:51,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:53:51,910 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 11 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:53:51,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 579 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:53:51,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-13 14:53:51,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-11-13 14:53:51,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 133 states have (on average 1.736842105263158) internal successors, (231), 219 states have internal predecessors, (231), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:53:51,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 243 transitions. [2024-11-13 14:53:51,921 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 243 transitions. Word has length 116 [2024-11-13 14:53:51,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:53:51,921 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 243 transitions. [2024-11-13 14:53:51,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-13 14:53:51,922 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 243 transitions. [2024-11-13 14:53:51,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 14:53:51,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:51,923 INFO L215 NwaCegarLoop]: trace histogram [55, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:53:51,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 14:53:52,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:52,128 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-13 14:53:52,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:52,128 INFO L85 PathProgramCache]: Analyzing trace with hash -200034104, now seen corresponding path program 1 times [2024-11-13 14:53:52,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:53:52,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434472410] [2024-11-13 14:53:52,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:52,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:53:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:53,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:53:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:53,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-13 14:53:53,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:53,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:53:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:53,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-13 14:53:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:53,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 14:53:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:54,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-13 14:53:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:54,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 804 proven. 73 refuted. 0 times theorem prover too weak. 1073 trivial. 0 not checked. [2024-11-13 14:53:54,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:53:54,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434472410] [2024-11-13 14:53:54,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434472410] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:53:54,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326227670] [2024-11-13 14:53:54,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:54,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:54,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:53:54,250 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:53:54,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 14:53:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:54,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-13 14:53:54,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:53:54,894 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2024-11-13 14:53:54,944 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-13 14:53:54,945 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 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-13 14:53:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 809 proven. 1 refuted. 0 times theorem prover too weak. 1068 trivial. 72 not checked. [2024-11-13 14:53:54,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:53:55,293 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-13 14:53:55,293 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 12 treesize of output 11 [2024-11-13 14:53:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 809 proven. 73 refuted. 0 times theorem prover too weak. 1068 trivial. 0 not checked. [2024-11-13 14:53:55,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326227670] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:53:55,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:53:55,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 17 [2024-11-13 14:53:55,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995852837] [2024-11-13 14:53:55,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:53:55,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 14:53:55,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:53:55,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 14:53:55,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=224, Unknown=1, NotChecked=30, Total=306 [2024-11-13 14:53:55,332 INFO L87 Difference]: Start difference. First operand 228 states and 243 transitions. Second operand has 18 states, 17 states have (on average 3.823529411764706) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-13 14:53:56,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:53:56,196 INFO L93 Difference]: Finished difference Result 224 states and 239 transitions. [2024-11-13 14:53:56,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:53:56,197 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.823529411764706) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 128 [2024-11-13 14:53:56,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:53:56,198 INFO L225 Difference]: With dead ends: 224 [2024-11-13 14:53:56,199 INFO L226 Difference]: Without dead ends: 224 [2024-11-13 14:53:56,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 256 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=344, Unknown=1, NotChecked=38, Total=462 [2024-11-13 14:53:56,200 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 19 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 207 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:53:56,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1517 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 994 Invalid, 0 Unknown, 207 Unchecked, 0.7s Time] [2024-11-13 14:53:56,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-13 14:53:56,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2024-11-13 14:53:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 133 states have (on average 1.7067669172932332) internal successors, (227), 215 states have internal predecessors, (227), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:53:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 239 transitions. [2024-11-13 14:53:56,211 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 239 transitions. Word has length 128 [2024-11-13 14:53:56,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:53:56,213 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 239 transitions. [2024-11-13 14:53:56,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.823529411764706) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-13 14:53:56,213 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 239 transitions. [2024-11-13 14:53:56,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 14:53:56,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:56,218 INFO L215 NwaCegarLoop]: trace histogram [55, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:53:56,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-13 14:53:56,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-13 14:53:56,419 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-13 14:53:56,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:56,420 INFO L85 PathProgramCache]: Analyzing trace with hash -200034103, now seen corresponding path program 1 times [2024-11-13 14:53:56,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:53:56,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140260512] [2024-11-13 14:53:56,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:56,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:53:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:53:56,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [794948472] [2024-11-13 14:53:56,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:56,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:56,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:53:56,948 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:53:56,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 14:54:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:00,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-13 14:54:00,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:54:00,223 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 8 treesize of output 1 [2024-11-13 14:54:00,266 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 13 treesize of output 9 [2024-11-13 14:54:00,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 1006 proven. 685 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2024-11-13 14:54:00,707 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:54:01,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 384 proven. 256 refuted. 0 times theorem prover too weak. 1310 trivial. 0 not checked. [2024-11-13 14:54:01,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:54:01,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140260512] [2024-11-13 14:54:01,770 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 14:54:01,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794948472] [2024-11-13 14:54:01,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794948472] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:54:01,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:54:01,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15] total 38 [2024-11-13 14:54:01,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076945504] [2024-11-13 14:54:01,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:54:01,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-13 14:54:01,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:54:01,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-13 14:54:01,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1174, Unknown=0, NotChecked=0, Total=1406 [2024-11-13 14:54:01,777 INFO L87 Difference]: Start difference. First operand 224 states and 239 transitions. Second operand has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 38 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-13 14:54:22,277 WARN L286 SmtUtils]: Spent 19.10s on a formula simplification. DAG size of input: 87 DAG size of output: 86 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:57:58,514 WARN L286 SmtUtils]: Spent 3.59m on a formula simplification. DAG size of input: 82 DAG size of output: 81 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:58:04,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:58:04,397 INFO L93 Difference]: Finished difference Result 257 states and 287 transitions. [2024-11-13 14:58:04,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-13 14:58:04,398 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 38 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 128 [2024-11-13 14:58:04,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:58:04,400 INFO L225 Difference]: With dead ends: 257 [2024-11-13 14:58:04,400 INFO L226 Difference]: Without dead ends: 242 [2024-11-13 14:58:04,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 242.0s TimeCoverageRelationStatistics Valid=997, Invalid=4115, Unknown=0, NotChecked=0, Total=5112 [2024-11-13 14:58:04,404 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 65 mSDsluCounter, 4476 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 4686 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:58:04,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 4686 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 14:58:04,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-13 14:58:04,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2024-11-13 14:58:04,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 151 states have (on average 1.6622516556291391) internal successors, (251), 233 states have internal predecessors, (251), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:58:04,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 263 transitions. [2024-11-13 14:58:04,416 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 263 transitions. Word has length 128 [2024-11-13 14:58:04,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:58:04,417 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 263 transitions. [2024-11-13 14:58:04,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 38 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-13 14:58:04,417 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 263 transitions. [2024-11-13 14:58:04,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 14:58:04,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:58:04,422 INFO L215 NwaCegarLoop]: trace histogram [65, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:58:04,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 14:58:04,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:58:04,623 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-13 14:58:04,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:58:04,623 INFO L85 PathProgramCache]: Analyzing trace with hash -228173623, now seen corresponding path program 2 times [2024-11-13 14:58:04,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:58:04,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596330133] [2024-11-13 14:58:04,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:58:04,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:58:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:07,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:58:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:07,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:58:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:07,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 14:58:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:07,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-13 14:58:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:07,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 14:58:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:08,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:58:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:09,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 1044 proven. 163 refuted. 0 times theorem prover too weak. 1398 trivial. 0 not checked. [2024-11-13 14:58:09,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:58:09,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596330133] [2024-11-13 14:58:09,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596330133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:58:09,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045205256] [2024-11-13 14:58:09,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:58:09,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:58:09,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:58:09,104 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:58:09,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 14:58:13,846 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 14:58:13,847 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:58:13,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 1504 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-13 14:58:13,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:58:14,333 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 10 treesize of output 9 [2024-11-13 14:58:49,499 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2024-11-13 14:58:49,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:58:49,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 14:58:49,714 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:58:49,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 14:58:57,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 818 proven. 1057 refuted. 0 times theorem prover too weak. 513 trivial. 217 not checked. [2024-11-13 14:58:57,858 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:58:58,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045205256] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:58:58,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:58:58,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 35] total 59 [2024-11-13 14:58:58,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635957046] [2024-11-13 14:58:58,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:58:58,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-11-13 14:58:58,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:58:58,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-11-13 14:58:58,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=3465, Unknown=11, NotChecked=118, Total=3782 [2024-11-13 14:58:58,129 INFO L87 Difference]: Start difference. First operand 242 states and 263 transitions. Second operand has 60 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 54 states have internal predecessors, (95), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-13 14:59:02,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:59:07,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:59:11,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:59:15,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:59:20,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:59:24,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:59:28,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:59:33,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:59:37,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:59:41,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:59:45,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:59:52,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:52,934 INFO L93 Difference]: Finished difference Result 244 states and 266 transitions. [2024-11-13 14:59:52,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 14:59:52,935 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 54 states have internal predecessors, (95), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 138 [2024-11-13 14:59:52,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:52,938 INFO L225 Difference]: With dead ends: 244 [2024-11-13 14:59:52,938 INFO L226 Difference]: Without dead ends: 244 [2024-11-13 14:59:52,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 47.4s TimeCoverageRelationStatistics Valid=395, Invalid=5918, Unknown=11, NotChecked=156, Total=6480 [2024-11-13 14:59:52,940 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 35 mSDsluCounter, 4067 mSDsCounter, 0 mSdLazyCounter, 3571 mSolverCounterSat, 7 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 4255 SdHoareTripleChecker+Invalid, 3792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3571 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 203 IncrementalHoareTripleChecker+Unchecked, 51.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:59:52,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 4255 Invalid, 3792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3571 Invalid, 11 Unknown, 203 Unchecked, 51.2s Time] [2024-11-13 14:59:52,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-13 14:59:52,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 238. [2024-11-13 14:59:52,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 151 states have (on average 1.6357615894039734) internal successors, (247), 229 states have internal predecessors, (247), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:59:52,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 259 transitions. [2024-11-13 14:59:52,947 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 259 transitions. Word has length 138 [2024-11-13 14:59:52,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:52,948 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 259 transitions. [2024-11-13 14:59:52,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 54 states have internal predecessors, (95), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-13 14:59:52,948 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 259 transitions. [2024-11-13 14:59:52,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 14:59:52,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:52,950 INFO L215 NwaCegarLoop]: trace histogram [65, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:59:52,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 14:59:53,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-13 14:59:53,150 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-13 14:59:53,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:53,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1412823830, now seen corresponding path program 1 times [2024-11-13 14:59:53,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:59:53,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115377834] [2024-11-13 14:59:53,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:53,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:59:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:54,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:59:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:54,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:59:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:54,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 14:59:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:54,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-13 14:59:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:54,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 14:59:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:54,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:59:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:54,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 425 proven. 0 refuted. 0 times theorem prover too weak. 2180 trivial. 0 not checked. [2024-11-13 14:59:54,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:59:54,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115377834] [2024-11-13 14:59:54,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115377834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:59:54,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:59:54,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 14:59:54,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403314373] [2024-11-13 14:59:54,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:59:54,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 14:59:54,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:59:54,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 14:59:54,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:59:54,337 INFO L87 Difference]: Start difference. First operand 238 states and 259 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-13 14:59:55,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:55,331 INFO L93 Difference]: Finished difference Result 237 states and 258 transitions. [2024-11-13 14:59:55,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:59:55,332 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 141 [2024-11-13 14:59:55,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:55,334 INFO L225 Difference]: With dead ends: 237 [2024-11-13 14:59:55,334 INFO L226 Difference]: Without dead ends: 237 [2024-11-13 14:59:55,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:59:55,334 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 9 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:59:55,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1278 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 14:59:55,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-13 14:59:55,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2024-11-13 14:59:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 151 states have (on average 1.6291390728476822) internal successors, (246), 228 states have internal predecessors, (246), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 14:59:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 258 transitions. [2024-11-13 14:59:55,341 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 258 transitions. Word has length 141 [2024-11-13 14:59:55,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:55,342 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 258 transitions. [2024-11-13 14:59:55,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-13 14:59:55,342 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 258 transitions. [2024-11-13 14:59:55,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 14:59:55,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:55,344 INFO L215 NwaCegarLoop]: trace histogram [65, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:59:55,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 14:59:55,344 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-13 14:59:55,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:55,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1412823831, now seen corresponding path program 1 times [2024-11-13 14:59:55,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:59:55,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144141155] [2024-11-13 14:59:55,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:55,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:59:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:57,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:59:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:57,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:59:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:57,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 14:59:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:57,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-13 14:59:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:57,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 14:59:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:57,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:59:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:59:58,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 425 proven. 15 refuted. 0 times theorem prover too weak. 2165 trivial. 0 not checked. [2024-11-13 14:59:58,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:59:58,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144141155] [2024-11-13 14:59:58,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144141155] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:59:58,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113958426] [2024-11-13 14:59:58,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:59:58,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:59:58,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:59:58,131 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:59:58,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 15:00:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:00,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 1529 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-13 15:00:00,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:00:01,195 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 8 treesize of output 1 [2024-11-13 15:00:38,713 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 13 treesize of output 9 [2024-11-13 15:00:38,721 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 1 [2024-11-13 15:00:38,743 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 21 treesize of output 9 [2024-11-13 15:00:38,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 640 proven. 642 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2024-11-13 15:00:38,751 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:00:40,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 425 proven. 15 refuted. 0 times theorem prover too weak. 2165 trivial. 0 not checked. [2024-11-13 15:00:40,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113958426] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:00:40,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:00:40,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21, 15] total 41 [2024-11-13 15:00:40,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920468833] [2024-11-13 15:00:40,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:00:40,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-13 15:00:40,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:00:40,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-13 15:00:40,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1538, Unknown=9, NotChecked=0, Total=1722 [2024-11-13 15:00:40,873 INFO L87 Difference]: Start difference. First operand 237 states and 258 transitions. Second operand has 42 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 1 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-13 15:00:55,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:55,763 INFO L93 Difference]: Finished difference Result 236 states and 257 transitions. [2024-11-13 15:00:55,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 15:00:55,763 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 1 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 141 [2024-11-13 15:00:55,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:55,765 INFO L225 Difference]: With dead ends: 236 [2024-11-13 15:00:55,765 INFO L226 Difference]: Without dead ends: 236 [2024-11-13 15:00:55,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 51.9s TimeCoverageRelationStatistics Valid=256, Invalid=2084, Unknown=12, NotChecked=0, Total=2352 [2024-11-13 15:00:55,766 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 9 mSDsluCounter, 3373 mSDsCounter, 0 mSdLazyCounter, 1545 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3572 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:55,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3572 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1545 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-13 15:00:55,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-13 15:00:55,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2024-11-13 15:00:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 151 states have (on average 1.6225165562913908) internal successors, (245), 227 states have internal predecessors, (245), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 15:00:55,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 257 transitions. [2024-11-13 15:00:55,773 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 257 transitions. Word has length 141 [2024-11-13 15:00:55,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:55,774 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 257 transitions. [2024-11-13 15:00:55,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 1 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-13 15:00:55,774 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 257 transitions. [2024-11-13 15:00:55,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 15:00:55,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:55,775 INFO L215 NwaCegarLoop]: trace histogram [65, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:00:55,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 15:00:55,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:00:55,976 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-13 15:00:55,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:55,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1244747473, now seen corresponding path program 1 times [2024-11-13 15:00:55,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:00:55,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346620422] [2024-11-13 15:00:55,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:55,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:00:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:57,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 15:00:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:57,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:00:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:57,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 15:00:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:57,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-13 15:00:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:57,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 15:00:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:57,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 15:00:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:57,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 1311 proven. 261 refuted. 0 times theorem prover too weak. 1033 trivial. 0 not checked. [2024-11-13 15:00:57,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:00:57,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346620422] [2024-11-13 15:00:57,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346620422] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:00:57,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857100723] [2024-11-13 15:00:57,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:57,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:00:57,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:00:57,697 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:00:57,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 15:00:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:58,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 1562 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-13 15:00:58,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:00:58,579 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|))) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2024-11-13 15:00:58,763 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-13 15:00:58,763 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 16 [2024-11-13 15:00:58,951 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 15:00:58,951 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 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-13 15:00:58,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 19 treesize of output 1 [2024-11-13 15:00:59,041 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 13 [2024-11-13 15:00:59,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 1319 proven. 85 refuted. 0 times theorem prover too weak. 940 trivial. 261 not checked. [2024-11-13 15:00:59,100 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:00:59,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857100723] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:00:59,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:00:59,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18] total 22 [2024-11-13 15:00:59,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794587751] [2024-11-13 15:00:59,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:00:59,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 15:00:59,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:00:59,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 15:00:59,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=819, Unknown=1, NotChecked=58, Total=992 [2024-11-13 15:00:59,890 INFO L87 Difference]: Start difference. First operand 236 states and 257 transitions. Second operand has 23 states, 22 states have (on average 3.409090909090909) internal successors, (75), 19 states have internal predecessors, (75), 2 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-13 15:01:01,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:01,358 INFO L93 Difference]: Finished difference Result 232 states and 253 transitions. [2024-11-13 15:01:01,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:01:01,358 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.409090909090909) internal successors, (75), 19 states have internal predecessors, (75), 2 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 144 [2024-11-13 15:01:01,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:01,359 INFO L225 Difference]: With dead ends: 232 [2024-11-13 15:01:01,359 INFO L226 Difference]: Without dead ends: 232 [2024-11-13 15:01:01,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=168, Invalid=1095, Unknown=1, NotChecked=68, Total=1332 [2024-11-13 15:01:01,360 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 37 mSDsluCounter, 1771 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 196 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:01,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1948 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1410 Invalid, 0 Unknown, 196 Unchecked, 1.2s Time] [2024-11-13 15:01:01,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-13 15:01:01,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2024-11-13 15:01:01,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 151 states have (on average 1.596026490066225) internal successors, (241), 223 states have internal predecessors, (241), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 15:01:01,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 253 transitions. [2024-11-13 15:01:01,370 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 253 transitions. Word has length 144 [2024-11-13 15:01:01,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:01,372 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 253 transitions. [2024-11-13 15:01:01,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.409090909090909) internal successors, (75), 19 states have internal predecessors, (75), 2 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-13 15:01:01,372 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 253 transitions. [2024-11-13 15:01:01,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 15:01:01,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:01,374 INFO L215 NwaCegarLoop]: trace histogram [65, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:01:01,396 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 15:01:01,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:01:01,575 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-13 15:01:01,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:01,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1244747472, now seen corresponding path program 1 times [2024-11-13 15:01:01,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:01,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851767431] [2024-11-13 15:01:01,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:01,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:04,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 15:01:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:04,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:01:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:04,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 15:01:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:04,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-13 15:01:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:06,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 15:01:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:06,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 15:01:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:07,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 1311 proven. 424 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2024-11-13 15:01:07,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:07,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851767431] [2024-11-13 15:01:07,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851767431] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:01:07,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124360751] [2024-11-13 15:01:07,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:07,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:01:07,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:01:07,209 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:01:07,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 15:01:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:10,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 1562 conjuncts, 148 conjuncts are in the unsatisfiable core [2024-11-13 15:01:10,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:01:11,023 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 10 treesize of output 9 [2024-11-13 15:01:45,153 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 15:01:45,153 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 1 case distinctions, treesize of input 18 treesize of output 17 [2024-11-13 15:01:45,223 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 15:01:45,223 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 15:01:45,678 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2024-11-13 15:01:45,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:01:45,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2024-11-13 15:01:45,790 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-13 15:01:45,790 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 16 treesize of output 18 [2024-11-13 15:01:54,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 659 proven. 1376 refuted. 0 times theorem prover too weak. 268 trivial. 302 not checked. [2024-11-13 15:01:54,503 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:01:54,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124360751] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:01:54,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:01:54,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 44] total 77 [2024-11-13 15:01:54,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225490975] [2024-11-13 15:01:54,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:01:54,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2024-11-13 15:01:54,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:54,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2024-11-13 15:01:54,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=5865, Unknown=10, NotChecked=154, Total=6320 [2024-11-13 15:01:54,879 INFO L87 Difference]: Start difference. First operand 232 states and 253 transitions. Second operand has 78 states, 74 states have (on average 1.7162162162162162) internal successors, (127), 72 states have internal predecessors, (127), 5 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-13 15:02:00,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:02:04,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:02:08,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:02:13,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:02:17,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:02:21,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:02:25,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:02:30,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:02:34,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:02:38,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:02:43,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:02:57,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:02:57,646 INFO L93 Difference]: Finished difference Result 234 states and 256 transitions. [2024-11-13 15:02:57,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-13 15:02:57,647 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 74 states have (on average 1.7162162162162162) internal successors, (127), 72 states have internal predecessors, (127), 5 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 144 [2024-11-13 15:02:57,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:02:57,648 INFO L225 Difference]: With dead ends: 234 [2024-11-13 15:02:57,648 INFO L226 Difference]: Without dead ends: 234 [2024-11-13 15:02:57,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 115 SyntacticMatches, 3 SemanticMatches, 100 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2840 ImplicationChecksByTransitivity, 50.1s TimeCoverageRelationStatistics Valid=596, Invalid=9498, Unknown=10, NotChecked=198, Total=10302 [2024-11-13 15:02:57,651 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 110 mSDsluCounter, 5202 mSDsCounter, 0 mSdLazyCounter, 5010 mSolverCounterSat, 15 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 5375 SdHoareTripleChecker+Invalid, 5229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 5010 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 57.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:02:57,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 5375 Invalid, 5229 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [15 Valid, 5010 Invalid, 11 Unknown, 193 Unchecked, 57.2s Time] [2024-11-13 15:02:57,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-13 15:02:57,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 228. [2024-11-13 15:02:57,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 151 states have (on average 1.5695364238410596) internal successors, (237), 219 states have internal predecessors, (237), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 15:02:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 249 transitions. [2024-11-13 15:02:57,658 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 249 transitions. Word has length 144 [2024-11-13 15:02:57,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:02:57,658 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 249 transitions. [2024-11-13 15:02:57,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 74 states have (on average 1.7162162162162162) internal successors, (127), 72 states have internal predecessors, (127), 5 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-13 15:02:57,659 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 249 transitions. [2024-11-13 15:02:57,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 15:02:57,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:02:57,660 INFO L215 NwaCegarLoop]: trace histogram [65, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:02:57,712 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 15:02:57,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-13 15:02:57,861 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-13 15:02:57,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:02:57,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1173249793, now seen corresponding path program 1 times [2024-11-13 15:02:57,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:02:57,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223124971] [2024-11-13 15:02:57,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:57,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:02:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:59,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 15:02:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:59,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:02:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:59,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 15:02:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:00,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-13 15:03:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:00,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 15:03:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:00,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 15:03:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 1388 proven. 445 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2024-11-13 15:03:00,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:00,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223124971] [2024-11-13 15:03:00,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223124971] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:03:00,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317477741] [2024-11-13 15:03:00,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:00,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:03:00,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:03:00,873 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:03:00,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 15:03:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:01,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 1623 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-13 15:03:01,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:03:02,356 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_#t~ret10#1.base| .cse0)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from false [2024-11-13 15:03:02,362 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_#t~ret10#1.base| .cse0)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from true [2024-11-13 15:03:02,401 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from false [2024-11-13 15:03:02,407 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from true [2024-11-13 15:03:02,446 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse0)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from false [2024-11-13 15:03:02,451 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse0)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from true [2024-11-13 15:03:02,729 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_63| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_63| .cse1))) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from false [2024-11-13 15:03:02,736 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_63| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_63| .cse1))) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from true [2024-11-13 15:03:02,829 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_63| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_63| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1)))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |c_#valid| .cse2))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse2)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse3 (select |c_#valid| .cse3))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3))))) is different from false [2024-11-13 15:03:02,836 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_63| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_63| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1)))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |c_#valid| .cse2))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse2)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse3 (select |c_#valid| .cse3))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3))))) is different from true [2024-11-13 15:03:02,979 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2024-11-13 15:03:03,092 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-13 15:03:03,092 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 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-13 15:03:03,343 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_64| .cse0)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_63| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_63| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_63| .cse3 (select |v_old(#valid)_AFTER_CALL_64| .cse3)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) is different from false [2024-11-13 15:03:03,351 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_64| .cse0)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_63| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_63| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_63| .cse3 (select |v_old(#valid)_AFTER_CALL_64| .cse3)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) is different from true [2024-11-13 15:03:03,590 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_64| .cse0)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_63| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_63| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_63| .cse3 (select |v_old(#valid)_AFTER_CALL_64| .cse3)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) is different from false [2024-11-13 15:03:03,597 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_64| .cse0)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_63| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_63| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_63| .cse3 (select |v_old(#valid)_AFTER_CALL_64| .cse3)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) is different from true [2024-11-13 15:03:04,331 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_#valid_BEFORE_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse2 (select |v_old(#valid)_AFTER_CALL_64| .cse2)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse2) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_63|)) (.cse4 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_63| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |v_old(#valid)_AFTER_CALL_63| .cse3))) (= (store |v_old(#valid)_AFTER_CALL_63| .cse4 (select |v_old(#valid)_AFTER_CALL_64| .cse4)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |c_#valid| .cse4) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) is different from false [2024-11-13 15:03:04,344 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_#valid_BEFORE_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse2 (select |v_old(#valid)_AFTER_CALL_64| .cse2)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse2) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_63|)) (.cse4 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_63| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |v_old(#valid)_AFTER_CALL_63| .cse3))) (= (store |v_old(#valid)_AFTER_CALL_63| .cse4 (select |v_old(#valid)_AFTER_CALL_64| .cse4)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |c_#valid| .cse4) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) is different from true [2024-11-13 15:03:04,876 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1))) (.cse3 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_63|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_63| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_63| .cse0))) (= (select |c_#valid| .cse0) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse1) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse2 .cse3 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) (and .cse2 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_#valid_BEFORE_CALL_16| .cse4 (select |v_old(#valid)_AFTER_CALL_64| .cse4)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse4) 1))))) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse5 (select |v_old(#valid)_AFTER_CALL_64| .cse5)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse5) 1)))) .cse3))) is different from false [2024-11-13 15:03:04,883 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1))) (.cse3 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_63|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_63| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_63| .cse0))) (= (select |c_#valid| .cse0) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse1) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse2 .cse3 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) (and .cse2 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_#valid_BEFORE_CALL_16| .cse4 (select |v_old(#valid)_AFTER_CALL_64| .cse4)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse4) 1))))) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse5 (select |v_old(#valid)_AFTER_CALL_64| .cse5)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse5) 1)))) .cse3))) is different from true [2024-11-13 15:03:05,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 1235 proven. 355 refuted. 0 times theorem prover too weak. 763 trivial. 252 not checked. [2024-11-13 15:03:05,681 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:03:06,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317477741] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:03:06,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:03:06,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 33 [2024-11-13 15:03:06,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133639590] [2024-11-13 15:03:06,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:03:06,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-13 15:03:06,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:06,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-13 15:03:06,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=624, Unknown=19, NotChecked=590, Total=1332 [2024-11-13 15:03:06,202 INFO L87 Difference]: Start difference. First operand 228 states and 249 transitions. Second operand has 34 states, 31 states have (on average 3.096774193548387) internal successors, (96), 26 states have internal predecessors, (96), 6 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-13 15:03:07,217 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_#t~ret10#1.base| .cse0)))) .cse1) .cse1)) is different from false [2024-11-13 15:03:07,221 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~item~2#1.base|) 1) (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l3_insert_#t~ret10#1.base| .cse0)))) .cse1) .cse1)) is different from true [2024-11-13 15:03:07,227 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0) (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .cse0))) is different from false [2024-11-13 15:03:07,232 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0) (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .cse0))) is different from true [2024-11-13 15:03:07,238 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse0)))) .cse1) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse1))) is different from false [2024-11-13 15:03:07,242 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse0)))) .cse1) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse1))) is different from true [2024-11-13 15:03:07,269 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) .cse0) (or (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_63| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_63| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse4 (select |c_#valid| .cse4))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4)))) .cse0))) is different from false [2024-11-13 15:03:07,275 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) .cse0) (or (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_63| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_63| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse4 (select |c_#valid| .cse4))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4)))) .cse0))) is different from true [2024-11-13 15:03:07,320 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_63| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_63| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1)))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |c_#valid| .cse2))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse2)))) .cse3 (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse4 (select |c_#valid| .cse4))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4))))) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse3))) is different from false [2024-11-13 15:03:07,328 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_63| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_63| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1)))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |c_#valid| .cse2))) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse2)))) .cse3 (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_63| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_63| .cse4 (select |c_#valid| .cse4))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4))))) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse3))) is different from true [2024-11-13 15:03:07,527 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_64| .cse0)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_63| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_63| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_63| .cse3 (select |v_old(#valid)_AFTER_CALL_64| .cse3)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse4)) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse4))) is different from false [2024-11-13 15:03:07,534 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_64| .cse0)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_63| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_63| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_63| .cse3 (select |v_old(#valid)_AFTER_CALL_64| .cse3)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse4)) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse4))) is different from true [2024-11-13 15:03:07,594 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_64| .cse0)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_63| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_63| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_63| .cse3 (select |v_old(#valid)_AFTER_CALL_64| .cse3)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse4)) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse4))) is different from false [2024-11-13 15:03:07,601 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_64| .cse0)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_63|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_63| (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_63| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (store |v_old(#valid)_AFTER_CALL_63| .cse3 (select |v_old(#valid)_AFTER_CALL_64| .cse3)) |v_old(#valid)_AFTER_CALL_64|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse4)) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse4))) is different from true [2024-11-13 15:03:07,665 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (let ((.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_#valid_BEFORE_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse2 (select |v_old(#valid)_AFTER_CALL_64| .cse2)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse2) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_63|)) (.cse4 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_63| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |v_old(#valid)_AFTER_CALL_63| .cse3))) (= (store |v_old(#valid)_AFTER_CALL_63| .cse4 (select |v_old(#valid)_AFTER_CALL_64| .cse4)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |c_#valid| .cse4) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 .cse5))) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse5))) is different from false [2024-11-13 15:03:07,674 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (let ((.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_#valid_BEFORE_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse2 (select |v_old(#valid)_AFTER_CALL_64| .cse2)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse2) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_63|)) (.cse4 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_63| (store |v_#valid_BEFORE_CALL_16| .cse3 (select |v_old(#valid)_AFTER_CALL_63| .cse3))) (= (store |v_old(#valid)_AFTER_CALL_63| .cse4 (select |v_old(#valid)_AFTER_CALL_64| .cse4)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |c_#valid| .cse4) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 .cse5))) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse5))) is different from true [2024-11-13 15:03:07,829 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (let ((.cse2 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1))) (.cse3 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_63|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_63| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_63| .cse0))) (= (select |c_#valid| .cse0) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse1) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse2 .cse3 .cse4) (and .cse2 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_#valid_BEFORE_CALL_16| .cse5 (select |v_old(#valid)_AFTER_CALL_64| .cse5)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse5) 1))))) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse6 (select |v_old(#valid)_AFTER_CALL_64| .cse6)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse6) 1)))) .cse3))) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse4))) is different from false [2024-11-13 15:03:07,836 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (let ((.cse2 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1))) (.cse3 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_63|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_63| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_63| .cse0))) (= (select |c_#valid| .cse0) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse1) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse2 .cse3 .cse4) (and .cse2 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_#valid_BEFORE_CALL_16| .cse5 (select |v_old(#valid)_AFTER_CALL_64| .cse5)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse5) 1))))) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse6 (select |v_old(#valid)_AFTER_CALL_64| .cse6)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse6) 1)))) .cse3))) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse4))) is different from true [2024-11-13 15:03:07,928 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (let ((.cse2 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1))) (.cse3 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_63|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_63| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_63| .cse0))) (= (select |c_#valid| .cse0) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse1) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse2 .cse3 .cse4) (and .cse2 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_#valid_BEFORE_CALL_16| .cse5 (select |v_old(#valid)_AFTER_CALL_64| .cse5)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse5) 1))))) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse6 (select |v_old(#valid)_AFTER_CALL_64| .cse6)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse6) 1)))) .cse3))) .cse4)) is different from false [2024-11-13 15:03:07,935 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (let ((.cse2 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1))) (.cse3 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_63|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_63| (store |v_#valid_BEFORE_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_63| .cse0))) (= (select |c_#valid| .cse0) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse1 (select |v_old(#valid)_AFTER_CALL_64| .cse1)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse1) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse2 .cse3 .cse4) (and .cse2 (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_16| |v_old(#valid)_AFTER_CALL_64|))) (and (= (store |v_#valid_BEFORE_CALL_16| .cse5 (select |v_old(#valid)_AFTER_CALL_64| .cse5)) |v_old(#valid)_AFTER_CALL_64|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse5) 1))))) (and (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_63| |v_old(#valid)_AFTER_CALL_64|))) (and (= (select |v_old(#valid)_AFTER_CALL_63| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (store |v_old(#valid)_AFTER_CALL_63| .cse6 (select |v_old(#valid)_AFTER_CALL_64| .cse6)) |v_old(#valid)_AFTER_CALL_64|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_64| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse6) 1)))) .cse3))) .cse4)) is different from true [2024-11-13 15:03:11,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:11,355 INFO L93 Difference]: Finished difference Result 251 states and 278 transitions. [2024-11-13 15:03:11,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 15:03:11,356 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 3.096774193548387) internal successors, (96), 26 states have internal predecessors, (96), 6 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) Word has length 151 [2024-11-13 15:03:11,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:11,358 INFO L225 Difference]: With dead ends: 251 [2024-11-13 15:03:11,358 INFO L226 Difference]: Without dead ends: 251 [2024-11-13 15:03:11,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 163 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=154, Invalid=879, Unknown=39, NotChecked=1580, Total=2652 [2024-11-13 15:03:11,359 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 16 mSDsluCounter, 2075 mSDsCounter, 0 mSdLazyCounter, 1714 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 4507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2780 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:11,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2260 Invalid, 4507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1714 Invalid, 0 Unknown, 2780 Unchecked, 4.0s Time] [2024-11-13 15:03:11,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-13 15:03:11,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-11-13 15:03:11,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 172 states have (on average 1.5116279069767442) internal successors, (260), 239 states have internal predecessors, (260), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-13 15:03:11,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 278 transitions. [2024-11-13 15:03:11,367 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 278 transitions. Word has length 151 [2024-11-13 15:03:11,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:11,368 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 278 transitions. [2024-11-13 15:03:11,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 3.096774193548387) internal successors, (96), 26 states have internal predecessors, (96), 6 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-13 15:03:11,368 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 278 transitions. [2024-11-13 15:03:11,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 15:03:11,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:11,370 INFO L215 NwaCegarLoop]: trace histogram [65, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:03:11,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-13 15:03:11,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:03:11,570 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-13 15:03:11,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:11,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1173249794, now seen corresponding path program 1 times [2024-11-13 15:03:11,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:11,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125446260] [2024-11-13 15:03:11,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:11,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:15,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 15:03:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:15,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:03:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:15,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 15:03:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:17,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-13 15:03:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:17,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 15:03:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:19,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 15:03:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:19,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 1226 proven. 861 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2024-11-13 15:03:19,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:19,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125446260] [2024-11-13 15:03:19,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125446260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:03:19,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333899235] [2024-11-13 15:03:19,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:19,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:03:19,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:03:19,646 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:03:19,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 15:03:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:21,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 1623 conjuncts, 188 conjuncts are in the unsatisfiable core [2024-11-13 15:03:21,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:03:23,226 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 10 treesize of output 9 [2024-11-13 15:04:02,453 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 15:04:02,453 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 15:04:02,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 15:04:07,352 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-13 15:04:07,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2024-11-13 15:04:07,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 15:04:09,557 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-13 15:04:09,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-11-13 15:04:09,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2024-11-13 15:04:10,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 15:04:10,917 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 21 treesize of output 9 [2024-11-13 15:04:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 905 proven. 1455 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-13 15:04:16,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:04:17,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333899235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:04:17,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:04:17,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 63] total 97 [2024-11-13 15:04:17,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766234543] [2024-11-13 15:04:17,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:04:17,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2024-11-13 15:04:17,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:04:17,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2024-11-13 15:04:17,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=9473, Unknown=8, NotChecked=0, Total=9900 [2024-11-13 15:04:17,345 INFO L87 Difference]: Start difference. First operand 251 states and 278 transitions. Second operand has 98 states, 93 states have (on average 1.7204301075268817) internal successors, (160), 89 states have internal predecessors, (160), 6 states have call successors, (12), 3 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-13 15:04:21,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:04:26,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:04:31,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:04:35,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:04:40,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:04:44,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:04:49,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:04:53,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:04:57,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:05:02,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:05:06,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:05:11,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:05:29,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:05:29,953 INFO L93 Difference]: Finished difference Result 250 states and 277 transitions. [2024-11-13 15:05:29,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-13 15:05:29,954 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 93 states have (on average 1.7204301075268817) internal successors, (160), 89 states have internal predecessors, (160), 6 states have call successors, (12), 3 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) Word has length 151 [2024-11-13 15:05:29,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:05:29,955 INFO L225 Difference]: With dead ends: 250 [2024-11-13 15:05:29,955 INFO L226 Difference]: Without dead ends: 250 [2024-11-13 15:05:29,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4530 ImplicationChecksByTransitivity, 64.3s TimeCoverageRelationStatistics Valid=880, Invalid=15624, Unknown=8, NotChecked=0, Total=16512 [2024-11-13 15:05:29,959 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 148 mSDsluCounter, 4651 mSDsCounter, 0 mSdLazyCounter, 5454 mSolverCounterSat, 20 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 4809 SdHoareTripleChecker+Invalid, 5486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5454 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 63.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:05:29,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 4809 Invalid, 5486 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 5454 Invalid, 12 Unknown, 0 Unchecked, 63.4s Time] [2024-11-13 15:05:29,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-13 15:05:29,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 220. [2024-11-13 15:05:29,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 151 states have (on average 1.5165562913907285) internal successors, (229), 211 states have internal predecessors, (229), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 15:05:29,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 241 transitions. [2024-11-13 15:05:29,965 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 241 transitions. Word has length 151 [2024-11-13 15:05:29,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:05:29,965 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 241 transitions. [2024-11-13 15:05:29,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 93 states have (on average 1.7204301075268817) internal successors, (160), 89 states have internal predecessors, (160), 6 states have call successors, (12), 3 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-13 15:05:29,966 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 241 transitions. [2024-11-13 15:05:29,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-13 15:05:29,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:05:29,968 INFO L215 NwaCegarLoop]: trace histogram [65, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:05:29,997 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 15:05:30,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 15:05:30,168 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-13 15:05:30,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:05:30,169 INFO L85 PathProgramCache]: Analyzing trace with hash 2040368230, now seen corresponding path program 1 times [2024-11-13 15:05:30,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:05:30,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679018250] [2024-11-13 15:05:30,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:05:30,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:05:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:32,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 15:05:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:32,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:05:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:32,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 15:05:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:33,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-13 15:05:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:33,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 15:05:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:33,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 15:05:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:33,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 1032 proven. 625 refuted. 0 times theorem prover too weak. 948 trivial. 0 not checked. [2024-11-13 15:05:33,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:05:33,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679018250] [2024-11-13 15:05:33,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679018250] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:05:33,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908316379] [2024-11-13 15:05:33,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:05:33,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:05:33,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:05:33,635 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:05:33,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 15:05:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:34,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 1684 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-13 15:05:34,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:05:35,013 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2024-11-13 15:05:35,241 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 15:05:35,241 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 15:05:35,380 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|))) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2024-11-13 15:05:35,669 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-13 15:05:35,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-11-13 15:05:35,984 WARN L851 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_32| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|))))) is different from false [2024-11-13 15:05:36,051 WARN L873 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_32| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|))))) is different from true [2024-11-13 15:05:36,098 WARN L851 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_32| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))))) is different from false [2024-11-13 15:05:36,158 WARN L873 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_32| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))))) is different from true [2024-11-13 15:05:36,269 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2024-11-13 15:05:36,392 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2024-11-13 15:05:36,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 22 [2024-11-13 15:05:36,447 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_34| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_34| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_34|))) (and (= (select |v_#valid_BEFORE_CALL_32| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= |v_#valid_BEFORE_CALL_34| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |v_#valid_BEFORE_CALL_34| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)))))) (and (exists ((|v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|)) (= (select |c_#valid| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|) 1))) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) is different from false [2024-11-13 15:05:36,453 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_34| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_34| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_34|))) (and (= (select |v_#valid_BEFORE_CALL_32| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= |v_#valid_BEFORE_CALL_34| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |v_#valid_BEFORE_CALL_34| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)))))) (and (exists ((|v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|)) (= (select |c_#valid| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|) 1))) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) is different from true [2024-11-13 15:05:36,546 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_#valid_BEFORE_CALL_34| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_34| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_34|))) (and (= (select |v_#valid_BEFORE_CALL_32| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= |v_#valid_BEFORE_CALL_34| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |v_#valid_BEFORE_CALL_34| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)))))) (and (exists ((|v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|)) (= (select |c_#valid| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|) 1))) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) is different from false [2024-11-13 15:05:36,552 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_#valid_BEFORE_CALL_34| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_34| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_34|))) (and (= (select |v_#valid_BEFORE_CALL_32| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= |v_#valid_BEFORE_CALL_34| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |v_#valid_BEFORE_CALL_34| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)))))) (and (exists ((|v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|)) (= (select |c_#valid| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|) 1))) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) is different from true [2024-11-13 15:05:36,769 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_34| (Array Int Int)) (|v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_138| Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_34|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_34| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_138|)) (= |v_#valid_BEFORE_CALL_34| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |v_#valid_BEFORE_CALL_34| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_138|) 1) (= (select |c_#valid| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (and (exists ((|v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|)) (= (select |c_#valid| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|) 1))) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) is different from false [2024-11-13 15:05:36,774 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_34| (Array Int Int)) (|v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_138| Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_34|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_34| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_138|)) (= |v_#valid_BEFORE_CALL_34| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |v_#valid_BEFORE_CALL_34| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_138|) 1) (= (select |c_#valid| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (and (exists ((|v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|)) (= (select |c_#valid| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|) 1))) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) is different from true [2024-11-13 15:05:37,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 797 proven. 181 refuted. 0 times theorem prover too weak. 412 trivial. 1215 not checked. [2024-11-13 15:05:37,919 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:05:38,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908316379] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:05:38,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:05:38,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 35 [2024-11-13 15:05:38,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379681912] [2024-11-13 15:05:38,298 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:05:38,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-13 15:05:38,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:05:38,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-13 15:05:38,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=772, Unknown=13, NotChecked=504, Total=1406 [2024-11-13 15:05:38,300 INFO L87 Difference]: Start difference. First operand 220 states and 241 transitions. Second operand has 36 states, 34 states have (on average 3.823529411764706) internal successors, (130), 28 states have internal predecessors, (130), 7 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-13 15:05:39,711 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)) (.cse1 (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1))))) (and (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~item~3#1.base|) 1) .cse0 (or (and .cse0 .cse1) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_32| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1) (= .cse2 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse2 (select |c_#valid| .cse2))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|))))) .cse1)) is different from false [2024-11-13 15:05:39,716 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)) (.cse1 (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1))))) (and (= (select |c_#valid| |c_ULTIMATE.start_l1_insert_~item~3#1.base|) 1) .cse0 (or (and .cse0 .cse1) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_32| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1) (= .cse2 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse2 (select |c_#valid| .cse2))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|))))) .cse1)) is different from true [2024-11-13 15:05:39,722 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0) (or (and .cse0 (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_32| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))))))) is different from false [2024-11-13 15:05:39,727 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0) (or (and .cse0 (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_32| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_32| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))))))))) is different from true [2024-11-13 15:05:39,733 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_34| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_34| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_34|))) (and (= (select |v_#valid_BEFORE_CALL_32| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= |v_#valid_BEFORE_CALL_34| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |v_#valid_BEFORE_CALL_34| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)))))) (and (exists ((|v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|)) (= (select |c_#valid| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|) 1))) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1)) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse1))) is different from false [2024-11-13 15:05:39,738 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_34| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_34| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_34|))) (and (= (select |v_#valid_BEFORE_CALL_32| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= |v_#valid_BEFORE_CALL_34| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |v_#valid_BEFORE_CALL_34| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)))))) (and (exists ((|v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|)) (= (select |c_#valid| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|) 1))) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1)) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse1))) is different from true [2024-11-13 15:05:39,744 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_#valid_BEFORE_CALL_34| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_34| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_34|))) (and (= (select |v_#valid_BEFORE_CALL_32| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= |v_#valid_BEFORE_CALL_34| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |v_#valid_BEFORE_CALL_34| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)))))) (and (exists ((|v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|)) (= (select |c_#valid| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|) 1))) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1)) (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse1))) is different from false [2024-11-13 15:05:39,749 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_#valid_BEFORE_CALL_34| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_34| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_34|))) (and (= (select |v_#valid_BEFORE_CALL_32| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= |v_#valid_BEFORE_CALL_34| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |v_#valid_BEFORE_CALL_34| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)))))) (and (exists ((|v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|)) (= (select |c_#valid| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|) 1))) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1)) (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse1))) is different from true [2024-11-13 15:05:39,755 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_34| (Array Int Int)) (|v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_138| Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_34|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_34| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_138|)) (= |v_#valid_BEFORE_CALL_34| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |v_#valid_BEFORE_CALL_34| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_138|) 1) (= (select |c_#valid| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (and (exists ((|v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|)) (= (select |c_#valid| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|) 1))) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) .cse1)) (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse1))) is different from false [2024-11-13 15:05:39,759 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_34| (Array Int Int)) (|v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_138| Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_34|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_34| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_138|)) (= |v_#valid_BEFORE_CALL_34| (store |v_#valid_BEFORE_CALL_32| .cse0 (select |v_#valid_BEFORE_CALL_34| .cse0))) (= (select |v_#valid_BEFORE_CALL_32| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_138|) 1) (= (select |c_#valid| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (and (exists ((|v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|)) (= (select |c_#valid| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|) 1))) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) .cse1)) (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse1))) is different from true [2024-11-13 15:05:39,766 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) .cse0) (or (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_34| (Array Int Int)) (|v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_138| Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_34|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_34| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_138|)) (= |v_#valid_BEFORE_CALL_34| (store |v_#valid_BEFORE_CALL_32| .cse1 (select |v_#valid_BEFORE_CALL_34| .cse1))) (= (select |v_#valid_BEFORE_CALL_32| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_138|) 1) (= (select |c_#valid| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (and (exists ((|v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|)) (= (select |c_#valid| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|) 1))) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) .cse0)))) is different from false [2024-11-13 15:05:39,771 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l2_insert_~item~2#1.base| |c_ULTIMATE.start_l2_insert_~list#1.base|) .cse0) (or (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_34| (Array Int Int)) (|v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_138| Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_34|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_34| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_138|)) (= |v_#valid_BEFORE_CALL_34| (store |v_#valid_BEFORE_CALL_32| .cse1 (select |v_#valid_BEFORE_CALL_34| .cse1))) (= (select |v_#valid_BEFORE_CALL_32| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_138|) 1) (= (select |c_#valid| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (and (exists ((|v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|)) (= (select |c_#valid| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|) 1))) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) .cse0)))) is different from true [2024-11-13 15:05:39,784 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and .cse0 (or (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_34| (Array Int Int)) (|v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_138| Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_34|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_34| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_138|)) (= |v_#valid_BEFORE_CALL_34| (store |v_#valid_BEFORE_CALL_32| .cse1 (select |v_#valid_BEFORE_CALL_34| .cse1))) (= (select |v_#valid_BEFORE_CALL_32| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_138|) 1) (= (select |c_#valid| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (and (exists ((|v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|)) (= (select |c_#valid| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|) 1))) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) .cse0)))) is different from false [2024-11-13 15:05:39,789 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1))) (and .cse0 (or (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_34| (Array Int Int)) (|v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_138| Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_32| |v_#valid_BEFORE_CALL_34|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_34| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_138|)) (= |v_#valid_BEFORE_CALL_34| (store |v_#valid_BEFORE_CALL_32| .cse1 (select |v_#valid_BEFORE_CALL_34| .cse1))) (= (select |v_#valid_BEFORE_CALL_32| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_138|) 1) (= (select |c_#valid| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_l2_insert_~list#1.base|) 1)))) (and (exists ((|v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121| Int)) (and (not (= |c_ULTIMATE.start_l2_insert_~list#1.base| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|)) (= (select |c_#valid| |v_zalloc_or_die_#Ultimate.C_memset_#ptr#1.base_121|) 1))) (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) .cse0)))) is different from true [2024-11-13 15:05:42,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:05:42,807 INFO L93 Difference]: Finished difference Result 253 states and 282 transitions. [2024-11-13 15:05:42,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 15:05:42,808 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 3.823529411764706) internal successors, (130), 28 states have internal predecessors, (130), 7 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) Word has length 158 [2024-11-13 15:05:42,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:05:42,809 INFO L225 Difference]: With dead ends: 253 [2024-11-13 15:05:42,809 INFO L226 Difference]: Without dead ends: 253 [2024-11-13 15:05:42,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=182, Invalid=1111, Unknown=27, NotChecked=1230, Total=2550 [2024-11-13 15:05:42,810 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 20 mSDsluCounter, 1976 mSDsCounter, 0 mSdLazyCounter, 1689 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2151 SdHoareTripleChecker+Invalid, 4237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2529 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:05:42,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2151 Invalid, 4237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1689 Invalid, 0 Unknown, 2529 Unchecked, 3.7s Time] [2024-11-13 15:05:42,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-13 15:05:42,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2024-11-13 15:05:42,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 181 states have (on average 1.4475138121546962) internal successors, (262), 240 states have internal predecessors, (262), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-13 15:05:42,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 282 transitions. [2024-11-13 15:05:42,819 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 282 transitions. Word has length 158 [2024-11-13 15:05:42,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:05:42,819 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 282 transitions. [2024-11-13 15:05:42,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 3.823529411764706) internal successors, (130), 28 states have internal predecessors, (130), 7 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-13 15:05:42,820 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 282 transitions. [2024-11-13 15:05:42,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-13 15:05:42,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:05:42,821 INFO L215 NwaCegarLoop]: trace histogram [65, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:05:42,848 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 15:05:43,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-13 15:05:43,022 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-13 15:05:43,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:05:43,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2040368231, now seen corresponding path program 1 times [2024-11-13 15:05:43,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:05:43,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522684451] [2024-11-13 15:05:43,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:05:43,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:05:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:46,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 15:05:46,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:46,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:05:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:48,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 15:05:48,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:48,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-13 15:05:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:49,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 15:05:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:50,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 15:05:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:50,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 789 proven. 1298 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2024-11-13 15:05:50,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:05:50,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522684451] [2024-11-13 15:05:50,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522684451] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:05:50,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964658875] [2024-11-13 15:05:50,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:05:50,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:05:50,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:05:50,703 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:05:50,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b0d621-05da-4bc3-a31d-7c86b0be74e0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 15:05:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:53,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 1684 conjuncts, 176 conjuncts are in the unsatisfiable core [2024-11-13 15:05:53,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:05:54,993 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 10 treesize of output 9 [2024-11-13 15:06:36,709 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|) (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2024-11-13 15:06:37,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:06:37,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 15:06:37,097 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 15:06:37,098 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 15:06:37,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:06:37,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2024-11-13 15:06:38,089 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-13 15:06:38,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2024-11-13 15:06:38,707 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2024-11-13 15:06:42,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:06:42,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2024-11-13 15:06:42,322 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-13 15:06:42,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-11-13 15:07:04,756 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 15:07:04,756 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 1 case distinctions, treesize of input 18 treesize of output 17 [2024-11-13 15:07:05,357 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 1 [2024-11-13 15:07:05,363 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 1 [2024-11-13 15:07:06,009 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 37 treesize of output 25 [2024-11-13 15:07:06,015 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 7 [2024-11-13 15:07:07,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 181 proven. 819 refuted. 0 times theorem prover too weak. 353 trivial. 1252 not checked. [2024-11-13 15:07:07,256 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:07:46,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964658875] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:07:46,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:07:46,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 60] total 95 [2024-11-13 15:07:46,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077634093] [2024-11-13 15:07:46,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:07:46,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2024-11-13 15:07:46,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:07:46,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2024-11-13 15:07:46,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=10308, Unknown=16, NotChecked=410, Total=11130 [2024-11-13 15:07:46,026 INFO L87 Difference]: Start difference. First operand 253 states and 282 transitions. Second operand has 96 states, 93 states have (on average 2.021505376344086) internal successors, (188), 88 states have internal predecessors, (188), 7 states have call successors, (12), 4 states have call predecessors, (12), 9 states have return successors, (11), 10 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-13 15:07:50,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:07:56,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:08:01,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:08:05,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:08:10,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:08:16,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:08:20,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0]