./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/list-properties/list_search-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/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_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/list_search-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:22:10,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:22:10,581 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-28 05:22:10,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:22:10,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:22:10,649 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:22:10,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:22:10,651 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:22:10,652 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:22:10,652 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:22:10,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:22:10,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:22:10,654 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:22:10,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:22:10,656 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:22:10,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:22:10,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 05:22:10,657 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:22:10,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:22:10,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:22:10,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:22:10,657 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 05:22:10,658 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 05:22:10,658 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 05:22:10,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:22:10,658 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 05:22:10,658 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 05:22:10,658 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 05:22:10,658 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:22:10,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 05:22:10,660 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:22:10,660 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:22:10,660 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:22:10,660 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:22:10,660 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:22:10,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:22:10,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:22:10,661 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:22:10,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:22:10,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:22:10,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:22:10,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:22:10,662 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:22:10,662 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:22:10,662 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 05:22:10,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 05:22:10,662 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:22:10,662 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:22:10,662 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:22:10,663 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:22:10,663 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_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/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-memcleanup) ) 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 -> b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 [2024-11-28 05:22:11,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:22:11,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:22:11,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:22:11,064 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:22:11,064 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:22:11,067 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-properties/list_search-2.i [2024-11-28 05:22:14,257 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/data/a4f8cae0e/495cf43640ba4a05aa994d0e8a79dc1a/FLAG3ff74edcd [2024-11-28 05:22:14,634 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:22:14,635 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/sv-benchmarks/c/list-properties/list_search-2.i [2024-11-28 05:22:14,664 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/data/a4f8cae0e/495cf43640ba4a05aa994d0e8a79dc1a/FLAG3ff74edcd [2024-11-28 05:22:14,691 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/data/a4f8cae0e/495cf43640ba4a05aa994d0e8a79dc1a [2024-11-28 05:22:14,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:22:14,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:22:14,699 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:22:14,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:22:14,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:22:14,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:22:14" (1/1) ... [2024-11-28 05:22:14,710 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fb4db71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:14, skipping insertion in model container [2024-11-28 05:22:14,710 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:22:14" (1/1) ... [2024-11-28 05:22:14,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:22:15,338 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:22:15,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:22:15,368 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:22:15,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:22:15,521 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:22:15,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:15 WrapperNode [2024-11-28 05:22:15,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:22:15,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:22:15,524 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:22:15,524 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:22:15,531 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:22:15" (1/1) ... [2024-11-28 05:22:15,547 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:22:15" (1/1) ... [2024-11-28 05:22:15,582 INFO L138 Inliner]: procedures = 226, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 98 [2024-11-28 05:22:15,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:22:15,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:22:15,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:22:15,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:22:15,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:15" (1/1) ... [2024-11-28 05:22:15,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:15" (1/1) ... [2024-11-28 05:22:15,607 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:15" (1/1) ... [2024-11-28 05:22:15,647 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 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:22:15,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:15" (1/1) ... [2024-11-28 05:22:15,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:15" (1/1) ... [2024-11-28 05:22:15,669 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:15" (1/1) ... [2024-11-28 05:22:15,670 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:15" (1/1) ... [2024-11-28 05:22:15,679 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:15" (1/1) ... [2024-11-28 05:22:15,685 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:15" (1/1) ... [2024-11-28 05:22:15,686 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:15" (1/1) ... [2024-11-28 05:22:15,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:22:15,693 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:22:15,693 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:22:15,693 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:22:15,697 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:15" (1/1) ... [2024-11-28 05:22:15,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:22:15,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:15,748 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/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:22:15,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/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:22:15,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 05:22:15,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 05:22:15,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 05:22:15,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 05:22:15,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 05:22:15,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 05:22:15,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 05:22:15,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 05:22:15,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:22:15,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 05:22:15,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 05:22:15,796 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2024-11-28 05:22:15,797 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2024-11-28 05:22:15,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 05:22:15,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 05:22:15,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:22:15,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:22:16,003 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:22:16,006 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:22:16,372 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-28 05:22:16,372 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:22:16,385 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:22:16,385 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-28 05:22:16,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:22:16 BoogieIcfgContainer [2024-11-28 05:22:16,386 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:22:16,389 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:22:16,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:22:16,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:22:16,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:22:14" (1/3) ... [2024-11-28 05:22:16,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7402c263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:22:16, skipping insertion in model container [2024-11-28 05:22:16,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:15" (2/3) ... [2024-11-28 05:22:16,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7402c263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:22:16, skipping insertion in model container [2024-11-28 05:22:16,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:22:16" (3/3) ... [2024-11-28 05:22:16,399 INFO L128 eAbstractionObserver]: Analyzing ICFG list_search-2.i [2024-11-28 05:22:16,419 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:22:16,421 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG list_search-2.i that has 2 procedures, 44 locations, 1 initial locations, 4 loop locations, and 2 error locations. [2024-11-28 05:22:16,474 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:22:16,498 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;@664e331e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:22:16,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-28 05:22:16,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 38 states have internal predecessors, (51), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 05:22:16,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-28 05:22:16,518 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:16,519 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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:22:16,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:22:16,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:16,527 INFO L85 PathProgramCache]: Analyzing trace with hash -415259668, now seen corresponding path program 1 times [2024-11-28 05:22:16,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:16,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236595181] [2024-11-28 05:22:16,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:16,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-28 05:22:17,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:17,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236595181] [2024-11-28 05:22:17,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236595181] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:22:17,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401798796] [2024-11-28 05:22:17,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:17,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:17,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:17,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:17,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 05:22:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:17,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 05:22:17,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-28 05:22:17,509 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:22:17,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401798796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:17,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 05:22:17,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2024-11-28 05:22:17,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432614052] [2024-11-28 05:22:17,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:17,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 05:22:17,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:17,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 05:22:17,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:22:17,544 INFO L87 Difference]: Start difference. First operand has 44 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 38 states have internal predecessors, (51), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-28 05:22:17,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:22:17,557 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2024-11-28 05:22:17,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 05:22:17,559 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2024-11-28 05:22:17,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:22:17,564 INFO L225 Difference]: With dead ends: 43 [2024-11-28 05:22:17,564 INFO L226 Difference]: Without dead ends: 41 [2024-11-28 05:22:17,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:22:17,569 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:22:17,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:22:17,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-28 05:22:17,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-28 05:22:17,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 35 states have internal predecessors, (42), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 05:22:17,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2024-11-28 05:22:17,611 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 39 [2024-11-28 05:22:17,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:22:17,614 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2024-11-28 05:22:17,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-28 05:22:17,614 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2024-11-28 05:22:17,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 05:22:17,616 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:17,617 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 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:22:17,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 05:22:17,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-28 05:22:17,818 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:22:17,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:17,819 INFO L85 PathProgramCache]: Analyzing trace with hash 126852133, now seen corresponding path program 1 times [2024-11-28 05:22:17,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:17,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466693518] [2024-11-28 05:22:17,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:17,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:18,220 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-28 05:22:18,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:18,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466693518] [2024-11-28 05:22:18,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466693518] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:22:18,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722520607] [2024-11-28 05:22:18,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:18,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:18,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:18,225 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:18,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 05:22:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:18,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 05:22:18,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:18,503 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-28 05:22:18,503 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:22:18,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722520607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:18,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 05:22:18,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-11-28 05:22:18,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360205431] [2024-11-28 05:22:18,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:18,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:22:18,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:18,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:22:18,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:22:18,507 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-28 05:22:18,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:22:18,658 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2024-11-28 05:22:18,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:22:18,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2024-11-28 05:22:18,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:22:18,661 INFO L225 Difference]: With dead ends: 55 [2024-11-28 05:22:18,661 INFO L226 Difference]: Without dead ends: 55 [2024-11-28 05:22:18,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:22:18,662 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 45 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:22:18,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 127 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:22:18,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-28 05:22:18,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2024-11-28 05:22:18,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 05:22:18,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2024-11-28 05:22:18,670 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 41 [2024-11-28 05:22:18,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:22:18,670 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2024-11-28 05:22:18,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-28 05:22:18,670 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2024-11-28 05:22:18,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-28 05:22:18,674 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:18,674 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:18,684 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 05:22:18,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:18,875 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:22:18,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:18,875 INFO L85 PathProgramCache]: Analyzing trace with hash -872722881, now seen corresponding path program 1 times [2024-11-28 05:22:18,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:18,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935513909] [2024-11-28 05:22:18,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:18,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:19,370 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-28 05:22:19,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:19,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935513909] [2024-11-28 05:22:19,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935513909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:19,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:19,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 05:22:19,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323906620] [2024-11-28 05:22:19,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:19,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:22:19,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:19,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:22:19,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:22:19,375 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-28 05:22:19,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:22:19,471 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2024-11-28 05:22:19,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:22:19,472 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2024-11-28 05:22:19,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:22:19,473 INFO L225 Difference]: With dead ends: 51 [2024-11-28 05:22:19,473 INFO L226 Difference]: Without dead ends: 51 [2024-11-28 05:22:19,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:22:19,474 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 9 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:22:19,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 203 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:22:19,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-28 05:22:19,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-28 05:22:19,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 05:22:19,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2024-11-28 05:22:19,487 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 43 [2024-11-28 05:22:19,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:22:19,487 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2024-11-28 05:22:19,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-28 05:22:19,488 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2024-11-28 05:22:19,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-28 05:22:19,491 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:19,491 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:19,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 05:22:19,491 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:22:19,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:19,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1682069507, now seen corresponding path program 1 times [2024-11-28 05:22:19,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:19,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902987738] [2024-11-28 05:22:19,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:19,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:19,795 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-28 05:22:19,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:19,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902987738] [2024-11-28 05:22:19,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902987738] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:22:19,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862922671] [2024-11-28 05:22:19,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:19,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:19,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:19,801 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:19,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 05:22:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:20,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 05:22:20,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:20,077 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-28 05:22:20,077 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:22:20,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862922671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:20,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 05:22:20,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 9 [2024-11-28 05:22:20,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970125549] [2024-11-28 05:22:20,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:20,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:22:20,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:20,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:22:20,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:22:20,080 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-28 05:22:20,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:22:20,186 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2024-11-28 05:22:20,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:22:20,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2024-11-28 05:22:20,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:22:20,187 INFO L225 Difference]: With dead ends: 62 [2024-11-28 05:22:20,187 INFO L226 Difference]: Without dead ends: 62 [2024-11-28 05:22:20,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:22:20,189 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 49 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:22:20,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 182 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:22:20,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-28 05:22:20,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2024-11-28 05:22:20,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 05:22:20,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2024-11-28 05:22:20,194 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 43 [2024-11-28 05:22:20,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:22:20,194 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2024-11-28 05:22:20,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-28 05:22:20,195 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2024-11-28 05:22:20,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 05:22:20,196 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:20,196 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:20,205 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 05:22:20,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:20,400 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:22:20,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:20,400 INFO L85 PathProgramCache]: Analyzing trace with hash 28385003, now seen corresponding path program 1 times [2024-11-28 05:22:20,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:20,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908555223] [2024-11-28 05:22:20,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:20,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-28 05:22:20,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:20,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908555223] [2024-11-28 05:22:20,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908555223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:20,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:20,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 05:22:20,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438786189] [2024-11-28 05:22:20,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:20,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 05:22:20,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:20,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 05:22:20,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:22:20,998 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-28 05:22:21,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:22:21,278 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2024-11-28 05:22:21,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:22:21,279 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2024-11-28 05:22:21,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:22:21,280 INFO L225 Difference]: With dead ends: 57 [2024-11-28 05:22:21,280 INFO L226 Difference]: Without dead ends: 57 [2024-11-28 05:22:21,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-28 05:22:21,283 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 30 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:22:21,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 167 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:22:21,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-28 05:22:21,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2024-11-28 05:22:21,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 47 states have internal predecessors, (56), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 05:22:21,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2024-11-28 05:22:21,298 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 47 [2024-11-28 05:22:21,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:22:21,298 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2024-11-28 05:22:21,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-28 05:22:21,299 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2024-11-28 05:22:21,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 05:22:21,300 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:21,300 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:21,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 05:22:21,300 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:22:21,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:21,303 INFO L85 PathProgramCache]: Analyzing trace with hash -25540682, now seen corresponding path program 1 times [2024-11-28 05:22:21,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:21,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297575830] [2024-11-28 05:22:21,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:21,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:22,048 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 05:22:22,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:22,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297575830] [2024-11-28 05:22:22,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297575830] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:22:22,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543182406] [2024-11-28 05:22:22,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:22,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:22,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:22,052 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:22,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 05:22:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:22,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 05:22:22,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:22,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 05:22:22,414 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 8 [2024-11-28 05:22:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 05:22:22,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:22:22,623 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 05:22:22,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543182406] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:22:22,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:22:22,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2024-11-28 05:22:22,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991428511] [2024-11-28 05:22:22,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:22:22,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 05:22:22,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:22,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 05:22:22,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-28 05:22:22,626 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 20 states, 20 states have (on average 2.55) internal successors, (51), 17 states have internal predecessors, (51), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-28 05:22:23,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:22:23,331 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2024-11-28 05:22:23,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 05:22:23,332 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 17 states have internal predecessors, (51), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 47 [2024-11-28 05:22:23,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:22:23,336 INFO L225 Difference]: With dead ends: 73 [2024-11-28 05:22:23,336 INFO L226 Difference]: Without dead ends: 73 [2024-11-28 05:22:23,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=265, Invalid=1067, Unknown=0, NotChecked=0, Total=1332 [2024-11-28 05:22:23,340 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 234 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:22:23,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 311 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:22:23,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-28 05:22:23,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2024-11-28 05:22:23,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 49 states have (on average 1.183673469387755) internal successors, (58), 50 states have internal predecessors, (58), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-28 05:22:23,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2024-11-28 05:22:23,352 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 47 [2024-11-28 05:22:23,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:22:23,352 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2024-11-28 05:22:23,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 17 states have internal predecessors, (51), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-28 05:22:23,353 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2024-11-28 05:22:23,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-28 05:22:23,353 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:23,353 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:23,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-28 05:22:23,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-28 05:22:23,554 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:22:23,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:23,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1290743982, now seen corresponding path program 2 times [2024-11-28 05:22:23,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:23,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204593412] [2024-11-28 05:22:23,555 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:22:23,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:23,600 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:22:23,600 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:22:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 05:22:24,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:24,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204593412] [2024-11-28 05:22:24,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204593412] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:22:24,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312378028] [2024-11-28 05:22:24,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:22:24,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:24,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:24,105 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:24,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 05:22:24,290 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:22:24,290 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:22:24,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-28 05:22:24,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:24,388 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:22:24,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-28 05:22:24,550 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 05:22:24,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:22:24,761 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 05:22:24,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312378028] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:22:24,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:22:24,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 24 [2024-11-28 05:22:24,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423504887] [2024-11-28 05:22:24,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:22:24,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 05:22:24,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:24,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 05:22:24,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2024-11-28 05:22:24,764 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 22 states have internal predecessors, (61), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-28 05:22:25,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:22:25,525 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2024-11-28 05:22:25,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 05:22:25,526 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 22 states have internal predecessors, (61), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 49 [2024-11-28 05:22:25,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:22:25,527 INFO L225 Difference]: With dead ends: 76 [2024-11-28 05:22:25,527 INFO L226 Difference]: Without dead ends: 76 [2024-11-28 05:22:25,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=305, Invalid=1335, Unknown=0, NotChecked=0, Total=1640 [2024-11-28 05:22:25,529 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 181 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:22:25,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 468 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 05:22:25,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-28 05:22:25,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 60. [2024-11-28 05:22:25,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 53 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-28 05:22:25,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2024-11-28 05:22:25,534 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 49 [2024-11-28 05:22:25,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:22:25,535 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2024-11-28 05:22:25,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 22 states have internal predecessors, (61), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-28 05:22:25,535 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2024-11-28 05:22:25,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-28 05:22:25,536 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:25,536 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:25,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 05:22:25,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:25,737 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:22:25,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:25,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1586478219, now seen corresponding path program 3 times [2024-11-28 05:22:25,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:25,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223909659] [2024-11-28 05:22:25,738 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 05:22:25,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:25,779 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-28 05:22:25,779 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:22:27,459 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 21 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-28 05:22:27,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:27,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223909659] [2024-11-28 05:22:27,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223909659] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:22:27,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230234748] [2024-11-28 05:22:27,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 05:22:27,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:27,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:27,462 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:27,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 05:22:27,668 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-28 05:22:27,668 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:22:27,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-28 05:22:27,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:27,681 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:22:27,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 05:22:27,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 05:22:27,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 05:22:27,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 05:22:28,001 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 05:22:28,002 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 45 [2024-11-28 05:22:28,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2024-11-28 05:22:28,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2024-11-28 05:22:28,571 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2024-11-28 05:22:28,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 86 [2024-11-28 05:22:28,635 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2024-11-28 05:22:28,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 71 [2024-11-28 05:22:29,020 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 05:22:29,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:22:29,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:22:29,381 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 16 treesize of output 20 [2024-11-28 05:22:29,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:22:29,391 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 16 treesize of output 20 [2024-11-28 05:22:29,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230234748] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:22:29,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:22:29,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 21 [2024-11-28 05:22:29,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161006357] [2024-11-28 05:22:29,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:22:29,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 05:22:29,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:29,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 05:22:29,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2024-11-28 05:22:29,493 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-28 05:22:31,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:22:31,209 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2024-11-28 05:22:31,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 05:22:31,210 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 53 [2024-11-28 05:22:31,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:22:31,211 INFO L225 Difference]: With dead ends: 80 [2024-11-28 05:22:31,214 INFO L226 Difference]: Without dead ends: 80 [2024-11-28 05:22:31,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=222, Invalid=1500, Unknown=0, NotChecked=0, Total=1722 [2024-11-28 05:22:31,215 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 96 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:22:31,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 429 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 05:22:31,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-28 05:22:31,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 64. [2024-11-28 05:22:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 57 states have internal predecessors, (66), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-28 05:22:31,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2024-11-28 05:22:31,224 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 53 [2024-11-28 05:22:31,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:22:31,224 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2024-11-28 05:22:31,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-28 05:22:31,225 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2024-11-28 05:22:31,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 05:22:31,225 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:31,226 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:31,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 05:22:31,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:31,426 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:22:31,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:31,427 INFO L85 PathProgramCache]: Analyzing trace with hash 173183804, now seen corresponding path program 1 times [2024-11-28 05:22:31,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:31,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146846310] [2024-11-28 05:22:31,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:31,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:31,830 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-28 05:22:31,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:31,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146846310] [2024-11-28 05:22:31,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146846310] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:22:31,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153418409] [2024-11-28 05:22:31,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:31,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:31,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:31,833 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:31,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 05:22:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:32,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-28 05:22:32,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:32,052 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 22 treesize of output 7 [2024-11-28 05:22:32,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:22:32,149 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 32 treesize of output 32 [2024-11-28 05:22:32,214 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-28 05:22:32,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:22:32,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153418409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:32,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 05:22:32,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 16 [2024-11-28 05:22:32,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035694302] [2024-11-28 05:22:32,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:32,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:22:32,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:32,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:22:32,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-28 05:22:32,219 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-28 05:22:32,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:22:32,403 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2024-11-28 05:22:32,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 05:22:32,404 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2024-11-28 05:22:32,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:22:32,405 INFO L225 Difference]: With dead ends: 64 [2024-11-28 05:22:32,405 INFO L226 Difference]: Without dead ends: 64 [2024-11-28 05:22:32,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2024-11-28 05:22:32,405 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:22:32,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 204 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:22:32,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-28 05:22:32,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-28 05:22:32,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 57 states have internal predecessors, (65), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-28 05:22:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2024-11-28 05:22:32,416 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 55 [2024-11-28 05:22:32,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:22:32,416 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2024-11-28 05:22:32,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-28 05:22:32,417 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2024-11-28 05:22:32,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-28 05:22:32,417 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:32,418 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:32,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 05:22:32,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:32,622 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:22:32,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:32,622 INFO L85 PathProgramCache]: Analyzing trace with hash 815284711, now seen corresponding path program 1 times [2024-11-28 05:22:32,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:32,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656723241] [2024-11-28 05:22:32,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:32,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:34,152 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 05:22:34,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:34,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656723241] [2024-11-28 05:22:34,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656723241] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:22:34,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981033552] [2024-11-28 05:22:34,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:34,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:34,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:34,155 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:34,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 05:22:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:34,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-11-28 05:22:34,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:34,443 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:22:34,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 05:22:34,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 05:22:34,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 05:22:34,908 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 05:22:34,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2024-11-28 05:22:34,928 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 05:22:34,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2024-11-28 05:22:35,853 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-28 05:22:35,854 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 2 case distinctions, treesize of input 72 treesize of output 50 [2024-11-28 05:22:35,859 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 0 case distinctions, treesize of input 40 treesize of output 31 [2024-11-28 05:22:36,083 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 36 treesize of output 20 [2024-11-28 05:22:36,088 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 32 treesize of output 16 [2024-11-28 05:22:36,138 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-28 05:22:36,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:22:37,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:22:37,100 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 16 treesize of output 20 [2024-11-28 05:22:37,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:22:37,106 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 16 treesize of output 20 [2024-11-28 05:22:41,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981033552] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:22:41,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:22:41,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2024-11-28 05:22:41,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262052232] [2024-11-28 05:22:41,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:22:41,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-28 05:22:41,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:41,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-28 05:22:41,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2291, Unknown=8, NotChecked=0, Total=2450 [2024-11-28 05:22:41,437 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand has 40 states, 40 states have (on average 2.0) internal successors, (80), 37 states have internal predecessors, (80), 3 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 05:22:44,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:22:44,741 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2024-11-28 05:22:44,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-28 05:22:44,741 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.0) internal successors, (80), 37 states have internal predecessors, (80), 3 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 57 [2024-11-28 05:22:44,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:22:44,742 INFO L225 Difference]: With dead ends: 85 [2024-11-28 05:22:44,742 INFO L226 Difference]: Without dead ends: 80 [2024-11-28 05:22:44,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=627, Invalid=6171, Unknown=8, NotChecked=0, Total=6806 [2024-11-28 05:22:44,744 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 139 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:22:44,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 758 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-28 05:22:44,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-28 05:22:44,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2024-11-28 05:22:44,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 59 states have internal predecessors, (66), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-28 05:22:44,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2024-11-28 05:22:44,754 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 57 [2024-11-28 05:22:44,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:22:44,754 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2024-11-28 05:22:44,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.0) internal successors, (80), 37 states have internal predecessors, (80), 3 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 05:22:44,754 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2024-11-28 05:22:44,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-28 05:22:44,755 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:44,755 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:44,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 05:22:44,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:44,956 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:22:44,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:44,956 INFO L85 PathProgramCache]: Analyzing trace with hash 703817028, now seen corresponding path program 4 times [2024-11-28 05:22:44,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:44,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132714416] [2024-11-28 05:22:44,956 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 05:22:44,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:44,991 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 05:22:44,991 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:22:47,139 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 22 proven. 29 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 05:22:47,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:47,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132714416] [2024-11-28 05:22:47,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132714416] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:22:47,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517943243] [2024-11-28 05:22:47,139 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 05:22:47,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:47,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:47,141 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:47,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 05:22:47,343 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 05:22:47,343 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:22:47,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-28 05:22:47,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:47,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:22:47,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 05:22:47,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 05:22:47,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:22:47,690 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 05:22:47,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2024-11-28 05:22:47,721 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2024-11-28 05:22:47,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2024-11-28 05:22:47,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2024-11-28 05:22:47,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2024-11-28 05:22:48,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:22:48,074 INFO L349 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2024-11-28 05:22:48,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 47 [2024-11-28 05:22:48,094 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-11-28 05:22:48,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-28 05:22:48,108 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 22 treesize of output 17 [2024-11-28 05:22:48,568 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 23 treesize of output 7 [2024-11-28 05:22:48,710 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-28 05:22:48,710 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 26 [2024-11-28 05:22:48,754 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 05:22:48,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:22:49,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:22:49,066 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 46 treesize of output 45 [2024-11-28 05:22:49,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:22:49,071 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 36 treesize of output 40 [2024-11-28 05:22:49,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517943243] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:22:49,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:22:49,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 36 [2024-11-28 05:22:49,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658786706] [2024-11-28 05:22:49,153 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:22:49,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-28 05:22:49,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:49,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-28 05:22:49,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1515, Unknown=0, NotChecked=0, Total=1640 [2024-11-28 05:22:49,154 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 33 states have internal predecessors, (75), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-28 05:22:51,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:22:51,682 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2024-11-28 05:22:51,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-28 05:22:51,683 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 33 states have internal predecessors, (75), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 57 [2024-11-28 05:22:51,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:22:51,684 INFO L225 Difference]: With dead ends: 89 [2024-11-28 05:22:51,684 INFO L226 Difference]: Without dead ends: 89 [2024-11-28 05:22:51,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=483, Invalid=3677, Unknown=0, NotChecked=0, Total=4160 [2024-11-28 05:22:51,685 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 338 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:22:51,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 545 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 05:22:51,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-28 05:22:51,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 70. [2024-11-28 05:22:51,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 63 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-28 05:22:51,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2024-11-28 05:22:51,690 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 57 [2024-11-28 05:22:51,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:22:51,691 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2024-11-28 05:22:51,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 33 states have internal predecessors, (75), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-28 05:22:51,691 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2024-11-28 05:22:51,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-28 05:22:51,692 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:51,692 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:51,701 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 05:22:51,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:51,896 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:22:51,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:51,896 INFO L85 PathProgramCache]: Analyzing trace with hash -713946755, now seen corresponding path program 5 times [2024-11-28 05:22:51,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:51,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586662272] [2024-11-28 05:22:51,897 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 05:22:51,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:51,940 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-11-28 05:22:51,941 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:22:52,735 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-28 05:22:52,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:52,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586662272] [2024-11-28 05:22:52,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586662272] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:22:52,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885319301] [2024-11-28 05:22:52,735 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 05:22:52,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:52,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:52,738 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:52,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 05:22:52,983 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-11-28 05:22:52,983 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:22:52,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-28 05:22:52,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:53,050 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:22:53,055 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:22:53,299 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-28 05:22:53,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:22:53,646 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-28 05:22:53,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885319301] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:22:53,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:22:53,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 10] total 28 [2024-11-28 05:22:53,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535098776] [2024-11-28 05:22:53,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:22:53,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-28 05:22:53,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:53,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-28 05:22:53,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2024-11-28 05:22:53,649 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 28 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 25 states have internal predecessors, (72), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-28 05:22:54,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:22:54,725 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2024-11-28 05:22:54,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-28 05:22:54,725 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 25 states have internal predecessors, (72), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2024-11-28 05:22:54,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:22:54,726 INFO L225 Difference]: With dead ends: 92 [2024-11-28 05:22:54,726 INFO L226 Difference]: Without dead ends: 81 [2024-11-28 05:22:54,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=333, Invalid=2117, Unknown=0, NotChecked=0, Total=2450 [2024-11-28 05:22:54,727 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 136 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:22:54,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 378 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 05:22:54,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-28 05:22:54,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2024-11-28 05:22:54,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.125) internal successors, (72), 65 states have internal predecessors, (72), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-28 05:22:54,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2024-11-28 05:22:54,731 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 61 [2024-11-28 05:22:54,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:22:54,736 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2024-11-28 05:22:54,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 25 states have internal predecessors, (72), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-28 05:22:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2024-11-28 05:22:54,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-28 05:22:54,738 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:54,738 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:54,748 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 05:22:54,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-28 05:22:54,939 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:22:54,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:54,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1111822361, now seen corresponding path program 6 times [2024-11-28 05:22:54,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:54,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649900682] [2024-11-28 05:22:54,939 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 05:22:54,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:54,982 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-28 05:22:54,982 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:22:59,163 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 9 proven. 56 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 05:22:59,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:59,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649900682] [2024-11-28 05:22:59,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649900682] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:22:59,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763814533] [2024-11-28 05:22:59,164 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 05:22:59,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:59,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:59,166 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:59,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 05:22:59,399 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-28 05:22:59,399 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:22:59,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-11-28 05:22:59,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:59,472 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:22:59,559 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:22:59,894 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:22:59,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 05:23:00,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 05:23:00,088 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 05:23:00,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-28 05:23:01,233 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 38 proven. 31 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-28 05:23:01,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:23:02,268 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 13 proven. 31 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-28 05:23:02,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763814533] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:23:02,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:23:02,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22, 13] total 56 [2024-11-28 05:23:02,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492264606] [2024-11-28 05:23:02,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:23:02,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-28 05:23:02,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:23:02,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-28 05:23:02,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2925, Unknown=0, NotChecked=0, Total=3080 [2024-11-28 05:23:02,271 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 51 states have internal predecessors, (117), 5 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-28 05:23:09,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:23:09,730 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2024-11-28 05:23:09,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-28 05:23:09,731 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 51 states have internal predecessors, (117), 5 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) Word has length 63 [2024-11-28 05:23:09,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:23:09,732 INFO L225 Difference]: With dead ends: 125 [2024-11-28 05:23:09,732 INFO L226 Difference]: Without dead ends: 122 [2024-11-28 05:23:09,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1570 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=624, Invalid=9078, Unknown=0, NotChecked=0, Total=9702 [2024-11-28 05:23:09,735 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 352 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 2866 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 2910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:23:09,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 988 Invalid, 2910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2866 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-28 05:23:09,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-28 05:23:09,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 90. [2024-11-28 05:23:09,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 82 states have (on average 1.1219512195121952) internal successors, (92), 83 states have internal predecessors, (92), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-28 05:23:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2024-11-28 05:23:09,741 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 63 [2024-11-28 05:23:09,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:23:09,741 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2024-11-28 05:23:09,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 51 states have internal predecessors, (117), 5 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-28 05:23:09,742 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2024-11-28 05:23:09,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-28 05:23:09,742 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:23:09,742 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:23:09,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 05:23:09,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-28 05:23:09,950 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:23:09,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:23:09,950 INFO L85 PathProgramCache]: Analyzing trace with hash -2094384336, now seen corresponding path program 1 times [2024-11-28 05:23:09,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:23:09,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707811459] [2024-11-28 05:23:09,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:23:09,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:23:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:23:10,835 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-28 05:23:10,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:23:10,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707811459] [2024-11-28 05:23:10,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707811459] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:23:10,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204843223] [2024-11-28 05:23:10,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:23:10,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:23:10,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:23:10,839 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:23:10,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 05:23:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:23:11,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-28 05:23:11,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:23:11,092 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:23:11,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:23:11,148 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:23:11,237 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 05:23:11,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-28 05:23:11,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 05:23:11,696 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:23:11,696 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 33 treesize of output 32 [2024-11-28 05:23:11,738 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 24 treesize of output 12 [2024-11-28 05:23:11,741 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-28 05:23:11,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:23:11,852 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1490 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) (+ |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 4)) v_ArrVal_1490) c_~head~0.base) (+ c_~head~0.offset 4)) 0))) is different from false [2024-11-28 05:23:11,865 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1490 (Array Int Int))) (not (= (let ((.cse0 (+ c_~head~0.offset 4))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) .cse0) v_ArrVal_1490) c_~head~0.base) .cse0)) 0))) is different from false [2024-11-28 05:23:12,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:23:12,258 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 19 treesize of output 20 [2024-11-28 05:23:12,264 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 33 treesize of output 25 [2024-11-28 05:23:12,269 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 20 treesize of output 18 [2024-11-28 05:23:12,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204843223] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:23:12,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:23:12,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 25 [2024-11-28 05:23:12,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252867707] [2024-11-28 05:23:12,332 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:23:12,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-28 05:23:12,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:23:12,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-28 05:23:12,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=943, Unknown=9, NotChecked=126, Total=1190 [2024-11-28 05:23:12,333 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 25 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-28 05:23:13,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:23:13,424 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2024-11-28 05:23:13,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-28 05:23:13,425 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2024-11-28 05:23:13,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:23:13,425 INFO L225 Difference]: With dead ends: 111 [2024-11-28 05:23:13,425 INFO L226 Difference]: Without dead ends: 111 [2024-11-28 05:23:13,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=439, Invalid=2866, Unknown=9, NotChecked=226, Total=3540 [2024-11-28 05:23:13,426 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 126 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:23:13,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 397 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 05:23:13,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-28 05:23:13,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2024-11-28 05:23:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 90 states have internal predecessors, (100), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 05:23:13,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2024-11-28 05:23:13,430 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 66 [2024-11-28 05:23:13,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:23:13,430 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2024-11-28 05:23:13,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-28 05:23:13,431 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2024-11-28 05:23:13,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 05:23:13,431 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:23:13,431 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:23:13,440 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 05:23:13,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-28 05:23:13,632 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:23:13,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:23:13,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1634344620, now seen corresponding path program 2 times [2024-11-28 05:23:13,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:23:13,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94318947] [2024-11-28 05:23:13,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:23:13,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:23:13,666 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:23:13,666 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:23:16,635 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 19 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-28 05:23:16,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:23:16,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94318947] [2024-11-28 05:23:16,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94318947] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:23:16,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518789435] [2024-11-28 05:23:16,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:23:16,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:23:16,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:23:16,637 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:23:16,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 05:23:16,899 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:23:16,899 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:23:16,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 131 conjuncts are in the unsatisfiable core [2024-11-28 05:23:16,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:23:16,975 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 22 treesize of output 1 [2024-11-28 05:23:17,159 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:23:17,191 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:23:17,201 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:23:17,271 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~head~0.offset 0) (= (select |c_#valid| c_~head~0.base) 1) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (or (exists ((|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |c_#memory_int#1|))) (and (= .cse0 c_~head~0.base) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse0 (select |c_#memory_int#1| .cse0))) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| .cse1) 0))))) (< 4 (select (select |c_#memory_int#1| .cse1) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0)) is different from false [2024-11-28 05:23:17,273 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~head~0.offset 0) (= (select |c_#valid| c_~head~0.base) 1) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (or (exists ((|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |c_#memory_int#1|))) (and (= .cse0 c_~head~0.base) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse0 (select |c_#memory_int#1| .cse0))) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| .cse1) 0))))) (< 4 (select (select |c_#memory_int#1| .cse1) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0)) is different from true [2024-11-28 05:23:17,343 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 41 treesize of output 33 [2024-11-28 05:23:17,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 05:23:17,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 05:23:17,537 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 05:23:17,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-28 05:23:17,565 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 05:23:17,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2024-11-28 05:23:17,595 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2024-11-28 05:23:17,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-28 05:23:17,629 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 7 [2024-11-28 05:23:17,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 05:23:17,674 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 05:23:17,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-28 05:23:17,685 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (not (= .cse0 c_~head~0.base)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= c_~head~0.offset 0) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (or (exists ((|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int)))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_52| c_~head~0.base (select |c_#memory_int#1| c_~head~0.base))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (= .cse0 .cse1) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse1))) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| .cse2) 0))))))) (< 4 (select (select |c_#memory_int#1| .cse2) 0)) (= .cse2 c_~head~0.base))))) is different from false [2024-11-28 05:23:17,689 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (not (= .cse0 c_~head~0.base)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= c_~head~0.offset 0) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (or (exists ((|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int)))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_52| c_~head~0.base (select |c_#memory_int#1| c_~head~0.base))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (= .cse0 .cse1) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse1))) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| .cse2) 0))))))) (< 4 (select (select |c_#memory_int#1| .cse2) 0)) (= .cse2 c_~head~0.base))))) is different from true [2024-11-28 05:23:17,754 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= |c_ULTIMATE.start_main_~mylist~0#1.base| c_~head~0.base) (not (= .cse0 c_~head~0.base)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= c_~head~0.offset 0) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (or (exists ((|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int)))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_52| c_~head~0.base (select |c_#memory_int#1| c_~head~0.base))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (= .cse0 .cse1) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse1))) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| .cse2) 0))))))) (< 4 (select (select |c_#memory_int#1| .cse2) 0)) (= .cse2 c_~head~0.base))) (= |c_ULTIMATE.start_main_~mylist~0#1.offset| 0))) is different from false [2024-11-28 05:23:17,756 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= |c_ULTIMATE.start_main_~mylist~0#1.base| c_~head~0.base) (not (= .cse0 c_~head~0.base)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= c_~head~0.offset 0) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (or (exists ((|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int)))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_52| c_~head~0.base (select |c_#memory_int#1| c_~head~0.base))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (= .cse0 .cse1) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse1))) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| .cse2) 0))))))) (< 4 (select (select |c_#memory_int#1| .cse2) 0)) (= .cse2 c_~head~0.base))) (= |c_ULTIMATE.start_main_~mylist~0#1.offset| 0))) is different from true [2024-11-28 05:23:18,079 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (not (= .cse0 c_~head~0.base)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_search_list_~l#1.offset| 0) (= c_~head~0.offset 0) (= |c_ULTIMATE.start_search_list_~l#1.base| c_~head~0.base) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (or (exists ((|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int)))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_52| c_~head~0.base (select |c_#memory_int#1| c_~head~0.base))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (= .cse0 .cse1) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse1))) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| .cse2) 0))))))) (< 4 (select (select |c_#memory_int#1| .cse2) 0)) (= .cse2 c_~head~0.base))))) is different from false [2024-11-28 05:23:18,082 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (not (= .cse0 c_~head~0.base)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_search_list_~l#1.offset| 0) (= c_~head~0.offset 0) (= |c_ULTIMATE.start_search_list_~l#1.base| c_~head~0.base) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (or (exists ((|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int)))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_52| c_~head~0.base (select |c_#memory_int#1| c_~head~0.base))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (= .cse0 .cse1) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse1))) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| .cse2) 0))))))) (< 4 (select (select |c_#memory_int#1| .cse2) 0)) (= .cse2 c_~head~0.base))))) is different from true [2024-11-28 05:23:18,234 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (not (= .cse0 c_~head~0.base)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= c_~head~0.offset 0) (= |c_ULTIMATE.start_search_list_~l#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (or (exists ((|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int)))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_52| c_~head~0.base (select |c_#memory_int#1| c_~head~0.base))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (= .cse0 .cse1) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse1))) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| .cse2) 0))))))) (< 4 (select (select |c_#memory_int#1| .cse2) 0)) (= .cse2 c_~head~0.base))))) is different from false [2024-11-28 05:23:18,236 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (not (= .cse0 c_~head~0.base)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= c_~head~0.offset 0) (= |c_ULTIMATE.start_search_list_~l#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (or (exists ((|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int)))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_52| c_~head~0.base (select |c_#memory_int#1| c_~head~0.base))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (= .cse0 .cse1) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse1 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse1))) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| .cse2) 0))))))) (< 4 (select (select |c_#memory_int#1| .cse2) 0)) (= .cse2 c_~head~0.base))))) is different from true [2024-11-28 05:23:18,378 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (and (not (= .cse0 c_~head~0.base)) (= (select .cse1 4) 0) (= c_~head~0.offset 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (and (= |c_ULTIMATE.start_search_list_~l#1.offset| (select .cse1 .cse2)) (= |c_ULTIMATE.start_search_list_~l#1.base| (select .cse3 .cse2))))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (let ((.cse5 (select .cse3 4))) (or (exists ((|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int)))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_52| c_~head~0.base (select |c_#memory_int#1| c_~head~0.base))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (= .cse0 .cse4) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse4 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse4))) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| .cse5) 0))))))) (< 4 (select (select |c_#memory_int#1| .cse5) 0)) (= .cse5 c_~head~0.base)))))) is different from false [2024-11-28 05:23:18,381 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (and (not (= .cse0 c_~head~0.base)) (= (select .cse1 4) 0) (= c_~head~0.offset 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (and (= |c_ULTIMATE.start_search_list_~l#1.offset| (select .cse1 .cse2)) (= |c_ULTIMATE.start_search_list_~l#1.base| (select .cse3 .cse2))))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (let ((.cse5 (select .cse3 4))) (or (exists ((|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int)))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_52| c_~head~0.base (select |c_#memory_int#1| c_~head~0.base))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (= .cse0 .cse4) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse4 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse4))) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| .cse5) 0))))))) (< 4 (select (select |c_#memory_int#1| .cse5) 0)) (= .cse5 c_~head~0.base)))))) is different from true [2024-11-28 05:23:18,547 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (and (not (= .cse0 c_~head~0.base)) (= (select .cse1 4) 0) (= c_~head~0.offset 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (and (= (select .cse1 .cse2) |c_ULTIMATE.start_search_list_#res#1.offset|) (= |c_ULTIMATE.start_search_list_#res#1.base| (select .cse3 .cse2))))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (let ((.cse5 (select .cse3 4))) (or (exists ((|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int)))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_52| c_~head~0.base (select |c_#memory_int#1| c_~head~0.base))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (= .cse0 .cse4) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse4 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse4))) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| .cse5) 0))))))) (< 4 (select (select |c_#memory_int#1| .cse5) 0)) (= .cse5 c_~head~0.base)))))) is different from false [2024-11-28 05:23:18,551 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (and (not (= .cse0 c_~head~0.base)) (= (select .cse1 4) 0) (= c_~head~0.offset 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (and (= (select .cse1 .cse2) |c_ULTIMATE.start_search_list_#res#1.offset|) (= |c_ULTIMATE.start_search_list_#res#1.base| (select .cse3 .cse2))))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (let ((.cse5 (select .cse3 4))) (or (exists ((|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int)))) (and (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_52| c_~head~0.base (select |c_#memory_int#1| c_~head~0.base))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (= .cse0 .cse4) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse4 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse4))) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| .cse5) 0))))))) (< 4 (select (select |c_#memory_int#1| .cse5) 0)) (= .cse5 c_~head~0.base)))))) is different from true [2024-11-28 05:23:18,621 INFO L349 Elim1Store]: treesize reduction 3, result has 85.0 percent of original size [2024-11-28 05:23:18,621 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 23 treesize of output 24 [2024-11-28 05:23:18,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 05:23:18,659 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 15 treesize of output 3 [2024-11-28 05:23:18,676 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (and (not (= .cse0 c_~head~0.base)) (= (select .cse1 4) 0) (= c_~head~0.offset 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (and (= |c_ULTIMATE.start_main_~temp~0#1.base| (select .cse2 .cse3)) (= (select .cse1 .cse3) |c_ULTIMATE.start_main_~temp~0#1.offset|)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (let ((.cse4 (select .cse2 4))) (or (not (= |c_ULTIMATE.start_main_~temp~0#1.base| .cse4)) (= .cse4 c_~head~0.base) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int))) (|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (= .cse0 .cse5) (<= (select (select (store |v_old(#memory_int#1)_AFTER_CALL_52| c_~head~0.base v_DerPreprocessor_1) |c_ULTIMATE.start_main_~temp~0#1.base|) 0) 2) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse5 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse5))) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| .cse4) 0))))) (not (= |c_ULTIMATE.start_main_~temp~0#1.offset| 0))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0)))) is different from false [2024-11-28 05:23:18,680 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (and (not (= .cse0 c_~head~0.base)) (= (select .cse1 4) 0) (= c_~head~0.offset 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (and (= |c_ULTIMATE.start_main_~temp~0#1.base| (select .cse2 .cse3)) (= (select .cse1 .cse3) |c_ULTIMATE.start_main_~temp~0#1.offset|)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (let ((.cse4 (select .cse2 4))) (or (not (= |c_ULTIMATE.start_main_~temp~0#1.base| .cse4)) (= .cse4 c_~head~0.base) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int))) (|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (= .cse0 .cse5) (<= (select (select (store |v_old(#memory_int#1)_AFTER_CALL_52| c_~head~0.base v_DerPreprocessor_1) |c_ULTIMATE.start_main_~temp~0#1.base|) 0) 2) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse5 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse5))) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| .cse4) 0))))) (not (= |c_ULTIMATE.start_main_~temp~0#1.offset| 0))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0)))) is different from true [2024-11-28 05:23:18,729 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (and (not (= .cse0 c_~head~0.base)) (= (select .cse1 4) 0) (= c_~head~0.offset 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (and (= |c_ULTIMATE.start_main_~temp~0#1.base| (select .cse2 .cse3)) (= (select .cse1 .cse3) |c_ULTIMATE.start_main_~temp~0#1.offset|)))) (let ((.cse4 (select .cse2 4))) (or (not (= |c_ULTIMATE.start_main_~temp~0#1.base| .cse4)) (= .cse4 c_~head~0.base) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int))) (|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (= .cse0 .cse5) (<= (select (select (store |v_old(#memory_int#1)_AFTER_CALL_52| c_~head~0.base v_DerPreprocessor_1) |c_ULTIMATE.start_main_~temp~0#1.base|) 0) 2) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse5 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse5))) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| .cse4) 0))))) (not (= |c_ULTIMATE.start_main_~temp~0#1.offset| 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0)))) is different from false [2024-11-28 05:23:18,733 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (and (not (= .cse0 c_~head~0.base)) (= (select .cse1 4) 0) (= c_~head~0.offset 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (and (= |c_ULTIMATE.start_main_~temp~0#1.base| (select .cse2 .cse3)) (= (select .cse1 .cse3) |c_ULTIMATE.start_main_~temp~0#1.offset|)))) (let ((.cse4 (select .cse2 4))) (or (not (= |c_ULTIMATE.start_main_~temp~0#1.base| .cse4)) (= .cse4 c_~head~0.base) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int))) (|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (= .cse0 .cse5) (<= (select (select (store |v_old(#memory_int#1)_AFTER_CALL_52| c_~head~0.base v_DerPreprocessor_1) |c_ULTIMATE.start_main_~temp~0#1.base|) 0) 2) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse5 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse5))) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| .cse4) 0))))) (not (= |c_ULTIMATE.start_main_~temp~0#1.offset| 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0)))) is different from true [2024-11-28 05:23:18,830 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse0))) (and (not (= .cse0 c_~head~0.base)) (= (select .cse1 4) 0) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse6 (select .cse3 4))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse2 (select .cse1 .cse4))) (and (= |c_ULTIMATE.start_delete_list_~l#1.offset| .cse2) (not (= .cse2 0)) (= |c_ULTIMATE.start_delete_list_~l#1.base| (select .cse3 .cse4)))))) (and (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (and (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse1 .cse5)) (= |c_ULTIMATE.start_delete_list_~l#1.base| (select .cse3 .cse5))))) (= .cse6 c_~head~0.base)) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse9 (select .cse3 .cse7))) (and (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse1 .cse7)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int))) (|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (= .cse0 .cse8) (<= (select (select (store |v_old(#memory_int#1)_AFTER_CALL_52| c_~head~0.base v_DerPreprocessor_1) .cse9) 0) 2) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse8 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse8))) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| .cse6) 0))))) (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse9))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse10 (select .cse3 .cse11))) (and (not (= .cse10 .cse6)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse1 .cse11)) (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse10)))))))) (= c_~head~0.offset 0) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| c_~head~0.base) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0)))) is different from false [2024-11-28 05:23:18,835 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse0))) (and (not (= .cse0 c_~head~0.base)) (= (select .cse1 4) 0) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse6 (select .cse3 4))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse2 (select .cse1 .cse4))) (and (= |c_ULTIMATE.start_delete_list_~l#1.offset| .cse2) (not (= .cse2 0)) (= |c_ULTIMATE.start_delete_list_~l#1.base| (select .cse3 .cse4)))))) (and (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (and (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse1 .cse5)) (= |c_ULTIMATE.start_delete_list_~l#1.base| (select .cse3 .cse5))))) (= .cse6 c_~head~0.base)) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse9 (select .cse3 .cse7))) (and (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse1 .cse7)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int))) (|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (= .cse0 .cse8) (<= (select (select (store |v_old(#memory_int#1)_AFTER_CALL_52| c_~head~0.base v_DerPreprocessor_1) .cse9) 0) 2) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse8 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse8))) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| .cse6) 0))))) (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse9))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse10 (select .cse3 .cse11))) (and (not (= .cse10 .cse6)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse1 .cse11)) (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse10)))))))) (= c_~head~0.offset 0) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| c_~head~0.base) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0)))) is different from true [2024-11-28 05:23:18,944 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse0))) (and (not (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4) 0) (= (select .cse1 4) 0) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse4 (select .cse2 4))) (or (and (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (and (= |c_ULTIMATE.start_delete_list_~l#1.base| (select .cse2 .cse3)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse1 .cse3))))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse4)) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse5 (select .cse2 .cse6))) (and (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse5) (not (= .cse4 .cse5)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse1 .cse6)))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse9 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse7 (select .cse2 .cse9))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int))) (|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (<= (select (select (store |v_old(#memory_int#1)_AFTER_CALL_52| |c_ULTIMATE.start_delete_list_~tmp~0#1.base| v_DerPreprocessor_1) .cse7) 0) 2) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse8 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse8))) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| .cse4) 0)) (= .cse0 .cse8)))) (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse7) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse1 .cse9)))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse11 (select .cse1 .cse10))) (and (= |c_ULTIMATE.start_delete_list_~l#1.base| (select .cse2 .cse10)) (not (= .cse11 0)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| .cse11)))))))) (or (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| 0)) (not (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| |c_ULTIMATE.start_delete_list_~l#1.base|))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0)))) is different from false [2024-11-28 05:23:18,948 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse0))) (and (not (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4) 0) (= (select .cse1 4) 0) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse4 (select .cse2 4))) (or (and (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (and (= |c_ULTIMATE.start_delete_list_~l#1.base| (select .cse2 .cse3)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse1 .cse3))))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse4)) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse5 (select .cse2 .cse6))) (and (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse5) (not (= .cse4 .cse5)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse1 .cse6)))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse9 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse7 (select .cse2 .cse9))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int))) (|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (<= (select (select (store |v_old(#memory_int#1)_AFTER_CALL_52| |c_ULTIMATE.start_delete_list_~tmp~0#1.base| v_DerPreprocessor_1) .cse7) 0) 2) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse8 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse8))) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| .cse4) 0)) (= .cse0 .cse8)))) (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse7) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse1 .cse9)))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse11 (select .cse1 .cse10))) (and (= |c_ULTIMATE.start_delete_list_~l#1.base| (select .cse2 .cse10)) (not (= .cse11 0)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| .cse11)))))))) (or (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| 0)) (not (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| |c_ULTIMATE.start_delete_list_~l#1.base|))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0)))) is different from true [2024-11-28 05:23:19,044 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse0))) (and (= .cse0 |c_ULTIMATE.start_delete_list_#t~mem34#1.base|) (not (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4) 0) (= (select .cse1 4) 0) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse4 (select .cse2 4))) (or (and (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (and (= |c_ULTIMATE.start_delete_list_~l#1.base| (select .cse2 .cse3)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse1 .cse3))))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse4)) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse5 (select .cse2 .cse6))) (and (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse5) (not (= .cse4 .cse5)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse1 .cse6)))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse9 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse7 (select .cse2 .cse9))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int))) (|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (<= (select (select (store |v_old(#memory_int#1)_AFTER_CALL_52| |c_ULTIMATE.start_delete_list_~tmp~0#1.base| v_DerPreprocessor_1) .cse7) 0) 2) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse8 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse8))) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| .cse4) 0)) (= .cse0 .cse8)))) (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse7) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse1 .cse9)))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse11 (select .cse1 .cse10))) (and (= |c_ULTIMATE.start_delete_list_~l#1.base| (select .cse2 .cse10)) (not (= .cse11 0)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| .cse11)))))))) (= |c_ULTIMATE.start_delete_list_#t~mem34#1.offset| 0) (or (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| 0)) (not (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| |c_ULTIMATE.start_delete_list_~l#1.base|))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0)))) is different from false [2024-11-28 05:23:19,047 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse0))) (and (= .cse0 |c_ULTIMATE.start_delete_list_#t~mem34#1.base|) (not (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4) 0) (= (select .cse1 4) 0) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse4 (select .cse2 4))) (or (and (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (and (= |c_ULTIMATE.start_delete_list_~l#1.base| (select .cse2 .cse3)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse1 .cse3))))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse4)) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse5 (select .cse2 .cse6))) (and (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse5) (not (= .cse4 .cse5)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse1 .cse6)))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse9 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse7 (select .cse2 .cse9))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int))) (|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (<= (select (select (store |v_old(#memory_int#1)_AFTER_CALL_52| |c_ULTIMATE.start_delete_list_~tmp~0#1.base| v_DerPreprocessor_1) .cse7) 0) 2) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse8 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse8))) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| .cse4) 0)) (= .cse0 .cse8)))) (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse7) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse1 .cse9)))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse11 (select .cse1 .cse10))) (and (= |c_ULTIMATE.start_delete_list_~l#1.base| (select .cse2 .cse10)) (not (= .cse11 0)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| .cse11)))))))) (= |c_ULTIMATE.start_delete_list_#t~mem34#1.offset| 0) (or (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| 0)) (not (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| |c_ULTIMATE.start_delete_list_~l#1.base|))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0)))) is different from true [2024-11-28 05:23:19,139 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse12 (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| 0)))) (and (not (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4) 0) (= (select .cse1 4) 0) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse4 (select .cse2 4))) (or (and (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (and (= |c_ULTIMATE.start_delete_list_~l#1.base| (select .cse2 .cse3)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse1 .cse3))))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse4)) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse5 (select .cse2 .cse6))) (and (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse5) (not (= .cse4 .cse5)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse1 .cse6)))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse9 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse7 (select .cse2 .cse9))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int))) (|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (<= (select (select (store |v_old(#memory_int#1)_AFTER_CALL_52| |c_ULTIMATE.start_delete_list_~tmp~0#1.base| v_DerPreprocessor_1) .cse7) 0) 2) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse8 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse8))) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| .cse4) 0)) (= .cse0 .cse8)))) (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse7) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse1 .cse9)))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse11 (select .cse1 .cse10))) (and (= |c_ULTIMATE.start_delete_list_~l#1.base| (select .cse2 .cse10)) (not (= .cse11 0)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| .cse11)))))))) (or .cse12 (not (= .cse0 |c_ULTIMATE.start_delete_list_~l#1.base|))) (or .cse12 (not (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| |c_ULTIMATE.start_delete_list_~l#1.base|))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0)))) is different from false [2024-11-28 05:23:19,144 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse12 (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| 0)))) (and (not (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4) 0) (= (select .cse1 4) 0) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse4 (select .cse2 4))) (or (and (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (and (= |c_ULTIMATE.start_delete_list_~l#1.base| (select .cse2 .cse3)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse1 .cse3))))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse4)) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse5 (select .cse2 .cse6))) (and (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse5) (not (= .cse4 .cse5)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse1 .cse6)))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse9 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse7 (select .cse2 .cse9))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int))) (|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (<= (select (select (store |v_old(#memory_int#1)_AFTER_CALL_52| |c_ULTIMATE.start_delete_list_~tmp~0#1.base| v_DerPreprocessor_1) .cse7) 0) 2) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse8 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse8))) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| .cse4) 0)) (= .cse0 .cse8)))) (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse7) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse1 .cse9)))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse11 (select .cse1 .cse10))) (and (= |c_ULTIMATE.start_delete_list_~l#1.base| (select .cse2 .cse10)) (not (= .cse11 0)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| .cse11)))))))) (or .cse12 (not (= .cse0 |c_ULTIMATE.start_delete_list_~l#1.base|))) (or .cse12 (not (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| |c_ULTIMATE.start_delete_list_~l#1.base|))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0)))) is different from true [2024-11-28 05:23:19,975 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse8 (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| 0)))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int) (|v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse3 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse1 (select .cse2 .cse3))) (and (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse0) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| .cse1) (= (select .cse2 4) 0) (not (= .cse0 |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4) 0) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse0)) (= |c_ULTIMATE.start_delete_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse3)) (not (= .cse1 0))))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int) (|v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4))) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| .cse4)) (.cse6 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4)) (.cse7 (select |c_#memory_$Pointer$#1.base| .cse4))) (and (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse4) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse5 .cse6)) (= (select .cse5 4) 0) (not (= .cse4 |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4) 0) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse4)) (= |c_ULTIMATE.start_delete_list_~l#1.base| (select .cse7 .cse6)) (= (select .cse7 4) |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|))))) (and .cse8 (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int))) (|v_ULTIMATE.start_search_list_~l#1.offset_57| Int) (|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int))) (|v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse12 (select |c_#memory_$Pointer$#1.offset| .cse11)) (.cse14 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|)) (.cse9 (select .cse10 .cse13))) (and (<= (select (select (store |v_old(#memory_int#1)_AFTER_CALL_52| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| v_DerPreprocessor_1) .cse9) 0) 2) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| (select .cse10 4)) 0)) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse11) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse12 .cse13)) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse14 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse14))) (= (select .cse12 4) 0) (= .cse11 .cse14) (not (= .cse11 |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4) 0) (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse9))))))) (and .cse8 (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int) (|v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4))) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| .cse15)) (.cse17 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse16 (select |c_#memory_$Pointer$#1.offset| .cse15)) (.cse18 (select .cse19 .cse17))) (and (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse15) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse16 .cse17)) (= (select .cse16 4) 0) (not (= .cse18 (select .cse19 4))) (not (= .cse15 |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4) 0) (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse18))))))) (and .cse8 (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int) (|v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| Int)) (let ((.cse20 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4))) (let ((.cse21 (select |c_#memory_$Pointer$#1.offset| .cse20)) (.cse22 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (and (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse20) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse21 .cse22)) (= (select .cse21 4) 0) (not (= .cse20 |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4) 0) (= |c_ULTIMATE.start_delete_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse20) .cse22))))))) (and .cse8 (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int) (|v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| Int)) (let ((.cse23 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4))) (let ((.cse24 (select |c_#memory_$Pointer$#1.offset| .cse23)) (.cse25 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4)) (.cse26 (select |c_#memory_$Pointer$#1.base| .cse23))) (and (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse23) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse24 .cse25)) (= (select .cse24 4) 0) (not (= .cse23 |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4) 0) (= |c_ULTIMATE.start_delete_list_~l#1.base| (select .cse26 .cse25)) (= (select .cse26 4) |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int) (|v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| Int)) (let ((.cse27 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4))) (let ((.cse31 (select |c_#memory_$Pointer$#1.base| .cse27)) (.cse29 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse28 (select |c_#memory_$Pointer$#1.offset| .cse27)) (.cse30 (select .cse31 .cse29))) (and (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse27) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse28 .cse29)) (= (select .cse28 4) 0) (not (= .cse30 (select .cse31 4))) (not (= .cse27 |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4) 0) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse27)) (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse30)))))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int))) (|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse37 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_search_list_~l#1.offset_57| Int) (|v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| Int)) (let ((.cse34 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4))) (let ((.cse33 (select |c_#memory_$Pointer$#1.base| .cse34)) (.cse36 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse35 (select |c_#memory_$Pointer$#1.offset| .cse34)) (.cse32 (select .cse33 .cse36))) (and (<= (select (select (store |v_old(#memory_int#1)_AFTER_CALL_52| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| v_DerPreprocessor_1) .cse32) 0) 2) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| (select .cse33 4)) 0)) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse34) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse35 .cse36)) (= (select .cse35 4) 0) (= .cse34 .cse37) (not (= .cse34 |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4) 0) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse34)) (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse32)))))) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse37 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse37)))))) (and .cse8 (or (exists ((|v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| Int)) (let ((.cse38 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4))) (let ((.cse39 (select |c_#memory_$Pointer$#1.offset| .cse38))) (and (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse38) (= (select .cse39 4) 0) (not (= .cse38 |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4) 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse40 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (and (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse39 .cse40)) (= |c_ULTIMATE.start_delete_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse38) .cse40))))))))) (exists ((|v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| Int)) (let ((.cse41 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4))) (let ((.cse42 (select |c_#memory_$Pointer$#1.offset| .cse41))) (and (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse41) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse45 (select |c_#memory_$Pointer$#1.base| .cse41)) (.cse43 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse44 (select .cse45 .cse43))) (and (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse42 .cse43)) (not (= .cse44 (select .cse45 4))) (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse44))))) (= (select .cse42 4) 0) (not (= .cse41 |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4) 0))))) (exists ((|v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| Int)) (let ((.cse46 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4))) (let ((.cse47 (select |c_#memory_$Pointer$#1.offset| .cse46))) (and (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse46) (= (select .cse47 4) 0) (not (= .cse46 |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4) 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse49 (select |c_#memory_$Pointer$#1.base| .cse46)) (.cse51 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse48 (select .cse49 .cse51))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int))) (|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse50 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (<= (select (select (store |v_old(#memory_int#1)_AFTER_CALL_52| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| v_DerPreprocessor_1) .cse48) 0) 2) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| (select .cse49 4)) 0)) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse50 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse50))) (= .cse46 .cse50)))) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse47 .cse51)) (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse48))))))))) (exists ((|v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| Int)) (let ((.cse52 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4))) (let ((.cse53 (select |c_#memory_$Pointer$#1.offset| .cse52)) (.cse55 (select |c_#memory_$Pointer$#1.base| .cse52))) (and (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse52) (= (select .cse53 4) 0) (not (= .cse52 |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4) 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse54 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (and (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse53 .cse54)) (= |c_ULTIMATE.start_delete_list_~l#1.base| (select .cse55 .cse54))))) (= (select .cse55 4) |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|))))))))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0)) is different from false [2024-11-28 05:23:19,983 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse8 (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| 0)))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int) (|v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse3 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse1 (select .cse2 .cse3))) (and (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse0) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| .cse1) (= (select .cse2 4) 0) (not (= .cse0 |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4) 0) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse0)) (= |c_ULTIMATE.start_delete_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse3)) (not (= .cse1 0))))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int) (|v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4))) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| .cse4)) (.cse6 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4)) (.cse7 (select |c_#memory_$Pointer$#1.base| .cse4))) (and (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse4) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse5 .cse6)) (= (select .cse5 4) 0) (not (= .cse4 |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4) 0) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse4)) (= |c_ULTIMATE.start_delete_list_~l#1.base| (select .cse7 .cse6)) (= (select .cse7 4) |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|))))) (and .cse8 (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int))) (|v_ULTIMATE.start_search_list_~l#1.offset_57| Int) (|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int))) (|v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse12 (select |c_#memory_$Pointer$#1.offset| .cse11)) (.cse14 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|)) (.cse9 (select .cse10 .cse13))) (and (<= (select (select (store |v_old(#memory_int#1)_AFTER_CALL_52| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| v_DerPreprocessor_1) .cse9) 0) 2) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| (select .cse10 4)) 0)) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse11) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse12 .cse13)) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse14 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse14))) (= (select .cse12 4) 0) (= .cse11 .cse14) (not (= .cse11 |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4) 0) (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse9))))))) (and .cse8 (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int) (|v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4))) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| .cse15)) (.cse17 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse16 (select |c_#memory_$Pointer$#1.offset| .cse15)) (.cse18 (select .cse19 .cse17))) (and (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse15) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse16 .cse17)) (= (select .cse16 4) 0) (not (= .cse18 (select .cse19 4))) (not (= .cse15 |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4) 0) (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse18))))))) (and .cse8 (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int) (|v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| Int)) (let ((.cse20 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4))) (let ((.cse21 (select |c_#memory_$Pointer$#1.offset| .cse20)) (.cse22 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (and (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse20) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse21 .cse22)) (= (select .cse21 4) 0) (not (= .cse20 |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4) 0) (= |c_ULTIMATE.start_delete_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse20) .cse22))))))) (and .cse8 (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int) (|v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| Int)) (let ((.cse23 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4))) (let ((.cse24 (select |c_#memory_$Pointer$#1.offset| .cse23)) (.cse25 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4)) (.cse26 (select |c_#memory_$Pointer$#1.base| .cse23))) (and (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse23) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse24 .cse25)) (= (select .cse24 4) 0) (not (= .cse23 |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4) 0) (= |c_ULTIMATE.start_delete_list_~l#1.base| (select .cse26 .cse25)) (= (select .cse26 4) |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int) (|v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| Int)) (let ((.cse27 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4))) (let ((.cse31 (select |c_#memory_$Pointer$#1.base| .cse27)) (.cse29 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse28 (select |c_#memory_$Pointer$#1.offset| .cse27)) (.cse30 (select .cse31 .cse29))) (and (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse27) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse28 .cse29)) (= (select .cse28 4) 0) (not (= .cse30 (select .cse31 4))) (not (= .cse27 |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4) 0) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse27)) (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse30)))))) (exists ((|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int))) (|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse37 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_search_list_~l#1.offset_57| Int) (|v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| Int)) (let ((.cse34 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4))) (let ((.cse33 (select |c_#memory_$Pointer$#1.base| .cse34)) (.cse36 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse35 (select |c_#memory_$Pointer$#1.offset| .cse34)) (.cse32 (select .cse33 .cse36))) (and (<= (select (select (store |v_old(#memory_int#1)_AFTER_CALL_52| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| v_DerPreprocessor_1) .cse32) 0) 2) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| (select .cse33 4)) 0)) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse34) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse35 .cse36)) (= (select .cse35 4) 0) (= .cse34 .cse37) (not (= .cse34 |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4) 0) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse34)) (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse32)))))) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse37 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse37)))))) (and .cse8 (or (exists ((|v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| Int)) (let ((.cse38 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4))) (let ((.cse39 (select |c_#memory_$Pointer$#1.offset| .cse38))) (and (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse38) (= (select .cse39 4) 0) (not (= .cse38 |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4) 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse40 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (and (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse39 .cse40)) (= |c_ULTIMATE.start_delete_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse38) .cse40))))))))) (exists ((|v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| Int)) (let ((.cse41 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4))) (let ((.cse42 (select |c_#memory_$Pointer$#1.offset| .cse41))) (and (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse41) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse45 (select |c_#memory_$Pointer$#1.base| .cse41)) (.cse43 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse44 (select .cse45 .cse43))) (and (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse42 .cse43)) (not (= .cse44 (select .cse45 4))) (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse44))))) (= (select .cse42 4) 0) (not (= .cse41 |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4) 0))))) (exists ((|v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| Int)) (let ((.cse46 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4))) (let ((.cse47 (select |c_#memory_$Pointer$#1.offset| .cse46))) (and (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse46) (= (select .cse47 4) 0) (not (= .cse46 |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4) 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse49 (select |c_#memory_$Pointer$#1.base| .cse46)) (.cse51 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (let ((.cse48 (select .cse49 .cse51))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_old(#memory_int#1)_AFTER_CALL_52| (Array Int (Array Int Int))) (|v_old(#memory_int#1)_AFTER_CALL_51| (Array Int (Array Int Int)))) (let ((.cse50 (@diff |v_old(#memory_int#1)_AFTER_CALL_51| |v_old(#memory_int#1)_AFTER_CALL_52|))) (and (<= (select (select (store |v_old(#memory_int#1)_AFTER_CALL_52| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| v_DerPreprocessor_1) .cse48) 0) 2) (<= 5 (select (select |v_old(#memory_int#1)_AFTER_CALL_51| (select .cse49 4)) 0)) (= |v_old(#memory_int#1)_AFTER_CALL_52| (store |v_old(#memory_int#1)_AFTER_CALL_51| .cse50 (select |v_old(#memory_int#1)_AFTER_CALL_52| .cse50))) (= .cse46 .cse50)))) (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse47 .cse51)) (= |c_ULTIMATE.start_delete_list_~l#1.base| .cse48))))))))) (exists ((|v_ULTIMATE.start_delete_list_~tmp~0#1.base_17| Int)) (let ((.cse52 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4))) (let ((.cse53 (select |c_#memory_$Pointer$#1.offset| .cse52)) (.cse55 (select |c_#memory_$Pointer$#1.base| .cse52))) (and (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| .cse52) (= (select .cse53 4) 0) (not (= .cse52 |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|) 4) 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_57| Int)) (let ((.cse54 (+ |v_ULTIMATE.start_search_list_~l#1.offset_57| 4))) (and (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select .cse53 .cse54)) (= |c_ULTIMATE.start_delete_list_~l#1.base| (select .cse55 .cse54))))) (= (select .cse55 4) |v_ULTIMATE.start_delete_list_~tmp~0#1.base_17|))))))))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0)) is different from true [2024-11-28 05:23:58,300 WARN L286 SmtUtils]: Spent 38.11s on a formula simplification. DAG size of input: 1951 DAG size of output: 1573 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-28 05:23:58,301 INFO L349 Elim1Store]: treesize reduction 2268, result has 60.7 percent of original size [2024-11-28 05:23:58,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 34 select indices, 34 select index equivalence classes, 0 disjoint index pairs (out of 561 index pairs), introduced 46 new quantified variables, introduced 561 case distinctions, treesize of input 1096 treesize of output 4156 [2024-11-28 05:24:00,186 INFO L224 Elim1Store]: Index analysis took 758 ms [2024-11-28 05:24:41,797 WARN L286 SmtUtils]: Spent 41.42s on a formula simplification. DAG size of input: 2164 DAG size of output: 1540 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-28 05:24:41,798 INFO L349 Elim1Store]: treesize reduction 3552, result has 47.3 percent of original size [2024-11-28 05:24:41,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 37 select indices, 37 select index equivalence classes, 0 disjoint index pairs (out of 666 index pairs), introduced 37 new quantified variables, introduced 666 case distinctions, treesize of input 620 treesize of output 3634 [2024-11-28 05:27:54,124 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-28 05:27:54,124 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-28 05:27:54,125 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-28 05:27:54,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 05:27:54,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-28 05:27:54,326 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:584) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 59 more [2024-11-28 05:27:54,331 INFO L158 Benchmark]: Toolchain (without parser) took 339635.03ms. Allocated memory was 117.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 91.2MB in the beginning and 1.1GB in the end (delta: -973.3MB). Peak memory consumption was 973.4MB. Max. memory is 16.1GB. [2024-11-28 05:27:54,332 INFO L158 Benchmark]: CDTParser took 1.80ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 74.0MB in the end (delta: 196.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:27:54,332 INFO L158 Benchmark]: CACSL2BoogieTranslator took 823.67ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 66.3MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 05:27:54,332 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.06ms. Allocated memory is still 117.4MB. Free memory was 66.0MB in the beginning and 64.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:27:54,332 INFO L158 Benchmark]: Boogie Preprocessor took 109.38ms. Allocated memory is still 117.4MB. Free memory was 64.3MB in the beginning and 61.9MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:27:54,334 INFO L158 Benchmark]: RCFGBuilder took 692.67ms. Allocated memory is still 117.4MB. Free memory was 61.9MB in the beginning and 46.3MB in the end (delta: 15.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:27:54,334 INFO L158 Benchmark]: TraceAbstraction took 337941.97ms. Allocated memory was 117.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 45.8MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 923.0MB. Max. memory is 16.1GB. [2024-11-28 05:27:54,336 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.80ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 74.0MB in the end (delta: 196.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 823.67ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 66.3MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.06ms. Allocated memory is still 117.4MB. Free memory was 66.0MB in the beginning and 64.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 109.38ms. Allocated memory is still 117.4MB. Free memory was 64.3MB in the beginning and 61.9MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 692.67ms. Allocated memory is still 117.4MB. Free memory was 61.9MB in the beginning and 46.3MB in the end (delta: 15.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 337941.97ms. Allocated memory was 117.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 45.8MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 923.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/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_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/list_search-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:27:56,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:27:56,894 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-28 05:27:56,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:27:56,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:27:56,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:27:56,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:27:56,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:27:56,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:27:56,965 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:27:56,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:27:56,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:27:56,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:27:56,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:27:56,966 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:27:56,966 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:27:56,966 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 05:27:56,966 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:27:56,967 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:27:56,967 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:27:56,967 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:27:56,967 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 05:27:56,967 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 05:27:56,967 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 05:27:56,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:27:56,967 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 05:27:56,968 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 05:27:56,968 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 05:27:56,968 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 05:27:56,968 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 05:27:56,968 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:27:56,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 05:27:56,968 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:27:56,968 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:27:56,969 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:27:56,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:27:56,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:27:56,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:27:56,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:27:56,969 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:27:56,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:27:56,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:27:56,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:27:56,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:27:56,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:27:56,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:27:56,970 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 05:27:56,970 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 05:27:56,971 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:27:56,971 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:27:56,971 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:27:56,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:27:56,972 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_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/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-memcleanup) ) 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 -> b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 [2024-11-28 05:27:57,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:27:57,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:27:57,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:27:57,282 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:27:57,282 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:27:57,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-properties/list_search-2.i [2024-11-28 05:28:00,121 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/data/21ae190e7/3205eab47e5c4b7698fc68ba024d5b7e/FLAGe8ac566af [2024-11-28 05:28:00,460 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:28:00,461 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/sv-benchmarks/c/list-properties/list_search-2.i [2024-11-28 05:28:00,485 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/data/21ae190e7/3205eab47e5c4b7698fc68ba024d5b7e/FLAGe8ac566af [2024-11-28 05:28:00,512 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/data/21ae190e7/3205eab47e5c4b7698fc68ba024d5b7e [2024-11-28 05:28:00,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:28:00,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:28:00,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:28:00,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:28:00,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:28:00,526 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:28:00" (1/1) ... [2024-11-28 05:28:00,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3000d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:00, skipping insertion in model container [2024-11-28 05:28:00,527 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:28:00" (1/1) ... [2024-11-28 05:28:00,582 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:28:01,063 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:28:01,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:28:01,082 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:28:01,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:28:01,205 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:28:01,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:01 WrapperNode [2024-11-28 05:28:01,206 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:28:01,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:28:01,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:28:01,208 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:28:01,218 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:28:01" (1/1) ... [2024-11-28 05:28:01,246 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:28:01" (1/1) ... [2024-11-28 05:28:01,267 INFO L138 Inliner]: procedures = 229, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 94 [2024-11-28 05:28:01,267 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:28:01,268 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:28:01,268 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:28:01,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:28:01,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:01" (1/1) ... [2024-11-28 05:28:01,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:01" (1/1) ... [2024-11-28 05:28:01,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:01" (1/1) ... [2024-11-28 05:28:01,296 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 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:28:01,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:01" (1/1) ... [2024-11-28 05:28:01,297 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:01" (1/1) ... [2024-11-28 05:28:01,306 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:01" (1/1) ... [2024-11-28 05:28:01,307 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:01" (1/1) ... [2024-11-28 05:28:01,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:01" (1/1) ... [2024-11-28 05:28:01,313 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:01" (1/1) ... [2024-11-28 05:28:01,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:01" (1/1) ... [2024-11-28 05:28:01,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:28:01,318 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:28:01,318 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:28:01,318 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:28:01,319 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:01" (1/1) ... [2024-11-28 05:28:01,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:28:01,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:28:01,361 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/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:28:01,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/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:28:01,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-28 05:28:01,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-28 05:28:01,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 05:28:01,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 05:28:01,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-28 05:28:01,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-28 05:28:01,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 05:28:01,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 05:28:01,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 05:28:01,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 05:28:01,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:28:01,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 05:28:01,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 05:28:01,391 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2024-11-28 05:28:01,391 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2024-11-28 05:28:01,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:28:01,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:28:01,587 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:28:01,589 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:28:01,988 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-28 05:28:01,988 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:28:02,000 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:28:02,001 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-28 05:28:02,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:28:02 BoogieIcfgContainer [2024-11-28 05:28:02,001 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:28:02,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:28:02,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:28:02,010 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:28:02,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:28:00" (1/3) ... [2024-11-28 05:28:02,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190daa7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:28:02, skipping insertion in model container [2024-11-28 05:28:02,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:01" (2/3) ... [2024-11-28 05:28:02,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190daa7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:28:02, skipping insertion in model container [2024-11-28 05:28:02,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:28:02" (3/3) ... [2024-11-28 05:28:02,015 INFO L128 eAbstractionObserver]: Analyzing ICFG list_search-2.i [2024-11-28 05:28:02,032 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:28:02,034 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG list_search-2.i that has 2 procedures, 44 locations, 1 initial locations, 4 loop locations, and 2 error locations. [2024-11-28 05:28:02,082 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:28:02,099 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;@7e8eee61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:28:02,101 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-28 05:28:02,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 38 states have internal predecessors, (51), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 05:28:02,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-28 05:28:02,112 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:28:02,112 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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:28:02,113 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:28:02,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:28:02,118 INFO L85 PathProgramCache]: Analyzing trace with hash -415259668, now seen corresponding path program 1 times [2024-11-28 05:28:02,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:28:02,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [954168068] [2024-11-28 05:28:02,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:28:02,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:02,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:28:02,138 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:28:02,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 05:28:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:28:02,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 05:28:02,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:28:02,462 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-28 05:28:02,462 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:28:02,462 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:28:02,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954168068] [2024-11-28 05:28:02,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954168068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:28:02,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:28:02,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:28:02,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727694785] [2024-11-28 05:28:02,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:28:02,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 05:28:02,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:28:02,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 05:28:02,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 05:28:02,497 INFO L87 Difference]: Start difference. First operand has 44 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 38 states have internal predecessors, (51), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-28 05:28:02,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:28:02,512 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2024-11-28 05:28:02,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 05:28:02,513 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2024-11-28 05:28:02,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:28:02,519 INFO L225 Difference]: With dead ends: 43 [2024-11-28 05:28:02,520 INFO L226 Difference]: Without dead ends: 41 [2024-11-28 05:28:02,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 05:28:02,527 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:28:02,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:28:02,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-28 05:28:02,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-28 05:28:02,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 35 states have internal predecessors, (42), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 05:28:02,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2024-11-28 05:28:02,574 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 39 [2024-11-28 05:28:02,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:28:02,576 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2024-11-28 05:28:02,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-28 05:28:02,577 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2024-11-28 05:28:02,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 05:28:02,579 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:28:02,579 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 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:28:02,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 05:28:02,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:02,783 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:28:02,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:28:02,784 INFO L85 PathProgramCache]: Analyzing trace with hash 126852133, now seen corresponding path program 1 times [2024-11-28 05:28:02,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:28:02,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1716706641] [2024-11-28 05:28:02,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:28:02,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:02,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:28:02,786 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:28:02,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 05:28:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:28:03,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 05:28:03,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:28:03,121 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 05:28:03,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:28:03,290 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-28 05:28:03,290 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:28:03,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716706641] [2024-11-28 05:28:03,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716706641] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:28:03,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:28:03,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2024-11-28 05:28:03,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563191287] [2024-11-28 05:28:03,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:28:03,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:28:03,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:28:03,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:28:03,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:28:03,295 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 05:28:03,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:28:03,650 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2024-11-28 05:28:03,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 05:28:03,653 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2024-11-28 05:28:03,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:28:03,655 INFO L225 Difference]: With dead ends: 54 [2024-11-28 05:28:03,656 INFO L226 Difference]: Without dead ends: 54 [2024-11-28 05:28:03,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:28:03,661 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 77 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:28:03,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 178 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:28:03,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-28 05:28:03,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2024-11-28 05:28:03,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 39 states have internal predecessors, (46), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-28 05:28:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2024-11-28 05:28:03,672 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 41 [2024-11-28 05:28:03,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:28:03,673 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2024-11-28 05:28:03,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 05:28:03,675 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2024-11-28 05:28:03,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 05:28:03,676 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:28:03,676 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:28:03,687 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 05:28:03,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:03,878 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:28:03,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:28:03,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1617944995, now seen corresponding path program 1 times [2024-11-28 05:28:03,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:28:03,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1643769167] [2024-11-28 05:28:03,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:28:03,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:03,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:28:03,883 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:28:03,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 05:28:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:28:04,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 05:28:04,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:28:04,097 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-28 05:28:04,097 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:28:04,097 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:28:04,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643769167] [2024-11-28 05:28:04,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643769167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:28:04,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:28:04,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:28:04,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255301898] [2024-11-28 05:28:04,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:28:04,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:28:04,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:28:04,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:28:04,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:28:04,100 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-28 05:28:04,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:28:04,372 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2024-11-28 05:28:04,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:28:04,372 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), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2024-11-28 05:28:04,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:28:04,373 INFO L225 Difference]: With dead ends: 58 [2024-11-28 05:28:04,374 INFO L226 Difference]: Without dead ends: 58 [2024-11-28 05:28:04,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:28:04,375 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 49 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:28:04,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 135 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:28:04,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-28 05:28:04,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2024-11-28 05:28:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-28 05:28:04,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2024-11-28 05:28:04,381 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 41 [2024-11-28 05:28:04,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:28:04,382 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2024-11-28 05:28:04,382 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), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-28 05:28:04,382 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2024-11-28 05:28:04,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-28 05:28:04,383 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:28:04,383 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:28:04,393 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 05:28:04,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:04,584 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:28:04,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:28:04,585 INFO L85 PathProgramCache]: Analyzing trace with hash -872722881, now seen corresponding path program 1 times [2024-11-28 05:28:04,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:28:04,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [770373227] [2024-11-28 05:28:04,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:28:04,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:04,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:28:04,589 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:28:04,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 05:28:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:28:04,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-28 05:28:04,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:28:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-28 05:28:04,954 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:28:04,954 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:28:04,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770373227] [2024-11-28 05:28:04,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770373227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:28:04,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:28:04,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 05:28:04,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249054526] [2024-11-28 05:28:04,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:28:04,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:28:04,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:28:04,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:28:04,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:28:04,956 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-28 05:28:05,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:28:05,193 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2024-11-28 05:28:05,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:28:05,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2024-11-28 05:28:05,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:28:05,198 INFO L225 Difference]: With dead ends: 54 [2024-11-28 05:28:05,198 INFO L226 Difference]: Without dead ends: 54 [2024-11-28 05:28:05,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:28:05,199 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 9 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:28:05,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 242 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:28:05,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-28 05:28:05,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-28 05:28:05,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 47 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-28 05:28:05,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2024-11-28 05:28:05,206 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 43 [2024-11-28 05:28:05,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:28:05,207 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2024-11-28 05:28:05,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-28 05:28:05,207 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2024-11-28 05:28:05,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-28 05:28:05,208 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:28:05,208 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:28:05,218 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 05:28:05,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:05,410 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:28:05,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:28:05,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1682069507, now seen corresponding path program 1 times [2024-11-28 05:28:05,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:28:05,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [384745944] [2024-11-28 05:28:05,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:28:05,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:05,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:28:05,415 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:28:05,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 05:28:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:28:05,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 05:28:05,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:28:05,681 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-28 05:28:05,682 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:28:05,683 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:28:05,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384745944] [2024-11-28 05:28:05,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384745944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:28:05,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:28:05,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 05:28:05,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184939641] [2024-11-28 05:28:05,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:28:05,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:28:05,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:28:05,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:28:05,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:28:05,687 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-28 05:28:05,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:28:05,997 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2024-11-28 05:28:05,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:28:05,998 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2024-11-28 05:28:06,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:28:06,002 INFO L225 Difference]: With dead ends: 65 [2024-11-28 05:28:06,002 INFO L226 Difference]: Without dead ends: 65 [2024-11-28 05:28:06,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:28:06,003 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 49 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:28:06,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 182 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:28:06,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-28 05:28:06,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2024-11-28 05:28:06,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.1875) internal successors, (57), 49 states have internal predecessors, (57), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-28 05:28:06,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2024-11-28 05:28:06,017 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 43 [2024-11-28 05:28:06,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:28:06,017 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2024-11-28 05:28:06,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-28 05:28:06,018 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2024-11-28 05:28:06,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 05:28:06,019 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:28:06,021 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:28:06,034 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 05:28:06,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:06,222 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:28:06,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:28:06,222 INFO L85 PathProgramCache]: Analyzing trace with hash 28385003, now seen corresponding path program 1 times [2024-11-28 05:28:06,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:28:06,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1229283039] [2024-11-28 05:28:06,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:28:06,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:06,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:28:06,227 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:28:06,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 05:28:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:28:06,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-28 05:28:06,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:28:06,495 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:28:06,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-28 05:28:06,666 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-28 05:28:06,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:28:06,996 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-28 05:28:06,997 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:28:06,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229283039] [2024-11-28 05:28:06,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229283039] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:28:06,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:28:06,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2024-11-28 05:28:06,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139980322] [2024-11-28 05:28:06,998 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:28:06,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 05:28:06,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:28:06,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 05:28:06,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-28 05:28:06,999 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-28 05:28:08,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:28:08,220 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2024-11-28 05:28:08,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-28 05:28:08,221 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 47 [2024-11-28 05:28:08,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:28:08,221 INFO L225 Difference]: With dead ends: 67 [2024-11-28 05:28:08,222 INFO L226 Difference]: Without dead ends: 67 [2024-11-28 05:28:08,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2024-11-28 05:28:08,223 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 153 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:28:08,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 235 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 05:28:08,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-28 05:28:08,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2024-11-28 05:28:08,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.1875) internal successors, (57), 49 states have internal predecessors, (57), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 05:28:08,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2024-11-28 05:28:08,230 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 47 [2024-11-28 05:28:08,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:28:08,230 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2024-11-28 05:28:08,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-28 05:28:08,231 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2024-11-28 05:28:08,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-28 05:28:08,232 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:28:08,232 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:28:08,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 05:28:08,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:08,433 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:28:08,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:28:08,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1290743982, now seen corresponding path program 1 times [2024-11-28 05:28:08,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:28:08,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1149800421] [2024-11-28 05:28:08,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:28:08,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:08,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:28:08,435 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:28:08,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 05:28:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:28:08,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-28 05:28:08,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:28:08,659 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:28:08,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-28 05:28:08,866 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 05:28:08,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:28:09,192 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 05:28:09,192 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:28:09,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149800421] [2024-11-28 05:28:09,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149800421] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:28:09,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:28:09,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2024-11-28 05:28:09,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896201648] [2024-11-28 05:28:09,193 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:28:09,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 05:28:09,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:28:09,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 05:28:09,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-28 05:28:09,194 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 16 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-28 05:28:10,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:28:10,447 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2024-11-28 05:28:10,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 05:28:10,448 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 16 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2024-11-28 05:28:10,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:28:10,449 INFO L225 Difference]: With dead ends: 69 [2024-11-28 05:28:10,449 INFO L226 Difference]: Without dead ends: 69 [2024-11-28 05:28:10,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=210, Invalid=846, Unknown=0, NotChecked=0, Total=1056 [2024-11-28 05:28:10,450 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 135 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:28:10,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 267 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 05:28:10,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-28 05:28:10,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2024-11-28 05:28:10,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 53 states have internal predecessors, (62), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 05:28:10,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2024-11-28 05:28:10,456 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 49 [2024-11-28 05:28:10,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:28:10,456 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2024-11-28 05:28:10,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 16 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-28 05:28:10,457 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2024-11-28 05:28:10,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-28 05:28:10,457 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:28:10,458 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:28:10,467 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 05:28:10,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:10,658 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:28:10,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:28:10,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1121587267, now seen corresponding path program 1 times [2024-11-28 05:28:10,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:28:10,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [779486712] [2024-11-28 05:28:10,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:28:10,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:10,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:28:10,663 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:28:10,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 05:28:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:28:10,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-28 05:28:10,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:28:10,849 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 22 treesize of output 7 [2024-11-28 05:28:10,958 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-28 05:28:10,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:28:10,959 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:28:10,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779486712] [2024-11-28 05:28:10,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779486712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:28:10,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:28:10,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 05:28:10,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781562244] [2024-11-28 05:28:10,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:28:10,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 05:28:10,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:28:10,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 05:28:10,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:28:10,962 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-28 05:28:11,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:28:11,488 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2024-11-28 05:28:11,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:28:11,489 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2024-11-28 05:28:11,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:28:11,490 INFO L225 Difference]: With dead ends: 61 [2024-11-28 05:28:11,490 INFO L226 Difference]: Without dead ends: 61 [2024-11-28 05:28:11,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:28:11,491 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 26 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:28:11,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 190 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 05:28:11,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-28 05:28:11,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2024-11-28 05:28:11,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 53 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 05:28:11,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2024-11-28 05:28:11,496 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 51 [2024-11-28 05:28:11,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:28:11,496 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2024-11-28 05:28:11,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-28 05:28:11,496 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2024-11-28 05:28:11,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-28 05:28:11,497 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:28:11,497 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:28:11,508 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 05:28:11,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:11,699 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:28:11,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:28:11,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1586478219, now seen corresponding path program 2 times [2024-11-28 05:28:11,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:28:11,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1095403329] [2024-11-28 05:28:11,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:28:11,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:11,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:28:11,703 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:28:11,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 05:28:11,882 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:28:11,882 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:28:11,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-28 05:28:11,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:28:11,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 05:28:11,968 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:28:12,223 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:28:12,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 05:28:12,418 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-28 05:28:12,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-28 05:28:12,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-11-28 05:28:12,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 05:28:12,916 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 05:28:12,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2024-11-28 05:28:12,996 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 19 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:28:12,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:28:13,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:28:13,534 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 16 treesize of output 20 [2024-11-28 05:28:13,554 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_~head~0.base_81 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~head~0.base_81))) (not (= (select v_arrayElimArr_2 (_ bv4 32)) c_~head~0.base)) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#1.base| v_~head~0.base_81 v_arrayElimArr_2) c_~head~0.base) (bvadd c_~head~0.offset (_ bv4 32))))))) is different from false [2024-11-28 05:28:13,556 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:28:13,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095403329] [2024-11-28 05:28:13,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095403329] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:28:13,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [927539167] [2024-11-28 05:28:13,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:28:13,557 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:28:13,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:28:13,560 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:28:13,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-28 05:28:13,925 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:28:13,925 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:28:13,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-28 05:28:13,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:28:13,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 05:28:13,988 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:28:14,093 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:28:14,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 05:28:14,177 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-28 05:28:14,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-28 05:28:14,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-11-28 05:28:14,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 05:28:14,449 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 05:28:14,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:28:14,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:28:14,912 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 16 treesize of output 20 [2024-11-28 05:28:15,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [927539167] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:28:15,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:28:15,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 21 [2024-11-28 05:28:15,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096638600] [2024-11-28 05:28:15,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:28:15,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 05:28:15,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:28:15,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 05:28:15,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=676, Unknown=17, NotChecked=52, Total=812 [2024-11-28 05:28:15,175 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 05:28:18,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:28:18,736 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2024-11-28 05:28:18,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-28 05:28:18,736 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 53 [2024-11-28 05:28:18,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:28:18,737 INFO L225 Difference]: With dead ends: 77 [2024-11-28 05:28:18,737 INFO L226 Difference]: Without dead ends: 77 [2024-11-28 05:28:18,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=290, Invalid=2147, Unknown=17, NotChecked=96, Total=2550 [2024-11-28 05:28:18,739 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 156 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:28:18,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 427 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-28 05:28:18,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-28 05:28:18,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 66. [2024-11-28 05:28:18,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 59 states have internal predecessors, (68), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 05:28:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2024-11-28 05:28:18,749 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 53 [2024-11-28 05:28:18,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:28:18,750 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2024-11-28 05:28:18,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 05:28:18,750 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2024-11-28 05:28:18,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-28 05:28:18,751 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:28:18,751 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:28:18,758 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-28 05:28:18,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-28 05:28:19,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:19,152 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:28:19,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:28:19,152 INFO L85 PathProgramCache]: Analyzing trace with hash 958775000, now seen corresponding path program 1 times [2024-11-28 05:28:19,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:28:19,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [614355780] [2024-11-28 05:28:19,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:28:19,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:19,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:28:19,154 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:28:19,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 05:28:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:28:19,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-28 05:28:19,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:28:19,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 05:28:19,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:28:19,422 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 30 treesize of output 30 [2024-11-28 05:28:19,569 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-28 05:28:19,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:28:19,700 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-28 05:28:19,701 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:28:19,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614355780] [2024-11-28 05:28:19,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614355780] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:28:19,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:28:19,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2024-11-28 05:28:19,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993914876] [2024-11-28 05:28:19,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:28:19,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 05:28:19,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:28:19,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 05:28:19,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:28:19,702 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-28 05:28:20,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:28:20,277 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2024-11-28 05:28:20,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 05:28:20,278 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2024-11-28 05:28:20,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:28:20,278 INFO L225 Difference]: With dead ends: 69 [2024-11-28 05:28:20,279 INFO L226 Difference]: Without dead ends: 69 [2024-11-28 05:28:20,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-28 05:28:20,279 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:28:20,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 277 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 05:28:20,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-28 05:28:20,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-11-28 05:28:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 61 states have internal predecessors, (70), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 05:28:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2024-11-28 05:28:20,288 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 57 [2024-11-28 05:28:20,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:28:20,288 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2024-11-28 05:28:20,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-28 05:28:20,288 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2024-11-28 05:28:20,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-28 05:28:20,289 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:28:20,289 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:28:20,299 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-28 05:28:20,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:20,490 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:28:20,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:28:20,491 INFO L85 PathProgramCache]: Analyzing trace with hash -145820029, now seen corresponding path program 1 times [2024-11-28 05:28:20,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:28:20,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1403069116] [2024-11-28 05:28:20,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:28:20,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:20,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:28:20,493 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:28:20,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 05:28:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:28:20,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-28 05:28:20,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:28:20,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 05:28:20,715 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:28:21,736 INFO L349 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2024-11-28 05:28:21,737 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 2 case distinctions, treesize of input 64 treesize of output 54 [2024-11-28 05:28:21,782 INFO L349 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2024-11-28 05:28:21,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 39 [2024-11-28 05:28:22,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:28:22,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 272 [2024-11-28 05:28:23,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:28:23,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 156 treesize of output 208 [2024-11-28 05:28:53,947 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-28 05:28:53,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:28:55,325 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-28 05:28:55,326 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:28:55,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403069116] [2024-11-28 05:28:55,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403069116] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:28:55,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:28:55,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14] total 32 [2024-11-28 05:28:55,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140853768] [2024-11-28 05:28:55,326 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:28:55,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-28 05:28:55,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:28:55,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-28 05:28:55,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2024-11-28 05:28:55,328 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 32 states, 32 states have (on average 2.375) internal successors, (76), 30 states have internal predecessors, (76), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-28 05:29:04,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:29:10,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:29:10,552 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2024-11-28 05:29:10,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-28 05:29:10,552 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.375) internal successors, (76), 30 states have internal predecessors, (76), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2024-11-28 05:29:10,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:29:10,554 INFO L225 Difference]: With dead ends: 113 [2024-11-28 05:29:10,554 INFO L226 Difference]: Without dead ends: 113 [2024-11-28 05:29:10,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1198 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=589, Invalid=3966, Unknown=1, NotChecked=0, Total=4556 [2024-11-28 05:29:10,556 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 216 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:29:10,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 411 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 847 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2024-11-28 05:29:10,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-28 05:29:10,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 82. [2024-11-28 05:29:10,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 74 states have (on average 1.162162162162162) internal successors, (86), 75 states have internal predecessors, (86), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 05:29:10,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2024-11-28 05:29:10,572 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 59 [2024-11-28 05:29:10,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:29:10,572 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2024-11-28 05:29:10,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.375) internal successors, (76), 30 states have internal predecessors, (76), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-28 05:29:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2024-11-28 05:29:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-28 05:29:10,573 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:29:10,574 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:29:10,586 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 05:29:10,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:29:10,774 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:29:10,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:29:10,775 INFO L85 PathProgramCache]: Analyzing trace with hash -257287712, now seen corresponding path program 3 times [2024-11-28 05:29:10,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:29:10,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [389272688] [2024-11-28 05:29:10,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 05:29:10,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:29:10,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:29:10,777 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:29:10,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 05:29:11,181 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-28 05:29:11,181 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:29:11,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-28 05:29:11,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:29:11,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 05:29:11,261 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:29:11,495 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:29:11,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 05:29:11,715 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 05:29:11,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2024-11-28 05:29:11,754 INFO L349 Elim1Store]: treesize reduction 34, result has 37.0 percent of original size [2024-11-28 05:29:11,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 35 [2024-11-28 05:29:12,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 05:29:12,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 05:29:12,263 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 05:29:12,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-28 05:29:12,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:29:12,300 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 05:29:12,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 45 [2024-11-28 05:29:12,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:29:12,317 INFO L349 Elim1Store]: treesize reduction 6, result has 66.7 percent of original size [2024-11-28 05:29:12,318 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 1 case distinctions, treesize of input 32 treesize of output 26 [2024-11-28 05:29:13,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:29:13,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-28 05:29:13,556 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2024-11-28 05:29:13,556 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 26 [2024-11-28 05:29:13,646 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 05:29:13,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:29:14,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:29:14,383 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 40 treesize of output 41 [2024-11-28 05:29:14,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:29:14,392 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 34 treesize of output 38 [2024-11-28 05:29:14,417 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_~head~0.base_120 (_ BitVec 32)) (v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| v_~head~0.base_120))) (not (= (select v_arrayElimArr_8 (_ bv4 32)) c_~head~0.base)) (not (= (_ bv0 32) (let ((.cse1 (bvadd c_~head~0.offset (_ bv4 32)))) (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| v_~head~0.base_120 v_arrayElimArr_8))) (select .cse0 (select (select .cse0 c_~head~0.base) .cse1))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| v_~head~0.base_120 v_arrayElimArr_9) c_~head~0.base) .cse1)))))) (not (= c_~head~0.offset (select v_arrayElimArr_9 (_ bv4 32)))))) is different from false [2024-11-28 05:29:14,420 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:29:14,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389272688] [2024-11-28 05:29:14,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389272688] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:29:14,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1376468008] [2024-11-28 05:29:14,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 05:29:14,420 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:29:14,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:29:14,422 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:29:14,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-11-28 05:29:14,896 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-28 05:29:14,896 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:29:14,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-28 05:29:14,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:29:14,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 05:29:14,935 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:29:15,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 05:29:15,038 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:29:15,122 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 05:29:15,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2024-11-28 05:29:15,157 INFO L349 Elim1Store]: treesize reduction 34, result has 37.0 percent of original size [2024-11-28 05:29:15,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 35 [2024-11-28 05:29:15,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 05:29:15,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 05:29:15,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:29:15,411 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 05:29:15,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 45 [2024-11-28 05:29:15,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:29:15,431 INFO L349 Elim1Store]: treesize reduction 6, result has 66.7 percent of original size [2024-11-28 05:29:15,432 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 1 case distinctions, treesize of input 32 treesize of output 26 [2024-11-28 05:29:15,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:29:15,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-28 05:29:15,994 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-28 05:29:15,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:29:16,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:29:16,629 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 40 treesize of output 41 [2024-11-28 05:29:16,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:29:16,638 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 34 treesize of output 38 [2024-11-28 05:29:16,666 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_~head~0.base_126 (_ BitVec 32)) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| v_~head~0.base_126))) (not (= (let ((.cse1 (bvadd c_~head~0.offset (_ bv4 32)))) (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| v_~head~0.base_126 v_arrayElimArr_13))) (select .cse0 (select (select .cse0 c_~head~0.base) .cse1))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| v_~head~0.base_126 v_arrayElimArr_14) c_~head~0.base) .cse1)))) (_ bv0 32))) (not (= (select v_arrayElimArr_13 (_ bv4 32)) c_~head~0.base)) (not (= c_~head~0.offset (select v_arrayElimArr_14 (_ bv4 32)))))) is different from false [2024-11-28 05:29:16,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1376468008] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:29:16,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:29:16,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 28 [2024-11-28 05:29:16,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917794646] [2024-11-28 05:29:16,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:29:16,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-28 05:29:16,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:29:16,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-28 05:29:16,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1168, Unknown=2, NotChecked=138, Total=1406 [2024-11-28 05:29:16,670 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 25 states have internal predecessors, (61), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 05:29:22,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:29:22,633 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2024-11-28 05:29:22,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-28 05:29:22,634 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 25 states have internal predecessors, (61), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 59 [2024-11-28 05:29:22,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:29:22,635 INFO L225 Difference]: With dead ends: 99 [2024-11-28 05:29:22,635 INFO L226 Difference]: Without dead ends: 99 [2024-11-28 05:29:22,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=366, Invalid=3300, Unknown=2, NotChecked=238, Total=3906 [2024-11-28 05:29:22,637 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 232 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:29:22,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 499 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-28 05:29:22,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-28 05:29:22,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2024-11-28 05:29:22,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 80 states have (on average 1.1625) internal successors, (93), 81 states have internal predecessors, (93), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 05:29:22,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2024-11-28 05:29:22,642 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 59 [2024-11-28 05:29:22,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:29:22,642 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2024-11-28 05:29:22,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 25 states have internal predecessors, (61), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 05:29:22,643 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2024-11-28 05:29:22,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-28 05:29:22,643 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:29:22,644 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:29:22,649 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2024-11-28 05:29:22,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 05:29:23,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:29:23,044 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:29:23,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:29:23,045 INFO L85 PathProgramCache]: Analyzing trace with hash -870295589, now seen corresponding path program 2 times [2024-11-28 05:29:23,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:29:23,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [392151493] [2024-11-28 05:29:23,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:29:23,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:29:23,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:29:23,049 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:29:23,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 05:29:23,286 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:29:23,287 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:29:23,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-28 05:29:23,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:29:23,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 05:29:23,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-28 05:29:23,490 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:29:23,499 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:29:23,644 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 05:29:23,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-28 05:29:23,670 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-28 05:29:23,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-28 05:29:24,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 27 treesize of output 15 [2024-11-28 05:29:24,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 05:29:24,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 05:29:24,161 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-28 05:29:24,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:29:24,633 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_~head~0.base_132 (_ BitVec 32)) (v_ArrVal_914 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store |c_#memory_int#1| v_~head~0.base_132 v_ArrVal_914) c_~head~0.base) c_~head~0.offset) (_ bv2 32))) (not (= (_ bv0 1) (select |c_#valid| v_~head~0.base_132))))) is different from false [2024-11-28 05:29:24,635 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:29:24,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392151493] [2024-11-28 05:29:24,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392151493] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:29:24,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1602960240] [2024-11-28 05:29:24,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:29:24,636 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:29:24,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:29:24,637 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:29:24,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-28 05:29:25,100 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:29:25,101 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:29:25,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-28 05:29:25,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:29:25,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-28 05:29:25,447 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:29:25,453 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:29:25,638 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 05:29:25,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-28 05:29:26,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:29:26,084 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 41 treesize of output 41 [2024-11-28 05:29:26,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-28 05:29:26,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 05:29:26,801 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-28 05:29:26,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:29:28,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1602960240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:29:28,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:29:28,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 32 [2024-11-28 05:29:28,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414305944] [2024-11-28 05:29:28,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:29:28,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-28 05:29:28,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:29:28,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-28 05:29:28,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1932, Unknown=10, NotChecked=88, Total=2162 [2024-11-28 05:29:28,386 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand has 32 states, 32 states have (on average 2.28125) internal successors, (73), 30 states have internal predecessors, (73), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 05:29:32,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:29:32,096 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2024-11-28 05:29:32,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 05:29:32,097 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.28125) internal successors, (73), 30 states have internal predecessors, (73), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 63 [2024-11-28 05:29:32,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:29:32,098 INFO L225 Difference]: With dead ends: 83 [2024-11-28 05:29:32,098 INFO L226 Difference]: Without dead ends: 83 [2024-11-28 05:29:32,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=300, Invalid=3476, Unknown=10, NotChecked=120, Total=3906 [2024-11-28 05:29:32,099 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 55 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:29:32,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 465 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-28 05:29:32,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-28 05:29:32,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2024-11-28 05:29:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 72 states have (on average 1.1388888888888888) internal successors, (82), 73 states have internal predecessors, (82), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 05:29:32,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2024-11-28 05:29:32,103 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 63 [2024-11-28 05:29:32,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:29:32,104 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2024-11-28 05:29:32,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.28125) internal successors, (73), 30 states have internal predecessors, (73), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 05:29:32,104 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2024-11-28 05:29:32,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-28 05:29:32,105 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:29:32,105 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:29:32,117 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-28 05:29:32,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2024-11-28 05:29:32,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 05:29:32,506 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:29:32,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:29:32,506 INFO L85 PathProgramCache]: Analyzing trace with hash -965681227, now seen corresponding path program 4 times [2024-11-28 05:29:32,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:29:32,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [884055371] [2024-11-28 05:29:32,507 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 05:29:32,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:29:32,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:29:32,508 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:29:32,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-28 05:29:32,711 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 05:29:32,711 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:29:32,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 98 conjuncts are in the unsatisfiable core [2024-11-28 05:29:32,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:29:32,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 05:29:32,751 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 22 treesize of output 7 [2024-11-28 05:29:32,948 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:29:32,960 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:29:33,130 INFO L349 Elim1Store]: treesize reduction 34, result has 37.0 percent of original size [2024-11-28 05:29:33,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 35 [2024-11-28 05:29:33,142 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 19 [2024-11-28 05:29:33,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 05:29:33,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 05:29:33,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:29:33,671 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 63 treesize of output 46 [2024-11-28 05:29:33,698 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-28 05:29:33,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 39 [2024-11-28 05:29:33,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:29:33,707 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 22 treesize of output 17 [2024-11-28 05:29:33,721 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 3 [2024-11-28 05:29:33,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:29:33,760 INFO L349 Elim1Store]: treesize reduction 46, result has 37.8 percent of original size [2024-11-28 05:29:33,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 38 treesize of output 59 [2024-11-28 05:29:34,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 05:29:34,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 05:29:34,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:29:34,373 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 05:29:34,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 71 [2024-11-28 05:29:34,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:29:34,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:29:34,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:29:34,407 INFO L349 Elim1Store]: treesize reduction 6, result has 72.7 percent of original size [2024-11-28 05:29:34,408 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 51 treesize of output 35 [2024-11-28 05:29:34,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2024-11-28 05:29:34,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:29:34,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:29:34,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:29:34,456 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 51 treesize of output 49 [2024-11-28 05:29:36,539 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-28 05:29:36,540 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 59 [2024-11-28 05:29:36,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-28 05:29:36,701 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 53 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 05:29:36,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:29:37,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:29:37,720 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 82 treesize of output 80 [2024-11-28 05:29:37,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:29:37,730 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 73 treesize of output 71 [2024-11-28 05:29:37,798 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32))) (v_~head~0.base_144 (_ BitVec 32)) (v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1069 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= c_~head~0.base (select v_arrayElimArr_19 (_ bv4 32)))) (not (= c_~head~0.offset (select v_arrayElimArr_20 (_ bv4 32)))) (= (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| v_~head~0.base_144 v_arrayElimArr_20)) (.cse0 (store |c_#memory_$Pointer$#1.base| v_~head~0.base_144 v_arrayElimArr_19)) (.cse4 (bvadd c_~head~0.offset (_ bv4 32)))) (let ((.cse1 (select (select .cse0 c_~head~0.base) .cse4)) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 c_~head~0.base) .cse4)))) (select (select (store |c_#memory_int#1| v_~head~0.base_144 v_ArrVal_1069) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) (_ bv2 32)) (not (= (_ bv0 1) (select |c_#valid| v_~head~0.base_144))))) is different from false [2024-11-28 05:29:37,802 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:29:37,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884055371] [2024-11-28 05:29:37,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884055371] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:29:37,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1295804597] [2024-11-28 05:29:37,802 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 05:29:37,802 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:29:37,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:29:37,804 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:29:37,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-28 05:29:38,289 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 05:29:38,289 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:29:38,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-28 05:29:38,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:29:38,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 05:29:38,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-28 05:29:38,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:29:38,784 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:29:38,878 INFO L349 Elim1Store]: treesize reduction 34, result has 37.0 percent of original size [2024-11-28 05:29:38,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 35 [2024-11-28 05:29:38,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-28 05:29:39,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 05:29:39,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 05:29:39,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:29:39,898 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 55 treesize of output 38 [2024-11-28 05:29:39,925 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-28 05:29:39,925 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 1 case distinctions, treesize of input 24 treesize of output 31 [2024-11-28 05:29:39,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:29:39,974 INFO L349 Elim1Store]: treesize reduction 46, result has 37.8 percent of original size [2024-11-28 05:29:39,974 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 2 case distinctions, treesize of input 38 treesize of output 59 [2024-11-28 05:29:40,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:29:40,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-28 05:29:40,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 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 05:29:40,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 05:29:40,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:29:40,557 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 05:29:40,557 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 74 [2024-11-28 05:29:40,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:29:40,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:29:40,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:29:40,598 INFO L349 Elim1Store]: treesize reduction 6, result has 72.7 percent of original size [2024-11-28 05:29:40,598 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 1 case distinctions, treesize of input 51 treesize of output 35 [2024-11-28 05:29:40,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:29:40,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:29:40,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:29:40,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-11-28 05:29:40,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-11-28 05:29:44,806 INFO L349 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2024-11-28 05:29:44,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 65 [2024-11-28 05:29:44,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 05:29:44,966 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 57 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 05:29:44,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:29:46,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:29:46,729 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 171 treesize of output 156 [2024-11-28 05:29:46,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:29:46,740 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 150 treesize of output 138 [2024-11-28 05:29:46,804 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1151 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_~head~0.base_150 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| v_~head~0.base_150 v_arrayElimArr_26)) (.cse2 (store |c_#memory_$Pointer$#1.base| v_~head~0.base_150 v_arrayElimArr_25)) (.cse6 (bvadd c_~head~0.offset (_ bv4 32)))) (let ((.cse4 (select (select .cse2 c_~head~0.base) .cse6)) (.cse5 (bvadd (select (select .cse3 c_~head~0.base) .cse6) (_ bv4 32)))) (let ((.cse0 (select (select .cse2 .cse4) .cse5)) (.cse1 (select (select .cse3 .cse4) .cse5))) (or (= (_ bv2 32) (select (select (store |c_#memory_int#1| v_~head~0.base_150 v_ArrVal_1151) .cse0) .cse1)) (not (= (select v_arrayElimArr_25 (_ bv4 32)) c_~head~0.base)) (not (= (select (select .cse2 .cse0) (bvadd (_ bv4 32) .cse1)) (_ bv0 32))) (not (= c_~head~0.offset (select v_arrayElimArr_26 (_ bv4 32)))) (not (= (_ bv0 1) (select |c_#valid| v_~head~0.base_150)))))))) is different from false [2024-11-28 05:29:46,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1295804597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:29:46,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:29:46,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 31] total 47 [2024-11-28 05:29:46,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033883202] [2024-11-28 05:29:46,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:29:46,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-28 05:29:46,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:29:46,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-28 05:29:46,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=3068, Unknown=2, NotChecked=226, Total=3540 [2024-11-28 05:29:46,810 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 47 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 44 states have internal predecessors, (91), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-28 05:29:56,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:29:56,080 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2024-11-28 05:29:56,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-28 05:29:56,080 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 44 states have internal predecessors, (91), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 65 [2024-11-28 05:29:56,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:29:56,081 INFO L225 Difference]: With dead ends: 99 [2024-11-28 05:29:56,081 INFO L226 Difference]: Without dead ends: 99 [2024-11-28 05:29:56,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=482, Invalid=5530, Unknown=2, NotChecked=306, Total=6320 [2024-11-28 05:29:56,084 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 152 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:29:56,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 488 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1584 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-11-28 05:29:56,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-28 05:29:56,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 63. [2024-11-28 05:29:56,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 56 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 05:29:56,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2024-11-28 05:29:56,088 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 65 [2024-11-28 05:29:56,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:29:56,088 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2024-11-28 05:29:56,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 44 states have internal predecessors, (91), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-28 05:29:56,088 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2024-11-28 05:29:56,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 05:29:56,089 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:29:56,089 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:29:56,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2024-11-28 05:29:56,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-28 05:29:56,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:29:56,490 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:29:56,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:29:56,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1769928212, now seen corresponding path program 1 times [2024-11-28 05:29:56,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:29:56,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1930581709] [2024-11-28 05:29:56,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:29:56,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:29:56,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:29:56,492 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:29:56,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-28 05:29:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:29:56,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-28 05:29:56,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:29:56,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 05:29:56,838 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:29:56,933 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-28 05:29:56,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-28 05:29:57,347 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:29:57,347 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 33 treesize of output 32 [2024-11-28 05:29:57,399 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 24 treesize of output 12 [2024-11-28 05:29:57,420 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-28 05:29:57,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:29:57,719 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1215 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (let ((.cse0 (bvadd c_~head~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) .cse0) v_ArrVal_1215) c_~head~0.base) .cse0))))) is different from false [2024-11-28 05:29:57,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:29:57,918 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 19 treesize of output 20 [2024-11-28 05:29:57,922 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 33 treesize of output 25 [2024-11-28 05:29:57,926 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 20 treesize of output 18 [2024-11-28 05:29:57,979 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:29:57,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930581709] [2024-11-28 05:29:57,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930581709] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:29:57,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [833554833] [2024-11-28 05:29:57,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:29:57,980 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:29:57,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:29:57,981 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:29:57,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-11-28 05:29:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:29:58,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-28 05:29:58,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:29:58,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 05:29:58,575 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:29:58,622 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-28 05:29:58,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-28 05:29:58,971 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:29:58,971 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 33 treesize of output 32 [2024-11-28 05:29:58,996 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 24 treesize of output 12 [2024-11-28 05:29:58,999 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-28 05:29:58,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:29:59,020 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1279 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_delete_list_~tmp~0#1.base| v_ArrVal_1279) c_~head~0.base) (bvadd c_~head~0.offset (_ bv4 32)))))) is different from false [2024-11-28 05:29:59,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:29:59,307 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 19 treesize of output 20 [2024-11-28 05:29:59,310 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 33 treesize of output 25 [2024-11-28 05:29:59,313 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 20 treesize of output 18 [2024-11-28 05:29:59,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [833554833] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:29:59,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:29:59,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2024-11-28 05:29:59,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057661932] [2024-11-28 05:29:59,365 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:29:59,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 05:29:59,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:29:59,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 05:29:59,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=248, Unknown=20, NotChecked=66, Total=380 [2024-11-28 05:29:59,367 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 05:30:00,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:30:00,840 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2024-11-28 05:30:00,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 05:30:00,840 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 68 [2024-11-28 05:30:00,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:30:00,841 INFO L225 Difference]: With dead ends: 80 [2024-11-28 05:30:00,841 INFO L226 Difference]: Without dead ends: 80 [2024-11-28 05:30:00,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 196 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=170, Invalid=933, Unknown=27, NotChecked=130, Total=1260 [2024-11-28 05:30:00,842 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 61 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:30:00,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 203 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 05:30:00,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-28 05:30:00,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2024-11-28 05:30:00,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.0952380952380953) internal successors, (69), 63 states have internal predecessors, (69), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 05:30:00,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2024-11-28 05:30:00,846 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 68 [2024-11-28 05:30:00,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:30:00,846 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2024-11-28 05:30:00,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 05:30:00,847 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2024-11-28 05:30:00,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 05:30:00,847 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:30:00,848 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:30:00,858 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-28 05:30:01,052 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2024-11-28 05:30:01,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 05:30:01,248 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-28 05:30:01,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:30:01,249 INFO L85 PathProgramCache]: Analyzing trace with hash 91992208, now seen corresponding path program 2 times [2024-11-28 05:30:01,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:30:01,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [961530557] [2024-11-28 05:30:01,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:30:01,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:30:01,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:30:01,251 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:30:01,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6354c9cb-c836-4f48-a0f6-c6602d7d9dbc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-28 05:30:01,736 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:30:01,736 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:30:01,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-28 05:30:01,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:30:01,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 05:30:01,811 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:30:01,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-28 05:30:01,994 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:30:02,134 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 05:30:02,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-28 05:30:02,152 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-28 05:30:02,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-28 05:30:04,268 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2024-11-28 05:30:04,269 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 115 treesize of output 75 [2024-11-28 05:30:04,315 INFO L349 Elim1Store]: treesize reduction 32, result has 38.5 percent of original size [2024-11-28 05:30:04,315 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 61 [2024-11-28 05:30:26,029 WARN L286 SmtUtils]: Spent 20.02s on a formula simplification. DAG size of input: 813 DAG size of output: 745 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-28 05:30:26,030 INFO L349 Elim1Store]: treesize reduction 184, result has 92.9 percent of original size [2024-11-28 05:30:26,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 481 treesize of output 2737 [2024-11-28 05:30:26,339 INFO L224 Elim1Store]: Index analysis took 118 ms [2024-11-28 05:31:00,452 WARN L286 SmtUtils]: Spent 34.10s on a formula simplification. DAG size of input: 723 DAG size of output: 675 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-28 05:31:00,453 INFO L349 Elim1Store]: treesize reduction 96, result has 93.0 percent of original size [2024-11-28 05:31:00,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 29 new quantified variables, introduced 171 case distinctions, treesize of input 2453 treesize of output 2539