./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB --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 c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:14:41,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:14:41,221 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 05:14:41,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:14:41,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:14:41,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:14:41,282 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:14:41,282 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:14:41,283 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:14:41,283 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:14:41,283 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:14:41,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:14:41,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:14:41,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:14:41,285 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:14:41,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:14:41,287 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:14:41,287 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:14:41,287 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:14:41,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:14:41,287 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 05:14:41,288 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 05:14:41,288 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 05:14:41,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:14:41,288 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 05:14:41,289 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 05:14:41,289 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:14:41,289 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:14:41,289 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:14:41,289 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:14:41,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:14:41,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:14:41,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:14:41,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:14:41,290 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:14:41,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:14:41,290 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:14:41,290 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:14:41,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:14:41,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:14:41,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:14:41,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 05:14:41,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 05:14:41,290 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:14:41,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:14:41,292 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:14:41,292 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:14:41,292 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_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB 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 -> c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 [2024-11-28 05:14:41,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:14:41,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:14:41,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:14:41,684 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:14:41,686 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:14:41,687 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-simple/dll2n_update_all.i [2024-11-28 05:14:45,140 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/data/812e1294c/e83dd3ea7c6946ce90247b633f0337d9/FLAG3bb4be91c [2024-11-28 05:14:45,652 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:14:45,653 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/sv-benchmarks/c/list-simple/dll2n_update_all.i [2024-11-28 05:14:45,675 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/data/812e1294c/e83dd3ea7c6946ce90247b633f0337d9/FLAG3bb4be91c [2024-11-28 05:14:45,724 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/data/812e1294c/e83dd3ea7c6946ce90247b633f0337d9 [2024-11-28 05:14:45,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:14:45,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:14:45,732 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:14:45,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:14:45,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:14:45,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:14:45" (1/1) ... [2024-11-28 05:14:45,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38b9d003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:14:45, skipping insertion in model container [2024-11-28 05:14:45,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:14:45" (1/1) ... [2024-11-28 05:14:45,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:14:46,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:14:46,211 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:14:46,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:14:46,296 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:14:46,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:14:46 WrapperNode [2024-11-28 05:14:46,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:14:46,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:14:46,298 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:14:46,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:14:46,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:14:46" (1/1) ... [2024-11-28 05:14:46,318 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:14:46" (1/1) ... [2024-11-28 05:14:46,341 INFO L138 Inliner]: procedures = 126, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 114 [2024-11-28 05:14:46,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:14:46,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:14:46,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:14:46,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:14:46,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:14:46" (1/1) ... [2024-11-28 05:14:46,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:14:46" (1/1) ... [2024-11-28 05:14:46,357 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:14:46" (1/1) ... [2024-11-28 05:14:46,376 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-28 05:14:46,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:14:46" (1/1) ... [2024-11-28 05:14:46,377 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:14:46" (1/1) ... [2024-11-28 05:14:46,386 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:14:46" (1/1) ... [2024-11-28 05:14:46,387 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:14:46" (1/1) ... [2024-11-28 05:14:46,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:14:46" (1/1) ... [2024-11-28 05:14:46,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:14:46" (1/1) ... [2024-11-28 05:14:46,394 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:14:46" (1/1) ... [2024-11-28 05:14:46,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:14:46,398 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:14:46,399 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:14:46,399 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:14:46,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:14:46" (1/1) ... [2024-11-28 05:14:46,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:14:46,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:14:46,450 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:14:46,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:14:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-28 05:14:46,486 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-28 05:14:46,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 05:14:46,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 05:14:46,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 05:14:46,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 05:14:46,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 05:14:46,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:14:46,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 05:14:46,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 05:14:46,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 05:14:46,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 05:14:46,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 05:14:46,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 05:14:46,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 05:14:46,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:14:46,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:14:46,631 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:14:46,634 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:14:46,662 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-28 05:14:47,027 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-28 05:14:47,027 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:14:47,045 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:14:47,045 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-28 05:14:47,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:14:47 BoogieIcfgContainer [2024-11-28 05:14:47,046 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:14:47,050 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:14:47,051 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:14:47,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:14:47,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:14:45" (1/3) ... [2024-11-28 05:14:47,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e89f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:14:47, skipping insertion in model container [2024-11-28 05:14:47,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:14:46" (2/3) ... [2024-11-28 05:14:47,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e89f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:14:47, skipping insertion in model container [2024-11-28 05:14:47,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:14:47" (3/3) ... [2024-11-28 05:14:47,059 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2024-11-28 05:14:47,074 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:14:47,075 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_update_all.i that has 2 procedures, 72 locations, 1 initial locations, 6 loop locations, and 23 error locations. [2024-11-28 05:14:47,125 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:14:47,144 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;@69a2b79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:14:47,145 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-11-28 05:14:47,150 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 69 states have internal predecessors, (85), 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-28 05:14:47,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 05:14:47,158 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:14:47,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 05:14:47,160 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:14:47,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:47,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1037518442, now seen corresponding path program 1 times [2024-11-28 05:14:47,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:47,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843980797] [2024-11-28 05:14:47,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:47,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:47,481 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-28 05:14:47,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:47,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843980797] [2024-11-28 05:14:47,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843980797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:47,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:47,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:14:47,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478753034] [2024-11-28 05:14:47,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:47,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:14:47,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:47,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:14:47,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:14:47,529 INFO L87 Difference]: Start difference. First operand has 71 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 69 states have internal predecessors, (85), 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) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-28 05:14:47,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:14:47,659 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2024-11-28 05:14:47,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:14:47,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-28 05:14:47,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:14:47,671 INFO L225 Difference]: With dead ends: 67 [2024-11-28 05:14:47,671 INFO L226 Difference]: Without dead ends: 62 [2024-11-28 05:14:47,673 INFO L434 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-28 05:14:47,676 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 9 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:14:47,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 104 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:14:47,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-28 05:14:47,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-28 05:14:47,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.619047619047619) internal successors, (68), 61 states have internal predecessors, (68), 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-28 05:14:47,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2024-11-28 05:14:47,713 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 6 [2024-11-28 05:14:47,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:14:47,714 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2024-11-28 05:14:47,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-28 05:14:47,716 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2024-11-28 05:14:47,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 05:14:47,716 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:14:47,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 05:14:47,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 05:14:47,718 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:14:47,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:47,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1037518443, now seen corresponding path program 1 times [2024-11-28 05:14:47,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:47,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513778756] [2024-11-28 05:14:47,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:47,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:47,887 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-28 05:14:47,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:47,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513778756] [2024-11-28 05:14:47,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513778756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:47,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:47,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:14:47,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819824585] [2024-11-28 05:14:47,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:47,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:14:47,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:47,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:14:47,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:14:47,893 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-28 05:14:48,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:14:48,005 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2024-11-28 05:14:48,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:14:48,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-28 05:14:48,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:14:48,006 INFO L225 Difference]: With dead ends: 59 [2024-11-28 05:14:48,007 INFO L226 Difference]: Without dead ends: 59 [2024-11-28 05:14:48,007 INFO L434 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-28 05:14:48,008 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 8 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:14:48,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 99 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:14:48,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-28 05:14:48,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-28 05:14:48,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 58 states have internal predecessors, (65), 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-28 05:14:48,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2024-11-28 05:14:48,019 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 6 [2024-11-28 05:14:48,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:14:48,020 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-11-28 05:14:48,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-28 05:14:48,020 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2024-11-28 05:14:48,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 05:14:48,020 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:14:48,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:48,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 05:14:48,021 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:14:48,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:48,021 INFO L85 PathProgramCache]: Analyzing trace with hash 491092471, now seen corresponding path program 1 times [2024-11-28 05:14:48,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:48,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007801876] [2024-11-28 05:14:48,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:48,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:48,128 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-28 05:14:48,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:48,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007801876] [2024-11-28 05:14:48,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007801876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:48,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:48,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:14:48,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987862734] [2024-11-28 05:14:48,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:48,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:14:48,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:48,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:14:48,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:14:48,133 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-28 05:14:48,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:14:48,154 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2024-11-28 05:14:48,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:14:48,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-11-28 05:14:48,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:14:48,155 INFO L225 Difference]: With dead ends: 70 [2024-11-28 05:14:48,155 INFO L226 Difference]: Without dead ends: 70 [2024-11-28 05:14:48,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-28 05:14:48,156 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 11 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:14:48,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 123 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:14:48,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-28 05:14:48,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2024-11-28 05:14:48,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 59 states have internal predecessors, (66), 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-28 05:14:48,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2024-11-28 05:14:48,171 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 9 [2024-11-28 05:14:48,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:14:48,172 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2024-11-28 05:14:48,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-28 05:14:48,172 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2024-11-28 05:14:48,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 05:14:48,173 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:14:48,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:48,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 05:14:48,173 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:14:48,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:48,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1519983918, now seen corresponding path program 1 times [2024-11-28 05:14:48,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:48,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206507769] [2024-11-28 05:14:48,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:48,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:48,271 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-28 05:14:48,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:48,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206507769] [2024-11-28 05:14:48,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206507769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:48,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:48,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:14:48,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630647376] [2024-11-28 05:14:48,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:48,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:14:48,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:48,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:14:48,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:14:48,273 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-28 05:14:48,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:14:48,299 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2024-11-28 05:14:48,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:14:48,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2024-11-28 05:14:48,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:14:48,301 INFO L225 Difference]: With dead ends: 66 [2024-11-28 05:14:48,301 INFO L226 Difference]: Without dead ends: 66 [2024-11-28 05:14:48,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-28 05:14:48,301 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:14:48,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:14:48,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-28 05:14:48,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-28 05:14:48,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.469387755102041) internal successors, (72), 65 states have internal predecessors, (72), 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-28 05:14:48,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2024-11-28 05:14:48,306 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 10 [2024-11-28 05:14:48,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:14:48,306 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2024-11-28 05:14:48,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-28 05:14:48,307 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2024-11-28 05:14:48,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 05:14:48,307 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:14:48,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:48,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 05:14:48,308 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:14:48,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:48,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1123286484, now seen corresponding path program 1 times [2024-11-28 05:14:48,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:48,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274079990] [2024-11-28 05:14:48,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:48,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:48,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:14:48,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:48,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274079990] [2024-11-28 05:14:48,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274079990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:14:48,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605051319] [2024-11-28 05:14:48,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:48,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:14:48,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:14:48,470 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:14:48,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 05:14:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:48,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 05:14:48,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:14:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:14:48,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:14:48,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:14:48,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605051319] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:14:48,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:14:48,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-28 05:14:48,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784539418] [2024-11-28 05:14:48,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:14:48,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:14:48,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:48,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:14:48,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:14:48,676 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-28 05:14:48,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:14:48,711 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2024-11-28 05:14:48,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:14:48,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 17 [2024-11-28 05:14:48,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:14:48,713 INFO L225 Difference]: With dead ends: 68 [2024-11-28 05:14:48,713 INFO L226 Difference]: Without dead ends: 68 [2024-11-28 05:14:48,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:14:48,715 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 11 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:14:48,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 133 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:14:48,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-28 05:14:48,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-28 05:14:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 67 states have internal predecessors, (74), 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-28 05:14:48,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2024-11-28 05:14:48,730 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 17 [2024-11-28 05:14:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:14:48,730 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2024-11-28 05:14:48,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-28 05:14:48,730 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2024-11-28 05:14:48,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-28 05:14:48,731 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:14:48,731 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:48,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 05:14:48,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:14:48,932 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:14:48,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:48,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1281123431, now seen corresponding path program 1 times [2024-11-28 05:14:48,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:48,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039519135] [2024-11-28 05:14:48,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:48,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:49,245 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:14:49,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:49,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039519135] [2024-11-28 05:14:49,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039519135] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:14:49,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293808319] [2024-11-28 05:14:49,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:49,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:14:49,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:14:49,251 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:14:49,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 05:14:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:49,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 05:14:49,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:14:49,435 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-28 05:14:49,490 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 05:14:49,490 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-28 05:14:49,532 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:14:49,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:14:49,601 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:14:49,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293808319] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:14:49,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:14:49,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-28 05:14:49,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127596635] [2024-11-28 05:14:49,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:14:49,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:14:49,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:49,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:14:49,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:14:49,606 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-28 05:14:49,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:14:49,753 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2024-11-28 05:14:49,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:14:49,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 18 [2024-11-28 05:14:49,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:14:49,754 INFO L225 Difference]: With dead ends: 67 [2024-11-28 05:14:49,754 INFO L226 Difference]: Without dead ends: 67 [2024-11-28 05:14:49,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:14:49,755 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 4 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:14:49,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 166 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:14:49,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-28 05:14:49,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-28 05:14:49,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 66 states have internal predecessors, (73), 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-28 05:14:49,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2024-11-28 05:14:49,764 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 18 [2024-11-28 05:14:49,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:14:49,764 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2024-11-28 05:14:49,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-28 05:14:49,764 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2024-11-28 05:14:49,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-28 05:14:49,765 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:14:49,765 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:49,778 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 05:14:49,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-28 05:14:49,966 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:14:49,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:49,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1281123430, now seen corresponding path program 1 times [2024-11-28 05:14:49,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:49,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545387171] [2024-11-28 05:14:49,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:49,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:50,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:14:50,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:50,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545387171] [2024-11-28 05:14:50,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545387171] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:14:50,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275463099] [2024-11-28 05:14:50,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:50,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:14:50,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:14:50,299 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:14:50,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 05:14:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:50,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-28 05:14:50,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:14:50,450 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-28 05:14:50,457 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-28 05:14:50,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:14:50,574 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 14 treesize of output 9 [2024-11-28 05:14:50,589 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:14:50,590 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-28 05:14:50,637 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:14:50,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:14:51,114 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:14:51,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275463099] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:14:51,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:14:51,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2024-11-28 05:14:51,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262707985] [2024-11-28 05:14:51,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:14:51,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 05:14:51,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:51,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 05:14:51,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:14:51,117 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 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-28 05:14:51,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:14:51,336 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2024-11-28 05:14:51,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:14:51,337 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 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 18 [2024-11-28 05:14:51,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:14:51,337 INFO L225 Difference]: With dead ends: 66 [2024-11-28 05:14:51,337 INFO L226 Difference]: Without dead ends: 66 [2024-11-28 05:14:51,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-28 05:14:51,338 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 10 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:14:51,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 280 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:14:51,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-28 05:14:51,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-28 05:14:51,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.411764705882353) internal successors, (72), 65 states have internal predecessors, (72), 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-28 05:14:51,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2024-11-28 05:14:51,344 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 18 [2024-11-28 05:14:51,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:14:51,344 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2024-11-28 05:14:51,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 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-28 05:14:51,345 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2024-11-28 05:14:51,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-28 05:14:51,345 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:14:51,346 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:51,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 05:14:51,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:14:51,550 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:14:51,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:51,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1140163937, now seen corresponding path program 2 times [2024-11-28 05:14:51,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:51,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802952870] [2024-11-28 05:14:51,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:14:51,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:51,575 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 05:14:51,575 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:14:51,609 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 05:14:51,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:51,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802952870] [2024-11-28 05:14:51,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802952870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:51,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:51,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:14:51,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556673167] [2024-11-28 05:14:51,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:51,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:14:51,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:51,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:14:51,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:14:51,611 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-28 05:14:51,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:14:51,660 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2024-11-28 05:14:51,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:14:51,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 25 [2024-11-28 05:14:51,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:14:51,661 INFO L225 Difference]: With dead ends: 90 [2024-11-28 05:14:51,661 INFO L226 Difference]: Without dead ends: 90 [2024-11-28 05:14:51,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-28 05:14:51,662 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 22 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:14:51,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 158 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:14:51,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-28 05:14:51,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 69. [2024-11-28 05:14:51,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 68 states have internal predecessors, (76), 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-28 05:14:51,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2024-11-28 05:14:51,668 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 25 [2024-11-28 05:14:51,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:14:51,668 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2024-11-28 05:14:51,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-28 05:14:51,669 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2024-11-28 05:14:51,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-28 05:14:51,669 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:14:51,669 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:51,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 05:14:51,670 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:14:51,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:51,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1140164006, now seen corresponding path program 1 times [2024-11-28 05:14:51,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:51,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034352529] [2024-11-28 05:14:51,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:51,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:51,789 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:14:51,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:51,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034352529] [2024-11-28 05:14:51,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034352529] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:14:51,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204063428] [2024-11-28 05:14:51,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:51,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:14:51,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:14:51,793 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:14:51,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 05:14:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:51,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 05:14:51,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:14:51,971 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:14:51,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:14:51,999 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:14:51,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204063428] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:14:51,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:14:51,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-28 05:14:51,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418095995] [2024-11-28 05:14:52,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:14:52,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:14:52,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:52,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:14:52,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:14:52,001 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-28 05:14:52,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:14:52,043 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2024-11-28 05:14:52,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:14:52,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2024-11-28 05:14:52,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:14:52,044 INFO L225 Difference]: With dead ends: 69 [2024-11-28 05:14:52,044 INFO L226 Difference]: Without dead ends: 69 [2024-11-28 05:14:52,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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-28 05:14:52,045 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 4 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:14:52,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 160 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:14:52,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-28 05:14:52,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-28 05:14:52,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 68 states have internal predecessors, (75), 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-28 05:14:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2024-11-28 05:14:52,050 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 25 [2024-11-28 05:14:52,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:14:52,050 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2024-11-28 05:14:52,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-28 05:14:52,050 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2024-11-28 05:14:52,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 05:14:52,051 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:14:52,051 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:52,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 05:14:52,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:14:52,252 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:14:52,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:52,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1211453172, now seen corresponding path program 1 times [2024-11-28 05:14:52,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:52,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255040608] [2024-11-28 05:14:52,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:52,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:52,476 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 05:14:52,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:52,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255040608] [2024-11-28 05:14:52,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255040608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:52,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:52,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 05:14:52,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600171588] [2024-11-28 05:14:52,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:52,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:14:52,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:52,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:14:52,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:14:52,478 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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-28 05:14:52,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:14:52,650 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2024-11-28 05:14:52,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:14:52,651 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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 26 [2024-11-28 05:14:52,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:14:52,652 INFO L225 Difference]: With dead ends: 72 [2024-11-28 05:14:52,656 INFO L226 Difference]: Without dead ends: 72 [2024-11-28 05:14:52,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:14:52,656 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 47 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:14:52,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 185 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:14:52,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-28 05:14:52,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-28 05:14:52,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 71 states have internal predecessors, (81), 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-28 05:14:52,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2024-11-28 05:14:52,664 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 26 [2024-11-28 05:14:52,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:14:52,664 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2024-11-28 05:14:52,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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-28 05:14:52,664 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2024-11-28 05:14:52,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 05:14:52,665 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:14:52,665 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:52,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 05:14:52,665 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:14:52,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:52,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1211453171, now seen corresponding path program 1 times [2024-11-28 05:14:52,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:52,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158236952] [2024-11-28 05:14:52,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:52,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:53,024 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:14:53,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:53,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158236952] [2024-11-28 05:14:53,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158236952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:53,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:53,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 05:14:53,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979645960] [2024-11-28 05:14:53,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:53,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:14:53,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:53,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:14:53,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:14:53,026 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 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-28 05:14:53,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:14:53,194 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2024-11-28 05:14:53,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:14:53,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 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 26 [2024-11-28 05:14:53,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:14:53,195 INFO L225 Difference]: With dead ends: 72 [2024-11-28 05:14:53,195 INFO L226 Difference]: Without dead ends: 72 [2024-11-28 05:14:53,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:14:53,196 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 44 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:14:53,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 209 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:14:53,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-28 05:14:53,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-28 05:14:53,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 71 states have internal predecessors, (79), 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-28 05:14:53,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2024-11-28 05:14:53,200 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 26 [2024-11-28 05:14:53,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:14:53,200 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2024-11-28 05:14:53,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 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-28 05:14:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2024-11-28 05:14:53,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 05:14:53,201 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:14:53,202 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:53,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 05:14:53,202 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:14:53,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:53,203 INFO L85 PathProgramCache]: Analyzing trace with hash -189310014, now seen corresponding path program 1 times [2024-11-28 05:14:53,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:53,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750869520] [2024-11-28 05:14:53,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:53,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:53,303 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 05:14:53,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:53,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750869520] [2024-11-28 05:14:53,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750869520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:53,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:53,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:14:53,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121750104] [2024-11-28 05:14:53,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:53,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:14:53,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:53,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:14:53,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:14:53,305 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-28 05:14:53,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:14:53,347 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2024-11-28 05:14:53,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:14:53,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 28 [2024-11-28 05:14:53,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:14:53,349 INFO L225 Difference]: With dead ends: 87 [2024-11-28 05:14:53,349 INFO L226 Difference]: Without dead ends: 87 [2024-11-28 05:14:53,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-28 05:14:53,350 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 15 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:14:53,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 157 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:14:53,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-28 05:14:53,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2024-11-28 05:14:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 74 states have internal predecessors, (83), 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-28 05:14:53,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2024-11-28 05:14:53,354 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 28 [2024-11-28 05:14:53,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:14:53,355 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2024-11-28 05:14:53,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-28 05:14:53,355 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2024-11-28 05:14:53,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 05:14:53,356 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:14:53,356 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:53,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 05:14:53,356 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:14:53,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:53,357 INFO L85 PathProgramCache]: Analyzing trace with hash -189309945, now seen corresponding path program 1 times [2024-11-28 05:14:53,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:53,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385907704] [2024-11-28 05:14:53,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:53,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:53,515 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 05:14:53,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:53,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385907704] [2024-11-28 05:14:53,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385907704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:53,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:53,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 05:14:53,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035921061] [2024-11-28 05:14:53,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:53,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:14:53,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:53,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:14:53,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:14:53,517 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 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-28 05:14:53,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:14:53,729 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2024-11-28 05:14:53,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:14:53,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 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 28 [2024-11-28 05:14:53,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:14:53,731 INFO L225 Difference]: With dead ends: 78 [2024-11-28 05:14:53,731 INFO L226 Difference]: Without dead ends: 78 [2024-11-28 05:14:53,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:14:53,732 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 45 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:14:53,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 185 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:14:53,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-28 05:14:53,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-28 05:14:53,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 77 states have internal predecessors, (89), 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-28 05:14:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2024-11-28 05:14:53,738 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 28 [2024-11-28 05:14:53,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:14:53,738 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2024-11-28 05:14:53,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 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-28 05:14:53,739 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2024-11-28 05:14:53,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 05:14:53,739 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:14:53,740 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:53,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 05:14:53,740 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:14:53,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:53,741 INFO L85 PathProgramCache]: Analyzing trace with hash -189309944, now seen corresponding path program 1 times [2024-11-28 05:14:53,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:53,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960928451] [2024-11-28 05:14:53,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:53,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:53,876 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 05:14:53,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:53,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960928451] [2024-11-28 05:14:53,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960928451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:53,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:53,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:14:53,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848575243] [2024-11-28 05:14:53,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:53,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:14:53,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:53,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:14:53,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:14:53,878 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-28 05:14:53,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:14:53,915 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2024-11-28 05:14:53,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:14:53,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 28 [2024-11-28 05:14:53,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:14:53,917 INFO L225 Difference]: With dead ends: 89 [2024-11-28 05:14:53,917 INFO L226 Difference]: Without dead ends: 89 [2024-11-28 05:14:53,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:14:53,918 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 64 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:14:53,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 107 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:14:53,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-28 05:14:53,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2024-11-28 05:14:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.380952380952381) internal successors, (87), 77 states have internal predecessors, (87), 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-28 05:14:53,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2024-11-28 05:14:53,924 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 28 [2024-11-28 05:14:53,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:14:53,924 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2024-11-28 05:14:53,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-28 05:14:53,924 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2024-11-28 05:14:53,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-28 05:14:53,925 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:14:53,925 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:53,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 05:14:53,926 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:14:53,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:53,927 INFO L85 PathProgramCache]: Analyzing trace with hash -441849425, now seen corresponding path program 1 times [2024-11-28 05:14:53,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:53,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259169957] [2024-11-28 05:14:53,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:53,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:54,215 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 05:14:54,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:54,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259169957] [2024-11-28 05:14:54,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259169957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:14:54,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316290692] [2024-11-28 05:14:54,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:54,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:14:54,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:14:54,219 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:14:54,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 05:14:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:54,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 05:14:54,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:14:54,565 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 05:14:54,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:14:54,648 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 05:14:54,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316290692] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:14:54,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:14:54,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-28 05:14:54,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514976392] [2024-11-28 05:14:54,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:14:54,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:14:54,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:54,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:14:54,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:14:54,651 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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-28 05:14:54,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:14:54,752 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2024-11-28 05:14:54,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:14:54,754 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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 33 [2024-11-28 05:14:54,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:14:54,755 INFO L225 Difference]: With dead ends: 123 [2024-11-28 05:14:54,756 INFO L226 Difference]: Without dead ends: 123 [2024-11-28 05:14:54,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:14:54,758 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 131 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:14:54,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 244 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:14:54,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-28 05:14:54,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 86. [2024-11-28 05:14:54,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 85 states have internal predecessors, (97), 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-28 05:14:54,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2024-11-28 05:14:54,765 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 33 [2024-11-28 05:14:54,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:14:54,765 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2024-11-28 05:14:54,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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-28 05:14:54,767 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2024-11-28 05:14:54,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-28 05:14:54,768 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:14:54,768 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:54,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 05:14:54,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-28 05:14:54,972 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:14:54,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:54,973 INFO L85 PathProgramCache]: Analyzing trace with hash 967937824, now seen corresponding path program 1 times [2024-11-28 05:14:54,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:54,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49548105] [2024-11-28 05:14:54,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:54,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:55,107 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 05:14:55,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:55,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49548105] [2024-11-28 05:14:55,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49548105] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:14:55,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681353099] [2024-11-28 05:14:55,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:55,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:14:55,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:14:55,110 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:14:55,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 05:14:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:55,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 05:14:55,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:14:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 05:14:55,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:14:55,376 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 05:14:55,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681353099] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:14:55,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:14:55,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-11-28 05:14:55,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865905892] [2024-11-28 05:14:55,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:14:55,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:14:55,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:55,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:14:55,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:14:55,379 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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-28 05:14:55,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:14:55,477 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2024-11-28 05:14:55,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:14:55,478 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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 34 [2024-11-28 05:14:55,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:14:55,479 INFO L225 Difference]: With dead ends: 120 [2024-11-28 05:14:55,479 INFO L226 Difference]: Without dead ends: 120 [2024-11-28 05:14:55,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:14:55,480 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 36 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:14:55,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 312 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:14:55,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-28 05:14:55,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 91. [2024-11-28 05:14:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 76 states have (on average 1.355263157894737) internal successors, (103), 90 states have internal predecessors, (103), 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-28 05:14:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2024-11-28 05:14:55,488 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 34 [2024-11-28 05:14:55,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:14:55,490 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2024-11-28 05:14:55,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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-28 05:14:55,490 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2024-11-28 05:14:55,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-28 05:14:55,491 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:14:55,491 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:14:55,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-28 05:14:55,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-28 05:14:55,692 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:14:55,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:55,694 INFO L85 PathProgramCache]: Analyzing trace with hash 967937893, now seen corresponding path program 1 times [2024-11-28 05:14:55,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:55,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758518010] [2024-11-28 05:14:55,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:55,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:56,631 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:14:56,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:56,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758518010] [2024-11-28 05:14:56,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758518010] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:14:56,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100831727] [2024-11-28 05:14:56,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:56,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:14:56,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:14:56,634 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:14:56,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 05:14:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:56,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-28 05:14:56,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:14:56,821 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-28 05:14:56,863 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:14:56,864 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-28 05:14:56,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 05:14:56,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-28 05:14:56,999 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:14:56,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 05:14:57,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:14:57,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:14:57,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:14:57,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 31 [2024-11-28 05:14:57,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:14:57,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 16 [2024-11-28 05:14:57,459 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:14:57,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:14:57,530 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_896 (Array Int Int))) (or (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_896) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_896 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_896)))) is different from false [2024-11-28 05:14:57,781 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-28 05:14:57,782 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 21 treesize of output 20 [2024-11-28 05:14:58,893 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_895 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_895) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2024-11-28 05:14:58,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:14:58,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2024-11-28 05:14:58,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:14:58,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 28 [2024-11-28 05:14:58,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 05:14:59,017 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2024-11-28 05:14:59,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100831727] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:14:59,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:14:59,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 33 [2024-11-28 05:14:59,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043863760] [2024-11-28 05:14:59,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:14:59,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-28 05:14:59,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:59,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-28 05:14:59,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=893, Unknown=11, NotChecked=122, Total=1122 [2024-11-28 05:14:59,020 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand has 34 states, 33 states have (on average 2.484848484848485) internal successors, (82), 34 states have internal predecessors, (82), 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-28 05:15:00,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:15:00,592 INFO L93 Difference]: Finished difference Result 146 states and 171 transitions. [2024-11-28 05:15:00,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 05:15:00,593 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.484848484848485) internal successors, (82), 34 states have internal predecessors, (82), 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 34 [2024-11-28 05:15:00,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:15:00,595 INFO L225 Difference]: With dead ends: 146 [2024-11-28 05:15:00,595 INFO L226 Difference]: Without dead ends: 146 [2024-11-28 05:15:00,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=256, Invalid=1721, Unknown=11, NotChecked=174, Total=2162 [2024-11-28 05:15:00,598 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 101 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:15:00,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 901 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 938 Invalid, 0 Unknown, 167 Unchecked, 0.9s Time] [2024-11-28 05:15:00,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-28 05:15:00,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 101. [2024-11-28 05:15:00,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 86 states have (on average 1.372093023255814) internal successors, (118), 100 states have internal predecessors, (118), 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-28 05:15:00,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 118 transitions. [2024-11-28 05:15:00,603 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 118 transitions. Word has length 34 [2024-11-28 05:15:00,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:15:00,603 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 118 transitions. [2024-11-28 05:15:00,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.484848484848485) internal successors, (82), 34 states have internal predecessors, (82), 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-28 05:15:00,603 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 118 transitions. [2024-11-28 05:15:00,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-28 05:15:00,606 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:15:00,606 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:15:00,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 05:15:00,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-28 05:15:00,807 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:15:00,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:15:00,808 INFO L85 PathProgramCache]: Analyzing trace with hash 967937894, now seen corresponding path program 1 times [2024-11-28 05:15:00,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:15:00,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367542729] [2024-11-28 05:15:00,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:00,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:15:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:15:02,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:15:02,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367542729] [2024-11-28 05:15:02,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367542729] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:15:02,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563369647] [2024-11-28 05:15:02,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:02,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:15:02,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:15:02,053 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:15:02,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 05:15:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:02,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-28 05:15:02,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:15:02,245 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-28 05:15:02,346 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:15:02,347 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-28 05:15:02,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 05:15:02,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 05:15:02,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-28 05:15:02,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-28 05:15:02,556 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:15:02,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 72 [2024-11-28 05:15:02,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-28 05:15:02,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:15:02,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:15:02,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 39 [2024-11-28 05:15:02,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:15:02,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2024-11-28 05:15:03,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 24 [2024-11-28 05:15:03,122 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 32 treesize of output 14 [2024-11-28 05:15:03,228 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:15:03,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:15:03,534 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1010 (Array Int Int))) (or (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1010 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_1010)) (forall ((v_ArrVal_1009 (Array Int Int))) (or (not (= v_ArrVal_1009 (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1009 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1009) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1010) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))))) (forall ((v_ArrVal_1009 (Array Int Int))) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1009) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 1)) (not (= v_ArrVal_1009 (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1009 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))))))) is different from false [2024-11-28 05:15:03,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:15:03,989 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 46 treesize of output 50 [2024-11-28 05:15:04,214 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1005 Int)) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_1005)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1007) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9))) (forall ((v_ArrVal_1008 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1008) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_2 (Array Int Int)) (v_ArrVal_1005 Int)) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_1005)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))))) is different from false [2024-11-28 05:15:04,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:15:04,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2024-11-28 05:15:04,239 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 40 treesize of output 28 [2024-11-28 05:15:04,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-28 05:15:04,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:15:04,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2024-11-28 05:15:04,257 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:15:04,260 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 22 treesize of output 10 [2024-11-28 05:15:04,270 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-28 05:15:04,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 1 [2024-11-28 05:15:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2024-11-28 05:15:04,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563369647] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:15:04,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:15:04,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2024-11-28 05:15:04,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476331666] [2024-11-28 05:15:04,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:15:04,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-28 05:15:04,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:15:04,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-28 05:15:04,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1288, Unknown=14, NotChecked=146, Total=1560 [2024-11-28 05:15:04,512 INFO L87 Difference]: Start difference. First operand 101 states and 118 transitions. Second operand has 40 states, 39 states have (on average 2.3333333333333335) internal successors, (91), 40 states have internal predecessors, (91), 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-28 05:15:06,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:15:06,677 INFO L93 Difference]: Finished difference Result 156 states and 184 transitions. [2024-11-28 05:15:06,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 05:15:06,678 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.3333333333333335) internal successors, (91), 40 states have internal predecessors, (91), 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 34 [2024-11-28 05:15:06,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:15:06,679 INFO L225 Difference]: With dead ends: 156 [2024-11-28 05:15:06,679 INFO L226 Difference]: Without dead ends: 156 [2024-11-28 05:15:06,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=284, Invalid=2260, Unknown=14, NotChecked=198, Total=2756 [2024-11-28 05:15:06,681 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 104 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:15:06,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1083 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1005 Invalid, 0 Unknown, 164 Unchecked, 1.0s Time] [2024-11-28 05:15:06,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-28 05:15:06,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 109. [2024-11-28 05:15:06,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 94 states have (on average 1.372340425531915) internal successors, (129), 108 states have internal predecessors, (129), 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-28 05:15:06,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 129 transitions. [2024-11-28 05:15:06,686 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 129 transitions. Word has length 34 [2024-11-28 05:15:06,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:15:06,686 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 129 transitions. [2024-11-28 05:15:06,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.3333333333333335) internal successors, (91), 40 states have internal predecessors, (91), 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-28 05:15:06,687 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2024-11-28 05:15:06,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-28 05:15:06,687 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:15:06,687 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:15:06,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-28 05:15:06,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-28 05:15:06,888 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:15:06,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:15:06,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1950403688, now seen corresponding path program 2 times [2024-11-28 05:15:06,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:15:06,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393110966] [2024-11-28 05:15:06,888 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:15:06,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:15:06,916 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:15:06,917 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:15:07,227 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-28 05:15:07,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:15:07,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393110966] [2024-11-28 05:15:07,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393110966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:15:07,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:15:07,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 05:15:07,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073555286] [2024-11-28 05:15:07,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:15:07,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:15:07,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:15:07,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:15:07,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:15:07,229 INFO L87 Difference]: Start difference. First operand 109 states and 129 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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-28 05:15:07,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:15:07,413 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2024-11-28 05:15:07,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:15:07,413 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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 38 [2024-11-28 05:15:07,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:15:07,414 INFO L225 Difference]: With dead ends: 109 [2024-11-28 05:15:07,414 INFO L226 Difference]: Without dead ends: 109 [2024-11-28 05:15:07,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:15:07,415 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 37 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:15:07,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 209 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:15:07,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-28 05:15:07,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-28 05:15:07,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 108 states have internal predecessors, (126), 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-28 05:15:07,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2024-11-28 05:15:07,421 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 38 [2024-11-28 05:15:07,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:15:07,422 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2024-11-28 05:15:07,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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-28 05:15:07,423 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2024-11-28 05:15:07,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-28 05:15:07,423 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:15:07,423 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:15:07,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 05:15:07,424 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:15:07,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:15:07,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1503986809, now seen corresponding path program 2 times [2024-11-28 05:15:07,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:15:07,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882508334] [2024-11-28 05:15:07,425 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:15:07,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:15:07,455 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:15:07,456 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:15:07,573 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-28 05:15:07,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:15:07,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882508334] [2024-11-28 05:15:07,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882508334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:15:07,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567058091] [2024-11-28 05:15:07,574 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:15:07,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:15:07,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:15:07,576 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:15:07,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 05:15:07,800 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:15:07,800 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:15:07,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 05:15:07,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:15:08,029 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-28 05:15:08,033 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:15:08,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567058091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:15:08,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 05:15:08,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-11-28 05:15:08,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86083577] [2024-11-28 05:15:08,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:15:08,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:15:08,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:15:08,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:15:08,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:15:08,037 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-28 05:15:08,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:15:08,094 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2024-11-28 05:15:08,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:15:08,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 42 [2024-11-28 05:15:08,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:15:08,095 INFO L225 Difference]: With dead ends: 87 [2024-11-28 05:15:08,095 INFO L226 Difference]: Without dead ends: 87 [2024-11-28 05:15:08,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:15:08,097 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 28 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:15:08,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 201 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:15:08,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-28 05:15:08,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2024-11-28 05:15:08,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 79 states have internal predecessors, (85), 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-28 05:15:08,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2024-11-28 05:15:08,105 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 42 [2024-11-28 05:15:08,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:15:08,105 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2024-11-28 05:15:08,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-28 05:15:08,105 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2024-11-28 05:15:08,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-28 05:15:08,108 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:15:08,108 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:15:08,121 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 05:15:08,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:15:08,309 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:15:08,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:15:08,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1739136056, now seen corresponding path program 1 times [2024-11-28 05:15:08,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:15:08,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985171020] [2024-11-28 05:15:08,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:08,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:15:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:08,564 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 05:15:08,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:15:08,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985171020] [2024-11-28 05:15:08,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985171020] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:15:08,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909853557] [2024-11-28 05:15:08,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:08,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:15:08,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:15:08,568 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:15:08,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 05:15:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:08,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 05:15:08,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:15:08,844 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 05:15:08,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:15:08,886 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 05:15:08,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909853557] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:15:08,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:15:08,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2024-11-28 05:15:08,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477838932] [2024-11-28 05:15:08,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:15:08,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 05:15:08,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:15:08,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 05:15:08,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:15:08,888 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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-28 05:15:09,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:15:09,054 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2024-11-28 05:15:09,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 05:15:09,055 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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 44 [2024-11-28 05:15:09,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:15:09,056 INFO L225 Difference]: With dead ends: 84 [2024-11-28 05:15:09,056 INFO L226 Difference]: Without dead ends: 84 [2024-11-28 05:15:09,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-28 05:15:09,057 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 105 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:15:09,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 360 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:15:09,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-28 05:15:09,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2024-11-28 05:15:09,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 79 states have internal predecessors, (84), 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-28 05:15:09,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-11-28 05:15:09,060 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 44 [2024-11-28 05:15:09,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:15:09,060 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-11-28 05:15:09,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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-28 05:15:09,061 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-11-28 05:15:09,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 05:15:09,061 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:15:09,061 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:15:09,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-28 05:15:09,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-28 05:15:09,262 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:15:09,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:15:09,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1985849878, now seen corresponding path program 1 times [2024-11-28 05:15:09,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:15:09,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570339226] [2024-11-28 05:15:09,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:09,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:15:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:10,612 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:15:10,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:15:10,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570339226] [2024-11-28 05:15:10,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570339226] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:15:10,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560105158] [2024-11-28 05:15:10,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:10,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:15:10,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:15:10,616 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:15:10,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 05:15:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:10,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-28 05:15:10,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:15:10,908 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-28 05:15:11,018 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:15:11,019 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-28 05:15:11,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 05:15:11,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-28 05:15:11,235 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:15:11,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2024-11-28 05:15:11,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:15:11,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2024-11-28 05:15:11,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:15:11,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2024-11-28 05:15:11,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 05:15:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:15:12,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:15:12,464 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1424 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1424) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-11-28 05:15:12,472 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1424 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1424) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-11-28 05:15:12,484 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1424 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1424) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-11-28 05:15:12,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:15:12,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2024-11-28 05:15:12,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:15:12,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 51 [2024-11-28 05:15:12,526 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 18 treesize of output 16 [2024-11-28 05:15:13,026 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1420 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1420) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) is different from false [2024-11-28 05:15:13,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:15:13,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2024-11-28 05:15:13,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:15:13,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 31 [2024-11-28 05:15:13,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-28 05:15:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-28 05:15:13,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560105158] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:15:13,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:15:13,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 59 [2024-11-28 05:15:13,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573286975] [2024-11-28 05:15:13,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:15:13,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-28 05:15:13,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:15:13,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-28 05:15:13,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2747, Unknown=35, NotChecked=436, Total=3422 [2024-11-28 05:15:13,199 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 59 states, 59 states have (on average 2.1016949152542375) internal successors, (124), 59 states have internal predecessors, (124), 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-28 05:15:15,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:15:15,231 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2024-11-28 05:15:15,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-28 05:15:15,235 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.1016949152542375) internal successors, (124), 59 states have internal predecessors, (124), 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 47 [2024-11-28 05:15:15,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:15:15,235 INFO L225 Difference]: With dead ends: 87 [2024-11-28 05:15:15,236 INFO L226 Difference]: Without dead ends: 87 [2024-11-28 05:15:15,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1426 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=517, Invalid=5164, Unknown=35, NotChecked=604, Total=6320 [2024-11-28 05:15:15,239 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 165 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:15:15,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1069 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1144 Invalid, 0 Unknown, 277 Unchecked, 0.9s Time] [2024-11-28 05:15:15,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-28 05:15:15,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2024-11-28 05:15:15,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 79 states have internal predecessors, (83), 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-28 05:15:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2024-11-28 05:15:15,243 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 47 [2024-11-28 05:15:15,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:15:15,244 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2024-11-28 05:15:15,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 2.1016949152542375) internal successors, (124), 59 states have internal predecessors, (124), 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-28 05:15:15,244 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2024-11-28 05:15:15,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-28 05:15:15,245 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:15:15,245 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:15:15,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 05:15:15,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:15:15,449 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:15:15,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:15:15,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1535068229, now seen corresponding path program 1 times [2024-11-28 05:15:15,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:15:15,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434906066] [2024-11-28 05:15:15,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:15,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:15:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:15,614 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-28 05:15:15,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:15:15,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434906066] [2024-11-28 05:15:15,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434906066] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:15:15,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128587175] [2024-11-28 05:15:15,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:15,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:15:15,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:15:15,617 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:15:15,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 05:15:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:15,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 05:15:15,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:15:15,880 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-28 05:15:15,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:15:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-28 05:15:15,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128587175] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:15:15,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:15:15,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-11-28 05:15:15,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937995693] [2024-11-28 05:15:15,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:15:15,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:15:15,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:15:15,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:15:15,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:15:15,923 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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-28 05:15:15,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:15:15,996 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2024-11-28 05:15:15,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:15:15,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 51 [2024-11-28 05:15:15,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:15:15,997 INFO L225 Difference]: With dead ends: 77 [2024-11-28 05:15:15,997 INFO L226 Difference]: Without dead ends: 77 [2024-11-28 05:15:15,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:15:15,998 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 25 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:15:15,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 227 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:15:15,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-28 05:15:16,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-28 05:15:16,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 68 states have (on average 1.161764705882353) internal successors, (79), 76 states have internal predecessors, (79), 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-28 05:15:16,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2024-11-28 05:15:16,001 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 51 [2024-11-28 05:15:16,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:15:16,002 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2024-11-28 05:15:16,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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-28 05:15:16,002 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2024-11-28 05:15:16,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-28 05:15:16,002 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:15:16,003 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:15:16,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-28 05:15:16,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:15:16,203 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:15:16,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:15:16,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1535068298, now seen corresponding path program 1 times [2024-11-28 05:15:16,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:15:16,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954023065] [2024-11-28 05:15:16,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:16,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:15:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:17,539 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 05:15:17,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:15:17,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954023065] [2024-11-28 05:15:17,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954023065] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:15:17,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206549014] [2024-11-28 05:15:17,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:17,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:15:17,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:15:17,542 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:15:17,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 05:15:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:17,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-28 05:15:17,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:15:17,786 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-28 05:15:17,821 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:15:17,821 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-28 05:15:17,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 05:15:17,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-28 05:15:17,932 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:15:17,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 05:15:18,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:15:18,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:15:18,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:15:18,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 31 [2024-11-28 05:15:18,407 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:15:18,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 05:15:18,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:15:18,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 16 [2024-11-28 05:15:18,578 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-28 05:15:18,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:15:18,696 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1662 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1662) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) 1)) is different from false [2024-11-28 05:15:19,000 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1662 (Array Int Int)) (v_ArrVal_1661 (Array Int Int))) (or (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1661 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_1661)) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1661))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_1662)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) 1))) is different from false [2024-11-28 05:15:19,029 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1662 (Array Int Int)) (v_ArrVal_1661 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (= 1 (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1661) (select v_ArrVal_1661 .cse0) v_ArrVal_1662) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| (select v_ArrVal_1661 |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|)) v_ArrVal_1661)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|))) is different from false [2024-11-28 05:15:19,064 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1662 (Array Int Int)) (v_ArrVal_1661 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (not (= v_ArrVal_1661 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| (select v_ArrVal_1661 |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_1661) (select v_ArrVal_1661 .cse0) v_ArrVal_1662) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse0))) 1))) is different from false [2024-11-28 05:15:19,086 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1662 (Array Int Int)) (v_ArrVal_1661 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1661) (select v_ArrVal_1661 .cse0) v_ArrVal_1662) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0))) 1) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|) (not (= v_ArrVal_1661 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| (select v_ArrVal_1661 |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|)))))) is different from false [2024-11-28 05:15:19,120 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1662 (Array Int Int)) (v_ArrVal_1661 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| (select v_ArrVal_1661 |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|)) v_ArrVal_1661)) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1661) (select v_ArrVal_1661 .cse0) v_ArrVal_1662) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) 1) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|))) is different from false [2024-11-28 05:15:19,141 INFO L349 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2024-11-28 05:15:19,141 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 31 treesize of output 30 [2024-11-28 05:15:19,161 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1662 (Array Int Int)) (v_ArrVal_1661 (Array Int Int)) (v_ArrVal_1660 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1660))) (or (not (= v_ArrVal_1661 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| (select v_ArrVal_1661 |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|)))) (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1661) (select v_ArrVal_1661 .cse1) v_ArrVal_1662) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|)))) is different from false [2024-11-28 05:15:19,203 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1662 (Array Int Int)) (v_ArrVal_1661 (Array Int Int)) (v_ArrVal_1660 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (not (= (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1660) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| (select v_ArrVal_1661 |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|)) v_ArrVal_1661)) (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1660) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1661) (select v_ArrVal_1661 .cse0) v_ArrVal_1662) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|))) is different from false [2024-11-28 05:15:19,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:15:19,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 66 [2024-11-28 05:15:19,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2024-11-28 05:15:19,244 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:15:19,245 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:15:19,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:15:19,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 56 [2024-11-28 05:15:19,274 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 05:15:19,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2024-11-28 05:15:19,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-28 05:15:19,306 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:15:19,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2024-11-28 05:15:19,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:15:19,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2024-11-28 05:15:19,417 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 11 not checked. [2024-11-28 05:15:19,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206549014] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:15:19,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:15:19,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 46 [2024-11-28 05:15:19,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63303555] [2024-11-28 05:15:19,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:15:19,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-28 05:15:19,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:15:19,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-28 05:15:19,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1330, Unknown=54, NotChecked=648, Total=2162 [2024-11-28 05:15:19,421 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand has 47 states, 46 states have (on average 2.869565217391304) internal successors, (132), 47 states have internal predecessors, (132), 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-28 05:15:21,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:15:21,152 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2024-11-28 05:15:21,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 05:15:21,152 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.869565217391304) internal successors, (132), 47 states have internal predecessors, (132), 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 51 [2024-11-28 05:15:21,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:15:21,153 INFO L225 Difference]: With dead ends: 83 [2024-11-28 05:15:21,153 INFO L226 Difference]: Without dead ends: 83 [2024-11-28 05:15:21,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=317, Invalid=2628, Unknown=57, NotChecked=904, Total=3906 [2024-11-28 05:15:21,154 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 69 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 493 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:15:21,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1006 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 944 Invalid, 0 Unknown, 493 Unchecked, 0.7s Time] [2024-11-28 05:15:21,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-28 05:15:21,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2024-11-28 05:15:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 75 states have internal predecessors, (78), 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-28 05:15:21,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2024-11-28 05:15:21,158 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 51 [2024-11-28 05:15:21,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:15:21,158 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2024-11-28 05:15:21,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.869565217391304) internal successors, (132), 47 states have internal predecessors, (132), 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-28 05:15:21,159 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2024-11-28 05:15:21,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-28 05:15:21,159 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:15:21,159 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:15:21,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-28 05:15:21,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:15:21,360 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:15:21,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:15:21,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1535068299, now seen corresponding path program 1 times [2024-11-28 05:15:21,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:15:21,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477973172] [2024-11-28 05:15:21,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:21,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:15:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 05:15:23,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:15:23,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477973172] [2024-11-28 05:15:23,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477973172] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:15:23,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118518373] [2024-11-28 05:15:23,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:23,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:15:23,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:15:23,030 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:15:23,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 05:15:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:23,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-28 05:15:23,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:15:23,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:15:23,351 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:15:23,351 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-28 05:15:23,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 05:15:23,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 05:15:23,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-28 05:15:23,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-28 05:15:23,512 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:15:23,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 72 [2024-11-28 05:15:23,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2024-11-28 05:15:23,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:15:23,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:15:23,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 39 [2024-11-28 05:15:23,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:15:23,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-11-28 05:15:24,147 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:15:24,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 72 [2024-11-28 05:15:24,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-28 05:15:24,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 24 [2024-11-28 05:15:24,388 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 32 treesize of output 14 [2024-11-28 05:15:24,474 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 05:15:24,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:15:25,209 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1787 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1787))) (or (forall ((v_ArrVal_1788 (Array Int Int))) (or (not (= v_ArrVal_1788 (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1788 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_1790 (Array Int Int))) (<= 0 (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1788) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_1790) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))) (not (= (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1787 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_1787)) (< (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0)))) (forall ((v_ArrVal_1787 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1787))) (or (not (= (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1787 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_1787)) (forall ((v_ArrVal_1788 (Array Int Int))) (or (not (= v_ArrVal_1788 (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1788 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_1789 (Array Int Int)) (v_ArrVal_1790 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1788))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (<= (+ (select (select (store .cse4 .cse5 v_ArrVal_1790) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1789) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))))))) (< (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0)))))) is different from false [2024-11-28 05:15:25,336 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|) (forall ((v_ArrVal_1787 (Array Int Int))) (or (< (select v_ArrVal_1787 .cse0) 0) (forall ((v_ArrVal_1788 (Array Int Int))) (or (not (= (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_1788 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)) v_ArrVal_1788)) (forall ((v_ArrVal_1789 (Array Int Int)) (v_ArrVal_1790 (Array Int Int))) (let ((.cse2 (select v_ArrVal_1788 .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1787) .cse2 v_ArrVal_1790) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1788) .cse2 v_ArrVal_1789) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))))) (not (= v_ArrVal_1787 (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_1787 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)))))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int) (v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1790 (Array Int Int))) (or (< (select v_ArrVal_1787 .cse0) 0) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|) (not (= v_ArrVal_1787 (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_1787 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1787) (select .cse1 .cse0) v_ArrVal_1790) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 1)))))) is different from false [2024-11-28 05:15:25,465 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int) (v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1790 (Array Int Int))) (or (not (= v_ArrVal_1787 (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_1787 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_1787) (select .cse1 .cse2) v_ArrVal_1790) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse2) 1)) (< (select v_ArrVal_1787 .cse2) 0))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|) (forall ((v_ArrVal_1787 (Array Int Int))) (or (not (= v_ArrVal_1787 (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_1787 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)))) (forall ((v_ArrVal_1788 (Array Int Int))) (or (forall ((v_ArrVal_1789 (Array Int Int)) (v_ArrVal_1790 (Array Int Int))) (let ((.cse3 (select v_ArrVal_1788 .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_1787) .cse3 v_ArrVal_1790) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse2) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_1788) .cse3 v_ArrVal_1789) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse2))))) (not (= v_ArrVal_1788 (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_1788 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)))))) (< (select v_ArrVal_1787 .cse2) 0))))))) is different from false [2024-11-28 05:15:36,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:15:36,316 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 147 treesize of output 151 [2024-11-28 05:15:36,723 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_10))) (or (not (= (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_8 (select v_prenex_9 v_prenex_8)) v_prenex_9)) (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_9) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_prenex_12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) 1)) (< (select v_prenex_9 .cse1) 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_8)))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|) (forall ((v_ArrVal_1787 (Array Int Int))) (or (< (select v_ArrVal_1787 .cse1) 0) (forall ((v_ArrVal_1786 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1786))) (or (forall ((v_ArrVal_1785 (Array Int Int)) (v_ArrVal_1790 (Array Int Int))) (< (select (select (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1787) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1785) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1790) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9))) (not (= (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_1787 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)) v_ArrVal_1787))))))))) (or (forall ((v_ArrVal_1789 (Array Int Int)) (v_ArrVal_1788 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int) (v_ArrVal_1785 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1785))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|) (not (= (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_1788 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)) v_ArrVal_1788)) (= (select (select (store (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1788) (select v_ArrVal_1788 .cse1) v_ArrVal_1789) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (forall ((v_ArrVal_1786 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1786) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) 0))))) is different from false [2024-11-28 05:15:36,973 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 0))) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (or (forall ((v_ArrVal_1789 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int) (v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1785 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|) (not (= v_ArrVal_1788 (store (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1785) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_1788 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)))) (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1785) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1788) (select v_ArrVal_1788 .cse1) v_ArrVal_1789) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1783 Int)) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse2 .cse3 v_ArrVal_1783)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1786) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) 0))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_ArrVal_1783 Int) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_8 Int)) (or (not (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse2 .cse3 v_ArrVal_1783)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_8 (select v_prenex_9 v_prenex_8)) v_prenex_9)) (< (select v_prenex_9 .cse1) 0) (< 0 (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_9) (select (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_prenex_12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) 1)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_8))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_54| Int) (v_ArrVal_1783 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|) (forall ((v_ArrVal_1787 (Array Int Int))) (or (forall ((v_ArrVal_1786 (Array Int Int))) (or (forall ((v_ArrVal_1785 (Array Int Int)) (v_ArrVal_1790 (Array Int Int))) (< (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1786) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1787) (select (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1785) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1790) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9))) (not (= v_ArrVal_1787 (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse2 .cse3 v_ArrVal_1783)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1786) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_54| (select v_ArrVal_1787 |v_ULTIMATE.start_dll_update_at_~head#1.offset_54|)))))) (< (select v_ArrVal_1787 .cse1) 0)))))))) is different from false [2024-11-28 05:15:37,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:15:37,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 110 [2024-11-28 05:15:37,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:15:37,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:15:37,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2024-11-28 05:15:37,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:15:37,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 31 [2024-11-28 05:15:37,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-28 05:15:37,108 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 05:15:37,114 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:15:37,123 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-28 05:15:37,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 1 [2024-11-28 05:15:37,406 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 8 not checked. [2024-11-28 05:15:37,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118518373] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:15:37,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:15:37,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 52 [2024-11-28 05:15:37,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663001682] [2024-11-28 05:15:37,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:15:37,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-28 05:15:37,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:15:37,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-28 05:15:37,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2042, Unknown=70, NotChecked=480, Total=2756 [2024-11-28 05:15:37,409 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 53 states, 52 states have (on average 2.6923076923076925) internal successors, (140), 53 states have internal predecessors, (140), 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-28 05:15:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:15:43,205 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2024-11-28 05:15:43,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 05:15:43,205 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.6923076923076925) internal successors, (140), 53 states have internal predecessors, (140), 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 51 [2024-11-28 05:15:43,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:15:43,206 INFO L225 Difference]: With dead ends: 82 [2024-11-28 05:15:43,206 INFO L226 Difference]: Without dead ends: 82 [2024-11-28 05:15:43,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=379, Invalid=3587, Unknown=86, NotChecked=640, Total=4692 [2024-11-28 05:15:43,209 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 70 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 290 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:15:43,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1251 Invalid, 1454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1150 Invalid, 0 Unknown, 290 Unchecked, 2.2s Time] [2024-11-28 05:15:43,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-28 05:15:43,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2024-11-28 05:15:43,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 73 states have internal predecessors, (76), 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-28 05:15:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2024-11-28 05:15:43,211 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 51 [2024-11-28 05:15:43,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:15:43,212 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2024-11-28 05:15:43,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.6923076923076925) internal successors, (140), 53 states have internal predecessors, (140), 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-28 05:15:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2024-11-28 05:15:43,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-28 05:15:43,212 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:15:43,213 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:15:43,225 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 05:15:43,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:15:43,414 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:15:43,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:15:43,414 INFO L85 PathProgramCache]: Analyzing trace with hash -270199246, now seen corresponding path program 1 times [2024-11-28 05:15:43,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:15:43,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560255878] [2024-11-28 05:15:43,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:43,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:15:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:43,540 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-28 05:15:43,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:15:43,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560255878] [2024-11-28 05:15:43,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560255878] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:15:43,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956145850] [2024-11-28 05:15:43,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:43,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:15:43,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:15:43,544 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:15:43,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 05:15:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:43,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 05:15:43,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:15:43,873 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-28 05:15:43,873 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:15:43,964 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-28 05:15:43,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956145850] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:15:43,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:15:43,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-28 05:15:43,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575951396] [2024-11-28 05:15:43,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:15:43,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:15:43,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:15:43,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:15:43,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:15:43,965 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-28 05:15:44,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:15:44,121 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2024-11-28 05:15:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:15:44,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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 54 [2024-11-28 05:15:44,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:15:44,123 INFO L225 Difference]: With dead ends: 74 [2024-11-28 05:15:44,123 INFO L226 Difference]: Without dead ends: 74 [2024-11-28 05:15:44,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:15:44,123 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 29 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:15:44,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 173 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:15:44,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-28 05:15:44,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-28 05:15:44,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 73 states have internal predecessors, (75), 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-28 05:15:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2024-11-28 05:15:44,129 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 54 [2024-11-28 05:15:44,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:15:44,129 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2024-11-28 05:15:44,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-28 05:15:44,130 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2024-11-28 05:15:44,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-28 05:15:44,130 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:15:44,130 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:15:44,144 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-28 05:15:44,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:15:44,335 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:15:44,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:15:44,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1497528747, now seen corresponding path program 1 times [2024-11-28 05:15:44,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:15:44,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569606356] [2024-11-28 05:15:44,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:44,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:15:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:46,974 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:15:46,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:15:46,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569606356] [2024-11-28 05:15:46,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569606356] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:15:46,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375560180] [2024-11-28 05:15:46,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:46,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:15:46,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:15:46,977 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:15:46,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 05:15:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:47,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-11-28 05:15:47,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:15:47,394 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-28 05:15:47,741 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:15:47,741 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-28 05:15:47,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 05:15:47,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 05:15:47,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-28 05:15:48,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-28 05:15:48,193 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:15:48,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 55 [2024-11-28 05:15:48,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 05:15:48,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:15:48,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:15:48,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-28 05:15:48,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:15:48,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-28 05:15:49,741 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:15:49,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 74 [2024-11-28 05:15:49,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 05:15:49,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-28 05:15:50,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-28 05:15:50,720 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 9 treesize of output 3 [2024-11-28 05:15:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:15:51,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:15:51,735 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 86 treesize of output 64 [2024-11-28 05:15:52,026 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_2036 (Array Int Int))) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2036) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (= |c_ULTIMATE.start_dll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_2033 (Array Int Int))) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2033) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2024-11-28 05:15:52,301 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2033 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2033) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_ArrVal_2036 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2036) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2024-11-28 05:15:52,645 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|))) (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_2031 (Array Int Int))) (or (forall ((v_ArrVal_2036 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2031))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2036) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))) (not (= (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2031 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_2031)))) (forall ((v_ArrVal_2031 (Array Int Int))) (or (forall ((v_ArrVal_2032 (Array Int Int))) (or (not (= (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2032 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_2032)) (forall ((v_ArrVal_2033 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2032))) (= (select (select (store .cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2031) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_2033) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))))) (not (= (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2031 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_2031)))))) is different from false [2024-11-28 05:15:52,732 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_62| Int)) (or (forall ((v_ArrVal_2031 (Array Int Int))) (or (not (= v_ArrVal_2031 (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_62| (select v_ArrVal_2031 |v_ULTIMATE.start_dll_update_at_~head#1.offset_62|)))) (forall ((v_ArrVal_2036 (Array Int Int))) (let ((.cse1 (select v_ArrVal_2031 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2031) .cse1 v_ArrVal_2036) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_62|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_62| Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int))) (or (not (= v_ArrVal_2032 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_62| (select v_ArrVal_2032 |v_ULTIMATE.start_dll_update_at_~head#1.offset_62|)))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2032) (select .cse0 .cse2) v_ArrVal_2033) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) (select v_ArrVal_2032 .cse2)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_62|))))) is different from false [2024-11-28 05:15:52,844 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_62| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_62|) (forall ((v_ArrVal_2031 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_62| (select v_ArrVal_2031 |v_ULTIMATE.start_dll_update_at_~head#1.offset_62|)) v_ArrVal_2031)) (forall ((v_ArrVal_2036 (Array Int Int))) (let ((.cse1 (select v_ArrVal_2031 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2031) .cse1 v_ArrVal_2036) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse2) .cse1))))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_62| Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_62|) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2032) (select .cse0 .cse2) v_ArrVal_2033) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse2) (select v_ArrVal_2032 .cse2)) (not (= v_ArrVal_2032 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_62| (select v_ArrVal_2032 |v_ULTIMATE.start_dll_update_at_~head#1.offset_62|)))))))) is different from false [2024-11-28 05:15:52,900 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_62| Int)) (or (forall ((v_ArrVal_2031 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_62| (select v_ArrVal_2031 |v_ULTIMATE.start_dll_update_at_~head#1.offset_62|)) v_ArrVal_2031)) (forall ((v_ArrVal_2036 (Array Int Int))) (let ((.cse1 (select v_ArrVal_2031 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2031) .cse1 v_ArrVal_2036) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2) .cse1))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_62|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_62| Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int))) (or (not (= v_ArrVal_2032 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_62| (select v_ArrVal_2032 |v_ULTIMATE.start_dll_update_at_~head#1.offset_62|)))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2032) (select .cse0 .cse2) v_ArrVal_2033) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2) (select v_ArrVal_2032 .cse2)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_62|))))) is different from false [2024-11-28 05:15:53,003 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_62| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_62|) (forall ((v_ArrVal_2031 (Array Int Int))) (or (forall ((v_ArrVal_2036 (Array Int Int))) (let ((.cse0 (select v_ArrVal_2031 .cse1))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2031) .cse0 v_ArrVal_2036) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) .cse0))) (not (= v_ArrVal_2031 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_62| (select v_ArrVal_2031 |v_ULTIMATE.start_dll_update_at_~head#1.offset_62|)))))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_62| Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_62|) (= (select v_ArrVal_2032 .cse1) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2032) (select .cse2 .cse1) v_ArrVal_2033) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)) (not (= v_ArrVal_2032 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_62| (select v_ArrVal_2032 |v_ULTIMATE.start_dll_update_at_~head#1.offset_62|)))))))) is different from false [2024-11-28 05:15:53,075 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_62| Int) (v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2029))) (or (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2032) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2030) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_2033) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) (select v_ArrVal_2032 .cse1)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_62|) (not (= (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_62| (select v_ArrVal_2032 |v_ULTIMATE.start_dll_update_at_~head#1.offset_62|)) v_ArrVal_2032))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_62| Int) (v_ArrVal_2030 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_62|) (forall ((v_ArrVal_2031 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2030))) (or (not (= (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_62| (select v_ArrVal_2031 |v_ULTIMATE.start_dll_update_at_~head#1.offset_62|)) v_ArrVal_2031)) (forall ((v_ArrVal_2036 (Array Int Int))) (let ((.cse3 (select v_ArrVal_2031 .cse1))) (= (select (select (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2031) .cse3 v_ArrVal_2036) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) .cse3)))))))))) is different from false [2024-11-28 05:15:53,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:15:53,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 102 [2024-11-28 05:15:53,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:15:53,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2024-11-28 05:15:53,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:15:53,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2024-11-28 05:15:53,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:15:53,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 31 [2024-11-28 05:15:53,589 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:15:53,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:15:53,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-28 05:15:53,600 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:15:53,609 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-28 05:15:53,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 1 [2024-11-28 05:15:53,984 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-11-28 05:15:53,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375560180] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:15:53,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:15:53,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 68 [2024-11-28 05:15:53,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179490508] [2024-11-28 05:15:53,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:15:53,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-11-28 05:15:53,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:15:53,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-11-28 05:15:53,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=3315, Unknown=52, NotChecked=984, Total=4556 [2024-11-28 05:15:53,988 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand has 68 states, 68 states have (on average 2.2794117647058822) internal successors, (155), 68 states have internal predecessors, (155), 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-28 05:16:00,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:16:00,584 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2024-11-28 05:16:00,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-28 05:16:00,585 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.2794117647058822) internal successors, (155), 68 states have internal predecessors, (155), 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 57 [2024-11-28 05:16:00,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:16:00,585 INFO L225 Difference]: With dead ends: 77 [2024-11-28 05:16:00,585 INFO L226 Difference]: Without dead ends: 77 [2024-11-28 05:16:00,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1440 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=524, Invalid=6427, Unknown=53, NotChecked=1368, Total=8372 [2024-11-28 05:16:00,587 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 104 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 1715 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 492 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:16:00,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1116 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1715 Invalid, 0 Unknown, 492 Unchecked, 2.9s Time] [2024-11-28 05:16:00,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-28 05:16:00,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2024-11-28 05:16:00,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 64 states have (on average 1.109375) internal successors, (71), 69 states have internal predecessors, (71), 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-28 05:16:00,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2024-11-28 05:16:00,590 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 57 [2024-11-28 05:16:00,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:16:00,590 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2024-11-28 05:16:00,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 2.2794117647058822) internal successors, (155), 68 states have internal predecessors, (155), 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-28 05:16:00,593 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2024-11-28 05:16:00,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-28 05:16:00,593 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:16:00,593 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:16:00,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-28 05:16:00,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:16:00,800 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:16:00,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:16:00,801 INFO L85 PathProgramCache]: Analyzing trace with hash -821159404, now seen corresponding path program 1 times [2024-11-28 05:16:00,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:16:00,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736821785] [2024-11-28 05:16:00,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:00,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:16:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:16:00,950 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-28 05:16:00,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:16:00,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736821785] [2024-11-28 05:16:00,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736821785] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:16:00,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053165913] [2024-11-28 05:16:00,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:00,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:16:00,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:16:00,954 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:16:00,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-28 05:16:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:16:01,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-28 05:16:01,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:16:01,273 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-28 05:16:01,555 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 05:16:01,557 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:16:01,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053165913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:16:01,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 05:16:01,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2024-11-28 05:16:01,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629966167] [2024-11-28 05:16:01,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:16:01,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:16:01,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:16:01,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:16:01,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:16:01,559 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 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-28 05:16:01,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:16:01,900 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-11-28 05:16:01,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:16:01,901 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 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 58 [2024-11-28 05:16:01,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:16:01,902 INFO L225 Difference]: With dead ends: 71 [2024-11-28 05:16:01,902 INFO L226 Difference]: Without dead ends: 71 [2024-11-28 05:16:01,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:16:01,902 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:16:01,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 120 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:16:01,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-28 05:16:01,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-28 05:16:01,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.121212121212121) internal successors, (74), 70 states have internal predecessors, (74), 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-28 05:16:01,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2024-11-28 05:16:01,906 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 58 [2024-11-28 05:16:01,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:16:01,906 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2024-11-28 05:16:01,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 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-28 05:16:01,906 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2024-11-28 05:16:01,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-28 05:16:01,907 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:16:01,907 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:16:01,917 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-28 05:16:02,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-28 05:16:02,111 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:16:02,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:16:02,112 INFO L85 PathProgramCache]: Analyzing trace with hash -821159403, now seen corresponding path program 1 times [2024-11-28 05:16:02,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:16:02,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850514220] [2024-11-28 05:16:02,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:02,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:16:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:16:02,496 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 05:16:02,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:16:02,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850514220] [2024-11-28 05:16:02,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850514220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:16:02,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:16:02,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 05:16:02,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876487517] [2024-11-28 05:16:02,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:16:02,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:16:02,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:16:02,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:16:02,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:16:02,499 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 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-28 05:16:02,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:16:02,893 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2024-11-28 05:16:02,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:16:02,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 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 58 [2024-11-28 05:16:02,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:16:02,895 INFO L225 Difference]: With dead ends: 73 [2024-11-28 05:16:02,895 INFO L226 Difference]: Without dead ends: 73 [2024-11-28 05:16:02,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:16:02,899 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 9 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:16:02,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 142 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 05:16:02,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-28 05:16:02,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-28 05:16:02,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 72 states have internal predecessors, (75), 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-28 05:16:02,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2024-11-28 05:16:02,905 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 58 [2024-11-28 05:16:02,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:16:02,905 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2024-11-28 05:16:02,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 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-28 05:16:02,905 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2024-11-28 05:16:02,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-28 05:16:02,905 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:16:02,905 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:16:02,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-28 05:16:02,906 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:16:02,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:16:02,906 INFO L85 PathProgramCache]: Analyzing trace with hash 313864707, now seen corresponding path program 1 times [2024-11-28 05:16:02,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:16:02,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247626128] [2024-11-28 05:16:02,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:02,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:16:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:16:03,108 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 05:16:03,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:16:03,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247626128] [2024-11-28 05:16:03,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247626128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:16:03,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:16:03,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 05:16:03,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852853454] [2024-11-28 05:16:03,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:16:03,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:16:03,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:16:03,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:16:03,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:16:03,111 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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-28 05:16:03,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:16:03,391 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2024-11-28 05:16:03,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:16:03,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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 59 [2024-11-28 05:16:03,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:16:03,393 INFO L225 Difference]: With dead ends: 75 [2024-11-28 05:16:03,393 INFO L226 Difference]: Without dead ends: 75 [2024-11-28 05:16:03,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:16:03,394 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:16:03,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 176 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:16:03,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-28 05:16:03,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2024-11-28 05:16:03,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.088235294117647) internal successors, (74), 72 states have internal predecessors, (74), 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-28 05:16:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2024-11-28 05:16:03,398 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 59 [2024-11-28 05:16:03,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:16:03,398 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2024-11-28 05:16:03,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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-28 05:16:03,398 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2024-11-28 05:16:03,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-28 05:16:03,399 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:16:03,399 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:16:03,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-28 05:16:03,399 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:16:03,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:16:03,400 INFO L85 PathProgramCache]: Analyzing trace with hash 974020760, now seen corresponding path program 1 times [2024-11-28 05:16:03,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:16:03,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809345437] [2024-11-28 05:16:03,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:03,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:16:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:16:03,630 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 05:16:03,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:16:03,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809345437] [2024-11-28 05:16:03,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809345437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:16:03,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:16:03,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 05:16:03,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181595531] [2024-11-28 05:16:03,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:16:03,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:16:03,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:16:03,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:16:03,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:16:03,632 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 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-28 05:16:03,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:16:03,967 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2024-11-28 05:16:03,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:16:03,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 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 61 [2024-11-28 05:16:03,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:16:03,968 INFO L225 Difference]: With dead ends: 74 [2024-11-28 05:16:03,968 INFO L226 Difference]: Without dead ends: 74 [2024-11-28 05:16:03,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:16:03,969 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 9 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:16:03,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 164 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:16:03,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-28 05:16:03,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-28 05:16:03,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 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-28 05:16:03,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2024-11-28 05:16:03,976 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 61 [2024-11-28 05:16:03,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:16:03,976 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2024-11-28 05:16:03,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 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-28 05:16:03,977 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2024-11-28 05:16:03,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-28 05:16:03,977 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:16:03,977 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:16:03,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-28 05:16:03,978 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:16:03,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:16:03,978 INFO L85 PathProgramCache]: Analyzing trace with hash 253581756, now seen corresponding path program 1 times [2024-11-28 05:16:03,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:16:03,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463300754] [2024-11-28 05:16:03,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:03,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:16:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:16:05,897 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-28 05:16:05,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:16:05,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463300754] [2024-11-28 05:16:05,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463300754] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:16:05,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346750866] [2024-11-28 05:16:05,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:05,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:16:05,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:16:05,901 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:16:05,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-28 05:16:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:16:06,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-28 05:16:06,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:16:06,203 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-28 05:16:06,294 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:16:06,294 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-28 05:16:06,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:16:06,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 05:16:06,596 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:16:06,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-28 05:16:07,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:16:07,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:16:07,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:07,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-11-28 05:16:07,638 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:16:07,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-28 05:16:08,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:08,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 34 treesize of output 32 [2024-11-28 05:16:08,604 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 05:16:08,604 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 13 [2024-11-28 05:16:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-28 05:16:08,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:16:09,173 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2451 (Array Int Int))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2451) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) is different from false [2024-11-28 05:16:09,192 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2451 (Array Int Int))) (= 1 (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2451) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) is different from false [2024-11-28 05:16:09,205 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2451 (Array Int Int))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_2451) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) is different from false [2024-11-28 05:16:09,384 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2450 (Array Int Int))) (or (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2450))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2451)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2450 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_2450)))) is different from false [2024-11-28 05:16:09,422 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2450 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_69| Int)) (or (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_69| (select v_ArrVal_2450 |v_ULTIMATE.start_dll_update_at_~head#1.offset_69|)) v_ArrVal_2450)) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2450) (select v_ArrVal_2450 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2451) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_69|))) is different from false [2024-11-28 05:16:09,466 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2450 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_69| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_69|) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_69| (select v_ArrVal_2450 |v_ULTIMATE.start_dll_update_at_~head#1.offset_69|)) v_ArrVal_2450)) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base| 0) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2450) (select v_ArrVal_2450 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_2451) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)) 1))) is different from false [2024-11-28 05:16:09,491 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2450 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_69| Int)) (or (= (select (store |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base| 0) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2450) (select v_ArrVal_2450 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2451) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 1) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_69| (select v_ArrVal_2450 |v_ULTIMATE.start_dll_update_at_~head#1.offset_69|)) v_ArrVal_2450)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_69|))) is different from false [2024-11-28 05:16:09,544 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2450 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_69| Int)) (or (= (select (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2450) (select v_ArrVal_2450 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2451) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 1) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_69|) (not (= v_ArrVal_2450 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_69| (select v_ArrVal_2450 |v_ULTIMATE.start_dll_update_at_~head#1.offset_69|)))))) is different from false [2024-11-28 05:16:09,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:09,578 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 51 treesize of output 55 [2024-11-28 05:16:09,696 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_69| Int)) (or (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2450 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2449))) (or (not (= v_ArrVal_2450 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_69| (select v_ArrVal_2450 |v_ULTIMATE.start_dll_update_at_~head#1.offset_69|)))) (forall ((v_ArrVal_2451 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2450) (select v_ArrVal_2450 .cse1) v_ArrVal_2451) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_69|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_69| Int)) (or (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2450 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2449))) (or (not (= v_ArrVal_2450 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_69| (select v_ArrVal_2450 |v_ULTIMATE.start_dll_update_at_~head#1.offset_69|)))) (forall ((v_ArrVal_2451 (Array Int Int))) (not (= (select (select (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2450) (select v_ArrVal_2450 .cse1) v_ArrVal_2451) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_69|))))) is different from false [2024-11-28 05:16:09,825 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0))) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_69| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_69|) (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2450 (Array Int Int))) (or (not (= v_ArrVal_2450 (store (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2449) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_69| (select v_ArrVal_2450 |v_ULTIMATE.start_dll_update_at_~head#1.offset_69|)))) (forall ((v_ArrVal_2451 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2449) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2450) (select v_ArrVal_2450 .cse1) v_ArrVal_2451) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_69| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_69|) (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2450 (Array Int Int))) (or (not (= v_ArrVal_2450 (store (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2449) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_69| (select v_ArrVal_2450 |v_ULTIMATE.start_dll_update_at_~head#1.offset_69|)))) (forall ((v_ArrVal_2451 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2449) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2450) (select v_ArrVal_2450 .cse1) v_ArrVal_2451) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))))) is different from false [2024-11-28 05:16:09,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:09,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 62 [2024-11-28 05:16:09,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2024-11-28 05:16:09,885 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:16:09,887 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:16:09,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:09,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 56 [2024-11-28 05:16:09,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:09,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2024-11-28 05:16:09,937 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 11 [2024-11-28 05:16:09,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-28 05:16:09,980 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:16:10,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:10,022 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 23 treesize of output 31 [2024-11-28 05:16:10,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:10,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 35 [2024-11-28 05:16:10,120 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:16:10,134 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-28 05:16:10,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 1 [2024-11-28 05:16:10,480 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 11 not checked. [2024-11-28 05:16:10,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346750866] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:16:10,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:16:10,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 54 [2024-11-28 05:16:10,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581086997] [2024-11-28 05:16:10,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:16:10,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-28 05:16:10,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:16:10,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-28 05:16:10,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1799, Unknown=38, NotChecked=950, Total=2970 [2024-11-28 05:16:10,483 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand has 55 states, 54 states have (on average 2.8518518518518516) internal successors, (154), 55 states have internal predecessors, (154), 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-28 05:16:14,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:16:14,097 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2024-11-28 05:16:14,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 05:16:14,097 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.8518518518518516) internal successors, (154), 55 states have internal predecessors, (154), 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 64 [2024-11-28 05:16:14,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:16:14,098 INFO L225 Difference]: With dead ends: 84 [2024-11-28 05:16:14,098 INFO L226 Difference]: Without dead ends: 84 [2024-11-28 05:16:14,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 94 SyntacticMatches, 7 SemanticMatches, 69 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=373, Invalid=3285, Unknown=42, NotChecked=1270, Total=4970 [2024-11-28 05:16:14,100 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 52 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 1816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 714 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:16:14,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 588 Invalid, 1816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1089 Invalid, 0 Unknown, 714 Unchecked, 1.7s Time] [2024-11-28 05:16:14,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-28 05:16:14,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2024-11-28 05:16:14,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.1111111111111112) internal successors, (80), 76 states have internal predecessors, (80), 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-28 05:16:14,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2024-11-28 05:16:14,107 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 64 [2024-11-28 05:16:14,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:16:14,107 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2024-11-28 05:16:14,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.8518518518518516) internal successors, (154), 55 states have internal predecessors, (154), 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-28 05:16:14,108 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2024-11-28 05:16:14,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-28 05:16:14,109 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:16:14,109 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:16:14,121 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-28 05:16:14,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:16:14,310 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:16:14,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:16:14,310 INFO L85 PathProgramCache]: Analyzing trace with hash 253581757, now seen corresponding path program 1 times [2024-11-28 05:16:14,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:16:14,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442943691] [2024-11-28 05:16:14,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:14,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:16:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:16:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 05:16:17,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:16:17,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442943691] [2024-11-28 05:16:17,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442943691] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:16:17,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53592557] [2024-11-28 05:16:17,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:17,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:16:17,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:16:17,392 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:16:17,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-28 05:16:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:16:17,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-11-28 05:16:17,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:16:17,734 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-28 05:16:18,046 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:16:18,046 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-28 05:16:18,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:16:18,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:16:18,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 05:16:18,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 05:16:18,486 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:16:18,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-28 05:16:18,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 05:16:19,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:16:19,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:16:19,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2024-11-28 05:16:19,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:16:19,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 05:16:19,917 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:16:19,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-28 05:16:19,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 05:16:20,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:20,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-11-28 05:16:20,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:20,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 34 treesize of output 32 [2024-11-28 05:16:21,274 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-28 05:16:21,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:16:23,253 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_2580 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2580))) (or (not (= v_ArrVal_2580 (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2580 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_2579 (Array Int Int))) (or (forall ((v_ArrVal_2582 (Array Int Int))) (<= 0 (+ (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2579) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_2582) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (not (= (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2579 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_2579)))) (< (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0)))) (forall ((v_ArrVal_2580 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2580))) (or (forall ((v_ArrVal_2579 (Array Int Int))) (or (forall ((v_ArrVal_2582 (Array Int Int)) (v_ArrVal_2581 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2579))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (<= (+ (select (select (store .cse4 .cse5 v_ArrVal_2582) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2581) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) (not (= (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2579 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_2579)))) (not (= v_ArrVal_2580 (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2580 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (< (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0)))))) is different from false [2024-11-28 05:16:23,415 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_77| Int) (v_ArrVal_2582 (Array Int Int)) (v_ArrVal_2580 (Array Int Int))) (or (< 0 (+ 5 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2580) (select .cse0 .cse1) v_ArrVal_2582) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (not (= v_ArrVal_2580 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_77| (select v_ArrVal_2580 |v_ULTIMATE.start_dll_update_at_~head#1.offset_77|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_77|) (< (select v_ArrVal_2580 .cse1) 0))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_77| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_77|) (forall ((v_ArrVal_2580 (Array Int Int))) (or (not (= v_ArrVal_2580 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_77| (select v_ArrVal_2580 |v_ULTIMATE.start_dll_update_at_~head#1.offset_77|)))) (forall ((v_ArrVal_2579 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_77| (select v_ArrVal_2579 |v_ULTIMATE.start_dll_update_at_~head#1.offset_77|)) v_ArrVal_2579)) (forall ((v_ArrVal_2582 (Array Int Int)) (v_ArrVal_2581 (Array Int Int))) (let ((.cse3 (select v_ArrVal_2579 .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2580) .cse3 v_ArrVal_2582) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2579) .cse3 v_ArrVal_2581) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))))) (< (select v_ArrVal_2580 .cse1) 0))))))) is different from false [2024-11-28 05:16:23,578 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_77| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_77|) (forall ((v_ArrVal_2580 (Array Int Int))) (or (forall ((v_ArrVal_2579 (Array Int Int))) (or (forall ((v_ArrVal_2582 (Array Int Int)) (v_ArrVal_2581 (Array Int Int))) (let ((.cse0 (select v_ArrVal_2579 .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2580) .cse0 v_ArrVal_2582) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2579) .cse0 v_ArrVal_2581) |c_ULTIMATE.start_dll_create_#res#1.base|) 4))))) (not (= v_ArrVal_2579 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_77| (select v_ArrVal_2579 |v_ULTIMATE.start_dll_update_at_~head#1.offset_77|)))))) (< (select v_ArrVal_2580 .cse1) 0) (not (= (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_77| (select v_ArrVal_2580 |v_ULTIMATE.start_dll_update_at_~head#1.offset_77|)) v_ArrVal_2580)))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_77| Int) (v_ArrVal_2582 (Array Int Int)) (v_ArrVal_2580 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_77|) (< (select v_ArrVal_2580 .cse1) 0) (< 0 (+ 5 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2580) (select .cse2 .cse1) v_ArrVal_2582) |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (not (= (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_77| (select v_ArrVal_2580 |v_ULTIMATE.start_dll_update_at_~head#1.offset_77|)) v_ArrVal_2580)))))) is different from false [2024-11-28 05:16:33,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:33,111 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 141 treesize of output 145 [2024-11-28 05:16:33,427 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_prenex_28 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_28) (forall ((v_prenex_29 (Array Int Int))) (or (< (select v_prenex_29 .cse0) 0) (forall ((v_prenex_25 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_25))) (or (forall ((v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (< (select (select (store (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_29) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_26) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) v_prenex_27) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5))) (not (= (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_28 (select v_prenex_29 v_prenex_28)) v_prenex_29))))))))) (forall ((v_ArrVal_2578 (Array Int Int)) (v_ArrVal_2577 (Array Int Int)) (v_ArrVal_2582 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_77| Int) (v_ArrVal_2580 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2578))) (or (not (= (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_77| (select v_ArrVal_2580 |v_ULTIMATE.start_dll_update_at_~head#1.offset_77|)) v_ArrVal_2580)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_77|) (< 0 (+ 5 (select (select (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2580) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2577) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) v_ArrVal_2582) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (< (select v_ArrVal_2580 .cse0) 0)))) (or (forall ((v_prenex_25 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_25) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) 0)) (forall ((v_prenex_28 Int) (v_ArrVal_2579 (Array Int Int)) (v_ArrVal_2581 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_26))) (or (= (select (select (store (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2579) (select v_ArrVal_2579 .cse0) v_ArrVal_2581) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_28) (not (= v_ArrVal_2579 (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_28 (select v_ArrVal_2579 v_prenex_28)))))))))) is different from false [2024-11-28 05:16:33,657 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 0))) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_2578 (Array Int Int)) (v_ArrVal_2577 (Array Int Int)) (v_ArrVal_2576 Int) (v_ArrVal_2582 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_77| Int) (v_ArrVal_2580 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_77|) (not (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_2576)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2578) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_77| (select v_ArrVal_2580 |v_ULTIMATE.start_dll_update_at_~head#1.offset_77|)) v_ArrVal_2580)) (< (select v_ArrVal_2580 .cse2) 0) (< 0 (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2578) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2580) (select (select (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2577) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) v_ArrVal_2582) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 5)))) (or (forall ((v_prenex_25 (Array Int Int)) (v_ArrVal_2576 Int)) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_2576)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_25) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) 0)) (forall ((v_prenex_28 Int) (v_ArrVal_2579 (Array Int Int)) (v_ArrVal_2581 (Array Int Int)) (v_prenex_26 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_26) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2579) (select v_ArrVal_2579 .cse2) v_ArrVal_2581) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_28) (not (= (store (select (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_26) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_28 (select v_ArrVal_2579 v_prenex_28)) v_ArrVal_2579))))) (forall ((v_prenex_28 Int) (v_ArrVal_2576 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_28) (forall ((v_prenex_29 (Array Int Int))) (or (forall ((v_prenex_25 (Array Int Int))) (or (not (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_2576)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_25) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_28 (select v_prenex_29 v_prenex_28)) v_prenex_29)) (forall ((v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (< (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_25) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_29) (select (select (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_26) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) v_prenex_27) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5))))) (< (select v_prenex_29 .cse2) 0)))))))) is different from false [2024-11-28 05:16:33,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:33,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 62 [2024-11-28 05:16:33,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2024-11-28 05:16:33,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:33,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2024-11-28 05:16:33,723 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:16:33,724 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:16:33,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:33,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 51 [2024-11-28 05:16:33,750 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 11 [2024-11-28 05:16:33,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-28 05:16:33,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:33,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 35 [2024-11-28 05:16:33,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:33,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2024-11-28 05:16:33,892 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 36 treesize of output 24 [2024-11-28 05:16:33,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-28 05:16:33,915 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:16:33,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:33,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 106 [2024-11-28 05:16:33,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:33,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 62 [2024-11-28 05:16:33,972 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:16:33,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2024-11-28 05:16:33,984 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:16:33,987 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 22 treesize of output 18 [2024-11-28 05:16:34,000 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:16:34,020 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 05:16:34,020 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 43 treesize of output 36 [2024-11-28 05:16:34,043 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:16:34,055 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-28 05:16:34,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 1 [2024-11-28 05:16:34,663 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 8 not checked. [2024-11-28 05:16:34,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53592557] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:16:34,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:16:34,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20, 21] total 63 [2024-11-28 05:16:34,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118983827] [2024-11-28 05:16:34,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:16:34,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-28 05:16:34,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:16:34,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-28 05:16:34,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=3174, Unknown=52, NotChecked=590, Total=4032 [2024-11-28 05:16:34,667 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 64 states, 63 states have (on average 2.6825396825396823) internal successors, (169), 64 states have internal predecessors, (169), 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-28 05:16:41,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:16:41,612 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2024-11-28 05:16:41,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-28 05:16:41,613 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 2.6825396825396823) internal successors, (169), 64 states have internal predecessors, (169), 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 64 [2024-11-28 05:16:41,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:16:41,614 INFO L225 Difference]: With dead ends: 86 [2024-11-28 05:16:41,614 INFO L226 Difference]: Without dead ends: 86 [2024-11-28 05:16:41,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=475, Invalid=5653, Unknown=54, NotChecked=790, Total=6972 [2024-11-28 05:16:41,616 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 85 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 340 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:16:41,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 817 Invalid, 1828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1471 Invalid, 0 Unknown, 340 Unchecked, 2.7s Time] [2024-11-28 05:16:41,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-28 05:16:41,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2024-11-28 05:16:41,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 78 states have internal predecessors, (81), 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-28 05:16:41,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2024-11-28 05:16:41,620 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 64 [2024-11-28 05:16:41,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:16:41,620 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2024-11-28 05:16:41,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 2.6825396825396823) internal successors, (169), 64 states have internal predecessors, (169), 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-28 05:16:41,620 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2024-11-28 05:16:41,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-28 05:16:41,629 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:16:41,629 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:16:41,641 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-28 05:16:41,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-28 05:16:41,830 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:16:41,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:16:41,830 INFO L85 PathProgramCache]: Analyzing trace with hash -728897701, now seen corresponding path program 1 times [2024-11-28 05:16:41,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:16:41,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107883106] [2024-11-28 05:16:41,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:41,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:16:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:16:43,203 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-28 05:16:43,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:16:43,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107883106] [2024-11-28 05:16:43,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107883106] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:16:43,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194924493] [2024-11-28 05:16:43,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:43,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:16:43,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:16:43,207 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:16:43,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-28 05:16:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:16:43,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-28 05:16:43,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:16:43,551 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-28 05:16:43,697 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:16:43,697 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-28 05:16:43,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:16:43,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 05:16:44,079 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:16:44,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 37 [2024-11-28 05:16:44,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:16:44,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:16:44,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:44,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2024-11-28 05:16:45,108 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:16:45,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 37 [2024-11-28 05:16:45,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:45,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 33 treesize of output 31 [2024-11-28 05:16:45,811 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-28 05:16:45,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:16:46,263 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2706 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2706) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2024-11-28 05:16:46,576 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2706 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2706) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2024-11-28 05:16:46,601 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2706 (Array Int Int)) (v_ArrVal_2705 (Array Int Int))) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2705))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2706)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0)) (not (= v_ArrVal_2705 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2705 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))))) is different from false [2024-11-28 05:16:46,634 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_84| Int) (v_ArrVal_2706 (Array Int Int)) (v_ArrVal_2705 (Array Int Int))) (or (not (= v_ArrVal_2705 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_84| (select v_ArrVal_2705 |v_ULTIMATE.start_dll_update_at_~head#1.offset_84|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_84|) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2705) (select v_ArrVal_2705 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2706) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0)))) is different from false [2024-11-28 05:16:46,671 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_84| Int) (v_ArrVal_2706 (Array Int Int)) (v_ArrVal_2705 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_84|) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2705) (select v_ArrVal_2705 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_2706) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0)) (not (= v_ArrVal_2705 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_84| (select v_ArrVal_2705 |v_ULTIMATE.start_dll_update_at_~head#1.offset_84|)))))) is different from false [2024-11-28 05:16:46,693 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_84| Int) (v_ArrVal_2706 (Array Int Int)) (v_ArrVal_2705 (Array Int Int))) (or (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_84| (select v_ArrVal_2705 |v_ULTIMATE.start_dll_update_at_~head#1.offset_84|)) v_ArrVal_2705)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_84|) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2705) (select v_ArrVal_2705 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2706) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)))) is different from false [2024-11-28 05:16:46,730 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_84| Int) (v_ArrVal_2706 (Array Int Int)) (v_ArrVal_2705 (Array Int Int))) (or (not (= v_ArrVal_2705 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_84| (select v_ArrVal_2705 |v_ULTIMATE.start_dll_update_at_~head#1.offset_84|)))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2705) (select v_ArrVal_2705 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2706) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_84|))) is different from false [2024-11-28 05:16:46,756 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2704 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_84| Int) (v_ArrVal_2706 (Array Int Int)) (v_ArrVal_2705 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2704))) (or (not (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2705) (select v_ArrVal_2705 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2706) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (not (= (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_84| (select v_ArrVal_2705 |v_ULTIMATE.start_dll_update_at_~head#1.offset_84|)) v_ArrVal_2705)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_84|)))) is different from false [2024-11-28 05:16:47,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:47,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 65 [2024-11-28 05:16:47,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2024-11-28 05:16:47,200 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:16:47,202 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:16:47,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:47,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 56 [2024-11-28 05:16:47,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:47,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2024-11-28 05:16:47,243 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 30 treesize of output 28 [2024-11-28 05:16:47,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-28 05:16:47,297 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:16:47,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:47,326 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 24 treesize of output 32 [2024-11-28 05:16:47,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:47,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 36 [2024-11-28 05:16:48,200 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 11 not checked. [2024-11-28 05:16:48,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194924493] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:16:48,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:16:48,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22, 23] total 53 [2024-11-28 05:16:48,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953041291] [2024-11-28 05:16:48,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:16:48,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-28 05:16:48,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:16:48,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-28 05:16:48,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1828, Unknown=30, NotChecked=744, Total=2756 [2024-11-28 05:16:48,203 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 53 states, 53 states have (on average 2.9245283018867925) internal successors, (155), 53 states have internal predecessors, (155), 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-28 05:16:53,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:16:53,684 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2024-11-28 05:16:53,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-28 05:16:53,684 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.9245283018867925) internal successors, (155), 53 states have internal predecessors, (155), 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 65 [2024-11-28 05:16:53,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:16:53,685 INFO L225 Difference]: With dead ends: 86 [2024-11-28 05:16:53,685 INFO L226 Difference]: Without dead ends: 86 [2024-11-28 05:16:53,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 97 SyntacticMatches, 4 SemanticMatches, 79 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=499, Invalid=4759, Unknown=30, NotChecked=1192, Total=6480 [2024-11-28 05:16:53,686 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 90 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 593 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:16:53,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 722 Invalid, 1946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1334 Invalid, 0 Unknown, 593 Unchecked, 2.2s Time] [2024-11-28 05:16:53,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-28 05:16:53,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2024-11-28 05:16:53,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 78 states have internal predecessors, (80), 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-28 05:16:53,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2024-11-28 05:16:53,690 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 65 [2024-11-28 05:16:53,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:16:53,690 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2024-11-28 05:16:53,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.9245283018867925) internal successors, (155), 53 states have internal predecessors, (155), 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-28 05:16:53,691 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2024-11-28 05:16:53,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-28 05:16:53,691 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:16:53,691 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:16:53,705 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-28 05:16:53,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-28 05:16:53,892 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:16:53,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:16:53,893 INFO L85 PathProgramCache]: Analyzing trace with hash -393273360, now seen corresponding path program 1 times [2024-11-28 05:16:53,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:16:53,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638229534] [2024-11-28 05:16:53,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:53,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:16:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:16:56,086 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 05:16:56,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:16:56,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638229534] [2024-11-28 05:16:56,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638229534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:16:56,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505514469] [2024-11-28 05:16:56,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:56,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:16:56,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:16:56,089 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:16:56,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-28 05:16:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:16:56,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-28 05:16:56,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:16:56,501 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-28 05:16:56,653 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:16:56,653 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-28 05:16:56,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:16:56,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 05:16:56,949 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:16:56,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-28 05:16:57,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:16:57,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:16:57,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:57,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-11-28 05:16:57,994 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:16:57,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-28 05:16:58,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:58,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 34 treesize of output 32 [2024-11-28 05:16:58,768 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-28 05:16:58,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:16:59,895 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2830 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2830) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2024-11-28 05:16:59,922 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2830 (Array Int Int)) (v_ArrVal_2829 (Array Int Int))) (or (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2829 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_2829)) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2829))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2830)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2024-11-28 05:16:59,967 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_91| Int) (v_ArrVal_2830 (Array Int Int)) (v_ArrVal_2829 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2829) (select v_ArrVal_2829 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2830) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_91| (select v_ArrVal_2829 |v_ULTIMATE.start_dll_update_at_~head#1.offset_91|)) v_ArrVal_2829)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_91|))) is different from false [2024-11-28 05:17:00,020 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_91| Int) (v_ArrVal_2830 (Array Int Int)) (v_ArrVal_2829 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2829) (select v_ArrVal_2829 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_2830) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) |c_#StackHeapBarrier|) (not (= v_ArrVal_2829 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_91| (select v_ArrVal_2829 |v_ULTIMATE.start_dll_update_at_~head#1.offset_91|)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_91|))) is different from false [2024-11-28 05:17:00,045 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_91| Int) (v_ArrVal_2830 (Array Int Int)) (v_ArrVal_2829 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_91|) (< (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2829) (select v_ArrVal_2829 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2830) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) |c_#StackHeapBarrier|) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_91| (select v_ArrVal_2829 |v_ULTIMATE.start_dll_update_at_~head#1.offset_91|)) v_ArrVal_2829)))) is different from false [2024-11-28 05:17:00,086 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_91| Int) (v_ArrVal_2830 (Array Int Int)) (v_ArrVal_2829 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_91|) (< (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2829) (select v_ArrVal_2829 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2830) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|) (not (= v_ArrVal_2829 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_91| (select v_ArrVal_2829 |v_ULTIMATE.start_dll_update_at_~head#1.offset_91|)))))) is different from false [2024-11-28 05:17:00,114 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_91| Int) (v_ArrVal_2830 (Array Int Int)) (v_ArrVal_2829 (Array Int Int)) (v_ArrVal_2828 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2828))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2829) (select v_ArrVal_2829 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2830) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_91|) (not (= (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_91| (select v_ArrVal_2829 |v_ULTIMATE.start_dll_update_at_~head#1.offset_91|)) v_ArrVal_2829))))) is different from false [2024-11-28 05:17:00,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:17:00,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 62 [2024-11-28 05:17:00,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2024-11-28 05:17:00,478 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:17:00,479 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:17:00,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:17:00,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 56 [2024-11-28 05:17:00,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:17:00,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2024-11-28 05:17:00,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-28 05:17:00,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-28 05:17:00,586 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:17:00,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:17:00,629 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 25 treesize of output 33 [2024-11-28 05:17:00,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:17:00,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 37 [2024-11-28 05:17:01,322 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 11 not checked. [2024-11-28 05:17:01,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505514469] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:17:01,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:17:01,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 21] total 54 [2024-11-28 05:17:01,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992779861] [2024-11-28 05:17:01,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:17:01,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-28 05:17:01,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:01,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-28 05:17:01,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2038, Unknown=68, NotChecked=686, Total=2970 [2024-11-28 05:17:01,324 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 55 states, 54 states have (on average 2.8703703703703702) internal successors, (155), 55 states have internal predecessors, (155), 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-28 05:17:05,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:05,893 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2024-11-28 05:17:05,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-28 05:17:05,894 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.8703703703703702) internal successors, (155), 55 states have internal predecessors, (155), 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 67 [2024-11-28 05:17:05,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:05,895 INFO L225 Difference]: With dead ends: 87 [2024-11-28 05:17:05,895 INFO L226 Difference]: Without dead ends: 87 [2024-11-28 05:17:05,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 101 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=374, Invalid=3737, Unknown=77, NotChecked=924, Total=5112 [2024-11-28 05:17:05,895 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 63 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 1885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 475 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:05,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 955 Invalid, 1885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1401 Invalid, 0 Unknown, 475 Unchecked, 2.4s Time] [2024-11-28 05:17:05,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-28 05:17:05,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2024-11-28 05:17:05,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.08) internal successors, (81), 79 states have internal predecessors, (81), 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-28 05:17:05,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2024-11-28 05:17:05,899 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 67 [2024-11-28 05:17:05,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:05,899 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2024-11-28 05:17:05,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.8703703703703702) internal successors, (155), 55 states have internal predecessors, (155), 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-28 05:17:05,899 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2024-11-28 05:17:05,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 05:17:05,900 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:05,900 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:17:05,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-11-28 05:17:06,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-28 05:17:06,101 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:17:06,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:06,101 INFO L85 PathProgramCache]: Analyzing trace with hash 664288100, now seen corresponding path program 2 times [2024-11-28 05:17:06,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:06,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999243533] [2024-11-28 05:17:06,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:17:06,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:06,144 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:17:06,144 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:17:10,863 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-28 05:17:10,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:10,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999243533] [2024-11-28 05:17:10,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999243533] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:17:10,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675456926] [2024-11-28 05:17:10,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:17:10,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:17:10,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:17:10,866 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:17:10,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-28 05:17:11,208 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:17:11,208 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:17:11,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-11-28 05:17:11,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:17:11,255 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-28 05:17:11,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:17:11,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:17:11,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 05:17:11,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 05:17:11,681 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:17:11,681 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-28 05:17:11,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-28 05:17:11,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 05:17:11,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 05:17:11,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-28 05:17:12,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-11-28 05:17:12,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-28 05:17:12,331 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-28 05:17:12,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 71 [2024-11-28 05:17:12,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2024-11-28 05:17:13,254 INFO L349 Elim1Store]: treesize reduction 68, result has 30.6 percent of original size [2024-11-28 05:17:13,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 50 [2024-11-28 05:17:13,291 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-28 05:17:13,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-11-28 05:17:15,042 INFO L349 Elim1Store]: treesize reduction 136, result has 45.2 percent of original size [2024-11-28 05:17:15,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 146 treesize of output 195 [2024-11-28 05:17:15,417 INFO L349 Elim1Store]: treesize reduction 108, result has 47.3 percent of original size [2024-11-28 05:17:15,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 76 treesize of output 139 [2024-11-28 05:18:51,747 INFO L349 Elim1Store]: treesize reduction 33, result has 19.5 percent of original size [2024-11-28 05:18:51,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 41 [2024-11-28 05:18:51,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:18:51,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 24 treesize of output 18 [2024-11-28 05:18:51,881 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 05:18:51,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:20:06,745 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((v_ArrVal_2968 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_96| Int) (v_ArrVal_2971 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_99| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2968)) (.cse3 (select v_ArrVal_2968 4))) (or (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|) (< (select .cse0 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|) (= 0 (select (let ((.cse1 (store .cse2 .cse3 v_ArrVal_2971))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) 4)) (not (= v_ArrVal_2971 (store (select .cse2 .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2971 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)))) (not (= (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99| (select v_ArrVal_2968 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|)) v_ArrVal_2968))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_99| Int)) (or (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|) (forall ((v_ArrVal_2969 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99| (select v_ArrVal_2969 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|)) v_ArrVal_2969)) (forall ((v_ArrVal_2968 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_96| Int) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2969)) (.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2968)) (.cse6 (select v_ArrVal_2968 4))) (or (not (= (store (select .cse5 .cse6) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2970 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)) v_ArrVal_2970)) (= (select (select (store .cse5 .cse6 v_ArrVal_2970) (select (select (store .cse7 .cse6 v_ArrVal_2971) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 4) 0) (not (= v_ArrVal_2971 (store (select .cse7 .cse6) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2971 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)))) (< (select v_ArrVal_2969 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)))) (not (= (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99| (select v_ArrVal_2968 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|)) v_ArrVal_2968)))))))))) is different from false [2024-11-28 05:20:07,100 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (forall ((v_ArrVal_2968 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_96| Int) (v_ArrVal_2971 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_99| Int)) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2968)) (.cse2 (select v_ArrVal_2968 4))) (or (= (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_2971))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) 4) 0) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|) (not (= v_ArrVal_2971 (store (select .cse1 .cse2) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2971 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)))) (< (select .cse3 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|) (not (= (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99| (select v_ArrVal_2968 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|)) v_ArrVal_2968))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_99| Int)) (or (forall ((v_ArrVal_2969 (Array Int Int))) (or (forall ((v_ArrVal_2968 (Array Int Int))) (or (not (= (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99| (select v_ArrVal_2968 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|)) v_ArrVal_2968)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_96| Int) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2969)) (.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2968)) (.cse6 (select v_ArrVal_2968 4))) (or (not (= v_ArrVal_2971 (store (select .cse5 .cse6) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2971 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)))) (not (= v_ArrVal_2970 (store (select .cse7 .cse6) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2970 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)))) (= (select (select (store .cse7 .cse6 v_ArrVal_2970) (select (select (store .cse5 .cse6 v_ArrVal_2971) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)) 4) 0) (< (select v_ArrVal_2969 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)))))) (not (= v_ArrVal_2969 (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99| (select v_ArrVal_2969 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|)))))) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|))))) is different from false [2024-11-28 05:20:07,287 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (forall ((v_ArrVal_2968 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_96| Int) (v_ArrVal_2971 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_99| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2968)) (.cse3 (select v_ArrVal_2968 4))) (or (not (= (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99| (select v_ArrVal_2968 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|)) v_ArrVal_2968)) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|) (= (select (let ((.cse1 (store .cse2 .cse3 v_ArrVal_2971))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) 4) 0) (not (= v_ArrVal_2971 (store (select .cse2 .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2971 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)))) (< (select .cse4 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_99| Int)) (or (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|) (forall ((v_ArrVal_2969 (Array Int Int))) (or (forall ((v_ArrVal_2968 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99| (select v_ArrVal_2968 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|)) v_ArrVal_2968)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_96| Int) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2969)) (.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2968)) (.cse6 (select v_ArrVal_2968 4))) (or (not (= (store (select .cse5 .cse6) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2970 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)) v_ArrVal_2970)) (not (= v_ArrVal_2971 (store (select .cse7 .cse6) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2971 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)))) (= (select (select (store .cse5 .cse6 v_ArrVal_2970) (select (select (store .cse7 .cse6 v_ArrVal_2971) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 4) 0) (< (select v_ArrVal_2969 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)))))) (not (= v_ArrVal_2969 (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99| (select v_ArrVal_2969 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|)))))))))) is different from false [2024-11-28 05:20:07,628 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_99| Int)) (or (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|) (forall ((v_ArrVal_2969 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99| (select v_ArrVal_2969 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|)) v_ArrVal_2969)) (forall ((v_ArrVal_2968 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_96| Int) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2968)) (.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2969)) (.cse2 (select v_ArrVal_2968 4))) (or (= (select (select (store .cse1 .cse2 v_ArrVal_2970) (select (select (store .cse3 .cse2 v_ArrVal_2971) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 4) 0) (not (= v_ArrVal_2971 (store (select .cse3 .cse2) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2971 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)))) (not (= v_ArrVal_2970 (store (select .cse1 .cse2) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2970 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)))) (< (select v_ArrVal_2969 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)))) (not (= (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99| (select v_ArrVal_2968 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|)) v_ArrVal_2968)))))))) (forall ((v_ArrVal_2968 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_96| Int) (v_ArrVal_2971 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_99| Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2968)) (.cse6 (select v_ArrVal_2968 4))) (or (< (select .cse0 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|) (not (= v_ArrVal_2971 (store (select .cse5 .cse6) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2971 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)))) (= (select (let ((.cse7 (store .cse5 .cse6 v_ArrVal_2971))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 4) 0) (not (= (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99| (select v_ArrVal_2968 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|)) v_ArrVal_2968))))))) is different from false [2024-11-28 05:20:11,890 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_2966 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_99| Int) (v_ArrVal_2965 Int)) (or (forall ((v_ArrVal_2969 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse7 .cse6 v_ArrVal_2965)))) (or (forall ((v_ArrVal_2968 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse5 .cse6 v_ArrVal_2966)))) (or (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_96| Int) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2969)) (.cse2 (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2968)) (.cse1 (select v_ArrVal_2968 4))) (or (not (= v_ArrVal_2970 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2970 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)))) (= (select (select (store .cse0 .cse1 v_ArrVal_2970) (select (select (store .cse2 .cse1 v_ArrVal_2971) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 4) 0) (not (= (store (select .cse2 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2971 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)) v_ArrVal_2971)) (< (select v_ArrVal_2969 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)))) (not (= (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_99| (select v_ArrVal_2968 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|)) v_ArrVal_2968))))) (not (= v_ArrVal_2969 (store (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_99| (select v_ArrVal_2969 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|))))))) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|))) (forall ((v_ArrVal_2968 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_96| Int) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2966 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_99| Int) (v_ArrVal_2965 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse5 .cse6 v_ArrVal_2966)))) (let ((.cse8 (store .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2968)) (.cse9 (select v_ArrVal_2968 4))) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse7 .cse6 v_ArrVal_2965)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|) (not (= (store (select .cse8 .cse9) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2971 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)) v_ArrVal_2971)) (not (= (store (select .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_99| (select v_ArrVal_2968 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|)) v_ArrVal_2968)) (= (select (let ((.cse11 (store .cse8 .cse9 v_ArrVal_2971))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 4) 0))))))) is different from false [2024-11-28 05:20:16,397 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10 0)))) (let ((.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse7 (select .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_2961 Int) (v_ArrVal_2966 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_99| Int) (v_ArrVal_2965 Int)) (or (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|) (forall ((v_ArrVal_2969 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse9 .cse10 v_ArrVal_2961)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse8 v_ArrVal_2965))) (or (not (= v_ArrVal_2969 (store (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_99| (select v_ArrVal_2969 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|)))) (forall ((v_ArrVal_2968 (Array Int Int))) (let ((.cse3 (store .cse7 .cse8 v_ArrVal_2966))) (or (not (= (store (select (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse3) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_99| (select v_ArrVal_2968 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|)) v_ArrVal_2968)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_96| Int) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse3) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2968)) (.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2969)) (.cse5 (select v_ArrVal_2968 4))) (or (not (= (store (select .cse4 .cse5) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2971 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)) v_ArrVal_2971)) (= (select (select (store .cse6 .cse5 v_ArrVal_2970) (select (select (store .cse4 .cse5 v_ArrVal_2971) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 4) 0) (not (= (store (select .cse6 .cse5) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2970 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)) v_ArrVal_2970)) (< (select v_ArrVal_2969 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|))))))))))))) (forall ((v_ArrVal_2968 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_96| Int) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2961 Int) (v_ArrVal_2966 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_99| Int) (v_ArrVal_2965 Int)) (let ((.cse11 (store .cse7 .cse8 v_ArrVal_2966))) (let ((.cse12 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2968)) (.cse13 (select v_ArrVal_2968 4))) (or (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|) (not (= (store (select (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_99| (select v_ArrVal_2968 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|)) v_ArrVal_2968)) (not (= (store (select .cse12 .cse13) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2971 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)) v_ArrVal_2971)) (= (select (let ((.cse14 (store .cse12 .cse13 v_ArrVal_2971))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 4) 0) (< (select (select (let ((.cse15 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse9 .cse10 v_ArrVal_2961)))) (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse8 v_ArrVal_2965))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|))))))))) is different from false [2024-11-28 05:20:20,727 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse8 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse8 0)))) (let ((.cse9 (select .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse7 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_2968 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_96| Int) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2961 Int) (v_ArrVal_2966 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_99| Int) (v_ArrVal_2965 Int)) (let ((.cse4 (store .cse9 .cse6 v_ArrVal_2966))) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2968)) (.cse2 (select v_ArrVal_2968 4))) (or (= (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_2971))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 4) 0) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|) (not (= v_ArrVal_2968 (store (select (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_99| (select v_ArrVal_2968 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|)))) (not (= (store (select .cse1 .cse2) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2971 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)) v_ArrVal_2971)) (< (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse8 v_ArrVal_2961)))) (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_2965))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|))))) (forall ((v_ArrVal_2961 Int) (v_ArrVal_2966 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_99| Int) (v_ArrVal_2965 Int)) (or (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|) (forall ((v_ArrVal_2969 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse8 v_ArrVal_2961)))) (let ((.cse11 (store (select .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_2965))) (or (not (= (store (select (store .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_99| (select v_ArrVal_2969 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|)) v_ArrVal_2969)) (forall ((v_ArrVal_2968 (Array Int Int))) (let ((.cse15 (store .cse9 .cse6 v_ArrVal_2966))) (or (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_96| Int) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2969)) (.cse14 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse15) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2968)) (.cse13 (select v_ArrVal_2968 4))) (or (not (= (store (select .cse12 .cse13) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2970 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)) v_ArrVal_2970)) (not (= (store (select .cse14 .cse13) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2971 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)) v_ArrVal_2971)) (= (select (select (store .cse12 .cse13 v_ArrVal_2970) (select (select (store .cse14 .cse13 v_ArrVal_2971) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 4) 0) (< (select v_ArrVal_2969 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)))) (not (= v_ArrVal_2968 (store (select (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse15) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_99| (select v_ArrVal_2968 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|))))))))))))))))) is different from false [2024-11-28 05:20:20,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:20:20,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 160 treesize of output 136 [2024-11-28 05:20:20,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:20:20,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 150 treesize of output 126 [2024-11-28 05:20:21,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:20:21,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 160 treesize of output 126 [2024-11-28 05:20:21,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:20:21,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 40 [2024-11-28 05:20:25,927 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse9 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((v_arrayElimArr_33 (Array Int Int)) (v_ArrVal_2968 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_96| Int) (v_arrayElimArr_34 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int)) (v_ArrVal_2966 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_99| Int) (v_ArrVal_2965 Int) (v_ArrVal_2969 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_33)) (.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_34))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9 v_ArrVal_2966)) (.cse3 (store (select .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9 v_ArrVal_2965))) (let ((.cse5 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse3) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2969)) (.cse8 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2968)) (.cse6 (select v_ArrVal_2968 4))) (or (not (= (store (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_99| (select v_ArrVal_2968 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|)) v_ArrVal_2968)) (not (= (store (select (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse3) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_99| (select v_ArrVal_2969 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|)) v_ArrVal_2969)) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|) (not (= (select v_arrayElimArr_34 .cse4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= v_ArrVal_2970 (store (select .cse5 .cse6) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2970 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)))) (not (= (select v_arrayElimArr_34 .cse7) 0)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_33 .cse4))) (not (= v_ArrVal_2971 (store (select .cse8 .cse6) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2971 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)))) (= (select (select (store .cse5 .cse6 v_ArrVal_2970) (select (select (store .cse8 .cse6 v_ArrVal_2971) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 4) 0) (< (select v_ArrVal_2969 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)))))) (forall ((v_ArrVal_2968 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_96| Int) (v_arrayElimArr_35 (Array Int Int)) (v_arrayElimArr_36 (Array Int Int)) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2966 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_99| Int) (v_ArrVal_2965 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_35))) (let ((.cse11 (store (select .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9 v_ArrVal_2966))) (let ((.cse12 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2968)) (.cse13 (select v_ArrVal_2968 4))) (or (not (= v_ArrVal_2968 (store (select (store .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_99| (select v_ArrVal_2968 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|)))) (not (= (select v_arrayElimArr_35 .cse4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_99|) (not (= v_ArrVal_2971 (store (select .cse12 .cse13) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2971 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)))) (< (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_36))) (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9 v_ArrVal_2965))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|) (= (select (let ((.cse15 (store .cse12 .cse13 v_ArrVal_2971))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 4) 0) (not (= (select v_arrayElimArr_35 .cse7) 0)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_36 .cse4)))))))))) is different from false [2024-11-28 05:20:33,892 INFO L349 Elim1Store]: treesize reduction 60, result has 52.8 percent of original size [2024-11-28 05:20:33,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 862 treesize of output 848 [2024-11-28 05:20:34,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:20:34,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 402 treesize of output 418 [2024-11-28 05:20:34,166 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:34,187 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:34,795 INFO L349 Elim1Store]: treesize reduction 164, result has 29.0 percent of original size [2024-11-28 05:20:34,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 360 treesize of output 459 [2024-11-28 05:20:34,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:20:34,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 50 [2024-11-28 05:20:35,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2024-11-28 05:20:35,109 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 49 treesize of output 43 [2024-11-28 05:20:35,530 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 9 treesize of output 1 [2024-11-28 05:20:35,733 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 9 treesize of output 1 [2024-11-28 05:20:36,937 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-28 05:20:36,938 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 69 [2024-11-28 05:20:37,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-28 05:20:37,110 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:37,113 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:37,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:20:37,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 17 [2024-11-28 05:20:37,583 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-28 05:20:37,583 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 85 [2024-11-28 05:20:37,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-28 05:20:37,696 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:37,700 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:37,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:20:37,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 17 [2024-11-28 05:20:38,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:20:38,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2024-11-28 05:20:38,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:20:38,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2024-11-28 05:20:39,033 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:39,036 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:39,039 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:39,041 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:39,044 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:39,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 63 [2024-11-28 05:20:39,214 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:39,228 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:39,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:20:39,361 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 104 treesize of output 112 [2024-11-28 05:20:39,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:20:39,850 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 83 treesize of output 81 [2024-11-28 05:20:40,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:20:40,341 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 71 treesize of output 71 [2024-11-28 05:20:40,639 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:40,672 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:40,681 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:40,872 INFO L349 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2024-11-28 05:20:40,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1622 treesize of output 1610 [2024-11-28 05:20:40,993 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:40,995 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:41,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:20:41,091 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 1145 treesize of output 1047 [2024-11-28 05:20:42,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-28 05:20:42,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:20:42,522 INFO L349 Elim1Store]: treesize reduction 333, result has 19.4 percent of original size [2024-11-28 05:20:42,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 6692 treesize of output 6269 [2024-11-28 05:20:42,722 INFO L349 Elim1Store]: treesize reduction 43, result has 34.8 percent of original size [2024-11-28 05:20:42,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 572 treesize of output 560 [2024-11-28 05:20:42,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:20:42,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:20:42,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 332 treesize of output 328 [2024-11-28 05:20:42,960 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:43,379 INFO L349 Elim1Store]: treesize reduction 109, result has 33.1 percent of original size [2024-11-28 05:20:43,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 266 treesize of output 354 [2024-11-28 05:20:43,495 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:20:43,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 187 treesize of output 183 [2024-11-28 05:20:43,549 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:43,553 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:43,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:20:43,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 152 [2024-11-28 05:20:43,717 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:43,741 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:43,766 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:43,810 INFO L224 Elim1Store]: Index analysis took 106 ms [2024-11-28 05:20:44,406 INFO L349 Elim1Store]: treesize reduction 164, result has 29.3 percent of original size [2024-11-28 05:20:44,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 146 treesize of output 240 [2024-11-28 05:20:44,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 05:20:46,459 INFO L349 Elim1Store]: treesize reduction 46, result has 38.7 percent of original size [2024-11-28 05:20:46,459 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 322 treesize of output 332 [2024-11-28 05:20:47,274 INFO L349 Elim1Store]: treesize reduction 11, result has 47.6 percent of original size [2024-11-28 05:20:47,275 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 29 treesize of output 29 [2024-11-28 05:20:47,437 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:47,458 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:47,590 INFO L224 Elim1Store]: Index analysis took 155 ms [2024-11-28 05:20:48,043 INFO L349 Elim1Store]: treesize reduction 188, result has 11.7 percent of original size [2024-11-28 05:20:48,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 381 treesize of output 379 [2024-11-28 05:20:49,838 INFO L349 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2024-11-28 05:20:49,838 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 5 case distinctions, treesize of input 447 treesize of output 416 [2024-11-28 05:20:50,216 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:50,243 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:51,431 INFO L349 Elim1Store]: treesize reduction 302, result has 22.6 percent of original size [2024-11-28 05:20:51,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 20 case distinctions, treesize of input 1270 treesize of output 1225 [2024-11-28 05:20:51,536 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:20:51,982 INFO L224 Elim1Store]: Index analysis took 471 ms [2024-11-28 05:20:53,645 INFO L349 Elim1Store]: treesize reduction 455, result has 24.7 percent of original size [2024-11-28 05:20:53,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 8 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 9 new quantified variables, introduced 39 case distinctions, treesize of input 749 treesize of output 1328 [2024-11-28 05:21:23,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:23,757 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:23,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:23,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:23,916 INFO L224 Elim1Store]: Index analysis took 176 ms [2024-11-28 05:21:24,259 INFO L349 Elim1Store]: treesize reduction 177, result has 11.9 percent of original size [2024-11-28 05:21:24,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 861 treesize of output 919 [2024-11-28 05:21:26,154 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:26,174 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:26,195 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:26,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:26,423 INFO L224 Elim1Store]: Index analysis took 249 ms [2024-11-28 05:21:26,689 INFO L349 Elim1Store]: treesize reduction 171, result has 3.4 percent of original size [2024-11-28 05:21:26,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 257 treesize of output 306 [2024-11-28 05:21:27,134 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:27,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:27,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:27,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:27,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:27,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:27,313 INFO L349 Elim1Store]: treesize reduction 53, result has 10.2 percent of original size [2024-11-28 05:21:27,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 119 treesize of output 160 [2024-11-28 05:21:27,535 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:27,555 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:27,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:27,775 INFO L224 Elim1Store]: Index analysis took 240 ms [2024-11-28 05:21:28,021 INFO L349 Elim1Store]: treesize reduction 171, result has 3.4 percent of original size [2024-11-28 05:21:28,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 119 treesize of output 166 [2024-11-28 05:21:28,211 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:28,213 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:28,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:28,392 INFO L224 Elim1Store]: Index analysis took 183 ms [2024-11-28 05:21:28,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:28,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 122 [2024-11-28 05:21:28,716 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:28,734 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:28,753 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:28,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:28,960 INFO L224 Elim1Store]: Index analysis took 226 ms [2024-11-28 05:21:29,146 INFO L349 Elim1Store]: treesize reduction 137, result has 4.2 percent of original size [2024-11-28 05:21:29,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 249 treesize of output 298 [2024-11-28 05:21:29,542 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:29,543 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:29,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-28 05:21:29,685 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:29,686 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:29,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-28 05:21:29,822 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:29,832 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:29,857 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-28 05:21:29,857 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 53 treesize of output 35 [2024-11-28 05:21:30,048 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:30,049 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:30,051 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:30,053 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:30,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:21:30,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 30 [2024-11-28 05:21:30,341 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:30,446 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2024-11-28 05:21:30,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 182 treesize of output 172 [2024-11-28 05:21:31,092 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:31,094 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:31,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-28 05:21:31,170 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:31,291 INFO L349 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2024-11-28 05:21:31,291 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 4 case distinctions, treesize of input 59 treesize of output 51 [2024-11-28 05:21:31,662 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:31,671 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-28 05:21:31,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 1 [2024-11-28 05:21:40,437 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:40,538 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:40,752 INFO L349 Elim1Store]: treesize reduction 83, result has 17.0 percent of original size [2024-11-28 05:21:40,754 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 3 case distinctions, treesize of input 4801 treesize of output 4749 [2024-11-28 05:21:40,891 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:40,922 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:21:40,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:21:40,999 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 1882 treesize of output 1634 [2024-11-28 05:21:42,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-28 05:21:42,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:21:42,757 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 40 treesize of output 50 [2024-11-28 05:21:43,909 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 15 refuted. 1 times theorem prover too weak. 11 trivial. 11 not checked. [2024-11-28 05:21:43,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675456926] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:21:43,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:21:43,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 30] total 72 [2024-11-28 05:21:43,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237260902] [2024-11-28 05:21:43,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:21:43,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2024-11-28 05:21:43,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:43,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2024-11-28 05:21:43,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=3807, Unknown=29, NotChecked=1048, Total=5112 [2024-11-28 05:21:43,912 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand has 72 states, 72 states have (on average 2.375) internal successors, (171), 72 states have internal predecessors, (171), 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-28 05:22:04,295 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse9 (select .cse17 4))) (let ((.cse11 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse13 (= .cse9 |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse8 (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse0 (not .cse13)) (.cse10 (= 0 (select (select |c_#memory_$Pointer$#1.offset| .cse9) 4))) (.cse14 (= (select .cse11 4) 0)) (.cse15 (= (select (select |c_#memory_$Pointer$#1.base| .cse9) 4) 0)) (.cse12 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse16 (= (select .cse17 8) 0))) (and .cse0 (or (let ((.cse6 (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4))) (let ((.cse4 (select .cse7 .cse6))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse4)) (.cse2 (select .cse5 .cse6))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_96| Int) (v_ArrVal_2971 (Array Int Int))) (or (not (= v_ArrVal_2971 (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2971 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)))) (< .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|) (= 0 (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_2971))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) 4)))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_96| Int) (v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_2970) (select (select (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_2971) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 4) 0) (not (= v_ArrVal_2971 (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2971 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)))) (< .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|) (not (= v_ArrVal_2970 (store (select |c_#memory_$Pointer$#1.offset| .cse4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_96| (select v_ArrVal_2970 |v_ULTIMATE.start_dll_update_at_~head#1.offset_96|)))))))))) (not .cse8)) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) .cse9) 1) .cse10 (<= |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select .cse11 .cse12)) (or .cse13 (and (or (not .cse14) (= (select .cse5 4) 0)) (not (= |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) (= .cse9 |c_ULTIMATE.start_dll_update_at_~head#1.base|) (= (select .cse7 4) 0))) .cse8 (or (and .cse0 .cse10 .cse14 .cse15 (or (< 7 |c_ULTIMATE.start_main_~s~0#1.offset|) .cse16)) (and (exists ((v_arrayElimIndex_19 Int)) (and (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimIndex_19) 4) 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| v_arrayElimIndex_19)) (= (select (select |c_#memory_$Pointer$#1.base| v_arrayElimIndex_19) 4) 0))) (<= 4 |c_ULTIMATE.start_main_~s~0#1.offset|) .cse16)) .cse14 .cse15 (= (select .cse17 .cse12) |c_ULTIMATE.start_dll_update_at_~head#1.base|) .cse16 (not (= |c_ULTIMATE.start_main_~s~0#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|))))))) is different from false [2024-11-28 05:22:17,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:22:17,746 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2024-11-28 05:22:17,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-28 05:22:17,747 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.375) internal successors, (171), 72 states have internal predecessors, (171), 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 70 [2024-11-28 05:22:17,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:22:17,748 INFO L225 Difference]: With dead ends: 141 [2024-11-28 05:22:17,748 INFO L226 Difference]: Without dead ends: 141 [2024-11-28 05:22:17,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 100 SyntacticMatches, 4 SemanticMatches, 91 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 136.5s TimeCoverageRelationStatistics Valid=417, Invalid=6560, Unknown=31, NotChecked=1548, Total=8556 [2024-11-28 05:22:17,749 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 103 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 2401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 661 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:22:17,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1315 Invalid, 2401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1723 Invalid, 0 Unknown, 661 Unchecked, 9.7s Time] [2024-11-28 05:22:17,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-28 05:22:17,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2024-11-28 05:22:17,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 133 states have (on average 1.0526315789473684) internal successors, (140), 137 states have internal predecessors, (140), 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-28 05:22:17,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2024-11-28 05:22:17,753 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 70 [2024-11-28 05:22:17,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:22:17,753 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2024-11-28 05:22:17,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 2.375) internal successors, (171), 72 states have internal predecessors, (171), 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-28 05:22:17,754 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2024-11-28 05:22:17,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-28 05:22:17,754 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:17,755 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:17,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-28 05:22:17,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-28 05:22:17,955 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:22:17,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:17,956 INFO L85 PathProgramCache]: Analyzing trace with hash -881902925, now seen corresponding path program 2 times [2024-11-28 05:22:17,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:17,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906811404] [2024-11-28 05:22:17,956 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:22:17,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:17,991 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:22:17,991 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:22:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 05:22:21,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:21,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906811404] [2024-11-28 05:22:21,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906811404] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:22:21,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766690198] [2024-11-28 05:22:21,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:22:21,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:21,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:21,694 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:21,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-28 05:22:22,020 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:22:22,020 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:22:22,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-28 05:22:22,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:22,530 INFO L349 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2024-11-28 05:22:22,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 39 [2024-11-28 05:22:22,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:22:23,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 05:22:23,625 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:22:23,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 51 [2024-11-28 05:22:25,554 INFO L349 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2024-11-28 05:22:25,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 46 [2024-11-28 05:22:28,361 INFO L349 Elim1Store]: treesize reduction 17, result has 34.6 percent of original size [2024-11-28 05:22:28,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 117 [2024-11-28 05:22:28,718 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-11-28 05:22:28,718 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 97 treesize of output 91 [2024-11-28 05:22:36,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:22:36,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 198 treesize of output 180 [2024-11-28 05:22:41,402 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 05:22:41,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:22:44,989 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3097 (Array Int Int)) (v_ArrVal_3098 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_106| Int)) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3097) (select v_ArrVal_3097 4) v_ArrVal_3098) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0)) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_106| (select v_ArrVal_3097 |v_ULTIMATE.start_dll_update_at_~head#1.offset_106|)) v_ArrVal_3097)) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_106|))) is different from false [2024-11-28 05:22:45,052 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3097 (Array Int Int)) (v_ArrVal_3098 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_106| Int)) (or (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_106| (select v_ArrVal_3097 |v_ULTIMATE.start_dll_update_at_~head#1.offset_106|)) v_ArrVal_3097)) (= (store (store |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base| 0) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_3097) (select v_ArrVal_3097 4) v_ArrVal_3098) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_106|))) is different from false [2024-11-28 05:22:45,088 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3097 (Array Int Int)) (v_ArrVal_3098 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_106| Int)) (or (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_106| (select v_ArrVal_3097 |v_ULTIMATE.start_dll_update_at_~head#1.offset_106|)) v_ArrVal_3097)) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_106|) (= (store (store |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base| 0) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3097) (select v_ArrVal_3097 4) v_ArrVal_3098) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2024-11-28 05:22:45,151 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3097 (Array Int Int)) (v_ArrVal_3098 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_106| Int)) (or (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_106| (select v_ArrVal_3097 |v_ULTIMATE.start_dll_update_at_~head#1.offset_106|)) v_ArrVal_3097)) (= (store (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3097) (select v_ArrVal_3097 4) v_ArrVal_3098) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_106|))) is different from false [2024-11-28 05:22:45,195 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3096 (Array Int Int)) (v_ArrVal_3097 (Array Int Int)) (v_ArrVal_3098 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_106| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3096))) (or (= (store (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0) (select (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3097) (select v_ArrVal_3097 4) v_ArrVal_3098) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_106|) (not (= v_ArrVal_3097 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_106| (select v_ArrVal_3097 |v_ULTIMATE.start_dll_update_at_~head#1.offset_106|))))))) is different from false [2024-11-28 05:22:45,278 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3096 (Array Int Int)) (v_ArrVal_3097 (Array Int Int)) (v_ArrVal_3098 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_106| Int)) (or (not (= v_ArrVal_3097 (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3096) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_106| (select v_ArrVal_3097 |v_ULTIMATE.start_dll_update_at_~head#1.offset_106|)))) (= (store (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3096) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3097) (select v_ArrVal_3097 4) v_ArrVal_3098) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_106|))) is different from false [2024-11-28 05:22:45,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:22:45,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 78 [2024-11-28 05:22:45,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2024-11-28 05:22:45,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:22:45,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2024-11-28 05:22:45,535 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2024-11-28 05:22:45,535 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 65 [2024-11-28 05:22:45,554 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 21 treesize of output 19 [2024-11-28 05:22:45,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-28 05:22:45,690 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:22:45,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 70 [2024-11-28 05:22:45,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:22:45,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 173 treesize of output 171 [2024-11-28 05:23:09,865 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 11 trivial. 8 not checked. [2024-11-28 05:23:09,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766690198] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:23:09,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:23:09,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 23] total 61 [2024-11-28 05:23:09,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532528602] [2024-11-28 05:23:09,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:23:09,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-28 05:23:09,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:23:09,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-28 05:23:09,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2883, Unknown=19, NotChecked=678, Total=3782 [2024-11-28 05:23:09,868 INFO L87 Difference]: Start difference. First operand 138 states and 140 transitions. Second operand has 62 states, 61 states have (on average 2.8852459016393444) internal successors, (176), 62 states have internal predecessors, (176), 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-28 05:23:22,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:23:22,162 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2024-11-28 05:23:22,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-28 05:23:22,163 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 2.8852459016393444) internal successors, (176), 62 states have internal predecessors, (176), 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 71 [2024-11-28 05:23:22,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:23:22,163 INFO L225 Difference]: With dead ends: 141 [2024-11-28 05:23:22,164 INFO L226 Difference]: Without dead ends: 90 [2024-11-28 05:23:22,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 105 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 38.9s TimeCoverageRelationStatistics Valid=321, Invalid=4376, Unknown=19, NotChecked=834, Total=5550 [2024-11-28 05:23:22,165 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 71 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 1892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 476 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:23:22,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1101 Invalid, 1892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1407 Invalid, 0 Unknown, 476 Unchecked, 6.8s Time] [2024-11-28 05:23:22,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-28 05:23:22,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-11-28 05:23:22,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0714285714285714) internal successors, (90), 88 states have internal predecessors, (90), 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-28 05:23:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2024-11-28 05:23:22,168 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 71 [2024-11-28 05:23:22,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:23:22,169 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2024-11-28 05:23:22,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 2.8852459016393444) internal successors, (176), 62 states have internal predecessors, (176), 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-28 05:23:22,169 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2024-11-28 05:23:22,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-28 05:23:22,170 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:23:22,170 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:23:22,183 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-28 05:23:22,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-28 05:23:22,371 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-28 05:23:22,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:23:22,371 INFO L85 PathProgramCache]: Analyzing trace with hash -430966871, now seen corresponding path program 3 times [2024-11-28 05:23:22,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:23:22,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589218200] [2024-11-28 05:23:22,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 05:23:22,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:23:22,453 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-28 05:23:22,453 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:23:22,671 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-28 05:23:22,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:23:22,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589218200] [2024-11-28 05:23:22,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589218200] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:23:22,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647074620] [2024-11-28 05:23:22,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 05:23:22,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:23:22,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:23:22,675 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:23:22,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-28 05:23:23,163 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-28 05:23:23,163 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:23:23,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 05:23:23,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:23:23,343 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-28 05:23:23,344 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:23:23,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647074620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:23:23,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 05:23:23,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-11-28 05:23:23,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495855631] [2024-11-28 05:23:23,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:23:23,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:23:23,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:23:23,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:23:23,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:23:23,345 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-28 05:23:23,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:23:23,391 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2024-11-28 05:23:23,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:23:23,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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 79 [2024-11-28 05:23:23,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:23:23,392 INFO L225 Difference]: With dead ends: 20 [2024-11-28 05:23:23,392 INFO L226 Difference]: Without dead ends: 0 [2024-11-28 05:23:23,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:23:23,392 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:23:23,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:23:23,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-28 05:23:23,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-28 05:23:23,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:23:23,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-28 05:23:23,393 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2024-11-28 05:23:23,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:23:23,393 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-28 05:23:23,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-28 05:23:23,394 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-28 05:23:23,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-28 05:23:23,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 23 remaining) [2024-11-28 05:23:23,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 23 remaining) [2024-11-28 05:23:23,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2024-11-28 05:23:23,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2024-11-28 05:23:23,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2024-11-28 05:23:23,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2024-11-28 05:23:23,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2024-11-28 05:23:23,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2024-11-28 05:23:23,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 23 remaining) [2024-11-28 05:23:23,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2024-11-28 05:23:23,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 23 remaining) [2024-11-28 05:23:23,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 23 remaining) [2024-11-28 05:23:23,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2024-11-28 05:23:23,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2024-11-28 05:23:23,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2024-11-28 05:23:23,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 23 remaining) [2024-11-28 05:23:23,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 23 remaining) [2024-11-28 05:23:23,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 23 remaining) [2024-11-28 05:23:23,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (4 of 23 remaining) [2024-11-28 05:23:23,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (3 of 23 remaining) [2024-11-28 05:23:23,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE (2 of 23 remaining) [2024-11-28 05:23:23,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK (1 of 23 remaining) [2024-11-28 05:23:23,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (0 of 23 remaining) [2024-11-28 05:23:23,420 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-11-28 05:23:23,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-28 05:23:23,621 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:23:23,631 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 05:23:23,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:23:23 BoogieIcfgContainer [2024-11-28 05:23:23,641 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 05:23:23,642 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 05:23:23,647 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 05:23:23,647 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 05:23:23,648 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:14:47" (3/4) ... [2024-11-28 05:23:23,657 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-28 05:23:23,673 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2024-11-28 05:23:23,689 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-28 05:23:23,689 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-28 05:23:23,690 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-28 05:23:23,690 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-28 05:23:23,888 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 05:23:23,888 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 05:23:23,888 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 05:23:23,889 INFO L158 Benchmark]: Toolchain (without parser) took 518160.18ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 129.6MB in the beginning and 345.6MB in the end (delta: -215.9MB). Peak memory consumption was 261.1MB. Max. memory is 16.1GB. [2024-11-28 05:23:23,889 INFO L158 Benchmark]: CDTParser took 1.64ms. Allocated memory is still 167.8MB. Free memory is still 102.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:23:23,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 565.17ms. Allocated memory is still 167.8MB. Free memory was 129.3MB in the beginning and 111.4MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 05:23:23,889 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.22ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 109.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:23:23,890 INFO L158 Benchmark]: Boogie Preprocessor took 54.80ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 107.5MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:23:23,890 INFO L158 Benchmark]: RCFGBuilder took 647.68ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 88.5MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 05:23:23,890 INFO L158 Benchmark]: TraceAbstraction took 516591.09ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 88.1MB in the beginning and 350.0MB in the end (delta: -261.8MB). Peak memory consumption was 210.8MB. Max. memory is 16.1GB. [2024-11-28 05:23:23,890 INFO L158 Benchmark]: Witness Printer took 245.70ms. Allocated memory is still 645.9MB. Free memory was 350.0MB in the beginning and 345.6MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:23:23,891 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.64ms. Allocated memory is still 167.8MB. Free memory is still 102.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 565.17ms. Allocated memory is still 167.8MB. Free memory was 129.3MB in the beginning and 111.4MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.22ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 109.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.80ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 107.5MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 647.68ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 88.5MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 516591.09ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 88.1MB in the beginning and 350.0MB in the end (delta: -261.8MB). Peak memory consumption was 210.8MB. Max. memory is 16.1GB. * Witness Printer took 245.70ms. Allocated memory is still 645.9MB. Free memory was 350.0MB in the beginning and 345.6MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 606]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 606]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 606]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 624]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 23 error locations. Started 1 CEGAR loops. OverallTime: 516.5s, OverallIterations: 38, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 90.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1805 SdHoareTripleChecker+Valid, 37.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1805 mSDsluCounter, 16466 SdHoareTripleChecker+Invalid, 34.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 5142 IncrementalHoareTripleChecker+Unchecked, 14772 mSDsCounter, 231 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17307 IncrementalHoareTripleChecker+Invalid, 22680 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 231 mSolverCounterUnsat, 1694 mSDtfsCounter, 17307 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2771 GetRequests, 1719 SyntacticMatches, 58 SemanticMatches, 994 ConstructedPredicates, 74 IntricatePredicates, 0 DeprecatedPredicates, 11573 ImplicationChecksByTransitivity, 249.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=36, InterpolantAutomatonStates: 436, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 38 MinimizatonAttempts, 286 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 412.9s InterpolantComputationTime, 2704 NumberOfCodeBlocks, 2688 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 3590 ConstructedInterpolants, 335 QuantifiedInterpolants, 130347 SizeOfPredicates, 112 NumberOfNonLiveVariables, 7998 ConjunctsInSsa, 980 ConjunctsInUnsatCore, 83 InterpolantComputations, 17 PerfectInterpolantSequences, 1006/1778 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-28 05:23:24,103 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-28 05:23:24,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c23dc67-cc9b-4866-8a89-efaa2a628fe8/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE