./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/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_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:29:14,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:29:14,937 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 03:29:14,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:29:14,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:29:14,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:29:14,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:29:14,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:29:14,990 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:29:14,990 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:29:14,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:29:14,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:29:14,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:29:14,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:29:14,991 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:29:14,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:29:14,993 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:29:14,993 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:29:14,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:29:14,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:29:14,994 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 03:29:14,994 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 03:29:14,994 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 03:29:14,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:29:14,994 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:29:14,994 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:29:14,994 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:29:14,994 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:29:14,994 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:29:14,995 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:29:14,995 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:29:14,995 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:29:14,995 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:29:14,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:29:14,995 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:29:14,995 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:29:14,995 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:29:14,995 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:29:14,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:29:14,996 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:29:14,996 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:29:14,996 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:29:14,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:29:14,996 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:29:14,996 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:29:14,996 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:29:14,996 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:29:14,996 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_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2024-11-28 03:29:15,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:29:15,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:29:15,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:29:15,372 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:29:15,372 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:29:15,373 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2024-11-28 03:29:18,556 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/data/7ad4c4930/1595f36e008d4a0094fba2f4b47db16f/FLAG49c02bcb7 [2024-11-28 03:29:18,975 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:29:18,976 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2024-11-28 03:29:18,998 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/data/7ad4c4930/1595f36e008d4a0094fba2f4b47db16f/FLAG49c02bcb7 [2024-11-28 03:29:19,023 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/data/7ad4c4930/1595f36e008d4a0094fba2f4b47db16f [2024-11-28 03:29:19,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:29:19,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:29:19,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:29:19,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:29:19,035 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:29:19,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:29:19" (1/1) ... [2024-11-28 03:29:19,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@106a41eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19, skipping insertion in model container [2024-11-28 03:29:19,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:29:19" (1/1) ... [2024-11-28 03:29:19,087 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:29:19,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:29:19,538 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:29:19,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:29:19,626 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:29:19,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19 WrapperNode [2024-11-28 03:29:19,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:29:19,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:29:19,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:29:19,628 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:29:19,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19" (1/1) ... [2024-11-28 03:29:19,653 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19" (1/1) ... [2024-11-28 03:29:19,691 INFO L138 Inliner]: procedures = 127, calls = 44, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 147 [2024-11-28 03:29:19,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:29:19,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:29:19,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:29:19,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:29:19,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19" (1/1) ... [2024-11-28 03:29:19,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19" (1/1) ... [2024-11-28 03:29:19,713 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19" (1/1) ... [2024-11-28 03:29:19,754 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 14, 9]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2024-11-28 03:29:19,755 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19" (1/1) ... [2024-11-28 03:29:19,755 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19" (1/1) ... [2024-11-28 03:29:19,772 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19" (1/1) ... [2024-11-28 03:29:19,773 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19" (1/1) ... [2024-11-28 03:29:19,784 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19" (1/1) ... [2024-11-28 03:29:19,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19" (1/1) ... [2024-11-28 03:29:19,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19" (1/1) ... [2024-11-28 03:29:19,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:29:19,798 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:29:19,799 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:29:19,799 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:29:19,800 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19" (1/1) ... [2024-11-28 03:29:19,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:29:19,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:19,846 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:29:19,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:29:19,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 03:29:19,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 03:29:19,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 03:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 03:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 03:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 03:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-28 03:29:19,893 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-28 03:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 03:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 03:29:19,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 03:29:19,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 03:29:19,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 03:29:19,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 03:29:19,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 03:29:19,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 03:29:19,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-28 03:29:19,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-28 03:29:19,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-28 03:29:19,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:29:19,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 03:29:19,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 03:29:19,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:29:19,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:29:20,109 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:29:20,111 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:29:20,732 INFO L? ?]: Removed 138 outVars from TransFormulas that were not future-live. [2024-11-28 03:29:20,732 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:29:20,755 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:29:20,756 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-28 03:29:20,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:29:20 BoogieIcfgContainer [2024-11-28 03:29:20,757 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:29:20,759 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:29:20,760 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:29:20,767 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:29:20,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:29:19" (1/3) ... [2024-11-28 03:29:20,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@577374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:29:20, skipping insertion in model container [2024-11-28 03:29:20,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19" (2/3) ... [2024-11-28 03:29:20,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@577374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:29:20, skipping insertion in model container [2024-11-28 03:29:20,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:29:20" (3/3) ... [2024-11-28 03:29:20,776 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2024-11-28 03:29:20,799 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:29:20,801 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_insert_equal.i that has 2 procedures, 125 locations, 1 initial locations, 4 loop locations, and 52 error locations. [2024-11-28 03:29:20,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:29:20,920 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;@6f4bcf42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:29:20,920 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2024-11-28 03:29:20,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 68 states have (on average 1.9852941176470589) internal successors, (135), 120 states have internal predecessors, (135), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:29:20,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 03:29:20,934 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:20,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 03:29:20,936 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:29:20,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:20,944 INFO L85 PathProgramCache]: Analyzing trace with hash 895644757, now seen corresponding path program 1 times [2024-11-28 03:29:20,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:20,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971921220] [2024-11-28 03:29:20,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:20,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:21,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:21,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971921220] [2024-11-28 03:29:21,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971921220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:21,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:21,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:29:21,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213083133] [2024-11-28 03:29:21,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:21,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:29:21,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:21,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:29:21,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:29:21,321 INFO L87 Difference]: Start difference. First operand has 125 states, 68 states have (on average 1.9852941176470589) internal successors, (135), 120 states have internal predecessors, (135), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:29:21,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:21,503 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2024-11-28 03:29:21,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:29:21,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 03:29:21,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:21,514 INFO L225 Difference]: With dead ends: 122 [2024-11-28 03:29:21,514 INFO L226 Difference]: Without dead ends: 119 [2024-11-28 03:29:21,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:29:21,519 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 2 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:21,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 200 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:29:21,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-28 03:29:21,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-28 03:29:21,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 65 states have (on average 1.876923076923077) internal successors, (122), 114 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:29:21,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2024-11-28 03:29:21,564 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 6 [2024-11-28 03:29:21,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:21,565 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2024-11-28 03:29:21,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:29:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2024-11-28 03:29:21,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 03:29:21,565 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:21,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 03:29:21,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:29:21,566 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:29:21,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:21,567 INFO L85 PathProgramCache]: Analyzing trace with hash 895644758, now seen corresponding path program 1 times [2024-11-28 03:29:21,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:21,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45058106] [2024-11-28 03:29:21,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:21,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:21,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:21,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:21,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45058106] [2024-11-28 03:29:21,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45058106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:21,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:21,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:29:21,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235470001] [2024-11-28 03:29:21,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:21,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:29:21,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:21,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:29:21,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:29:21,733 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:29:21,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:21,883 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2024-11-28 03:29:21,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:29:21,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 03:29:21,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:21,887 INFO L225 Difference]: With dead ends: 117 [2024-11-28 03:29:21,887 INFO L226 Difference]: Without dead ends: 117 [2024-11-28 03:29:21,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:29:21,888 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 2 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:21,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 201 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:29:21,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-28 03:29:21,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-28 03:29:21,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 65 states have (on average 1.8461538461538463) internal successors, (120), 112 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:29:21,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2024-11-28 03:29:21,909 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 6 [2024-11-28 03:29:21,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:21,910 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2024-11-28 03:29:21,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:29:21,910 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2024-11-28 03:29:21,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-28 03:29:21,911 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:21,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:21,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:29:21,911 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:29:21,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:21,912 INFO L85 PathProgramCache]: Analyzing trace with hash -104129930, now seen corresponding path program 1 times [2024-11-28 03:29:21,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:21,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255515607] [2024-11-28 03:29:21,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:21,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:22,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:22,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:22,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255515607] [2024-11-28 03:29:22,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255515607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:22,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:22,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:29:22,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269508899] [2024-11-28 03:29:22,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:22,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:29:22,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:22,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:29:22,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:29:22,017 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:29:22,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:22,037 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2024-11-28 03:29:22,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:29:22,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-28 03:29:22,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:22,039 INFO L225 Difference]: With dead ends: 124 [2024-11-28 03:29:22,039 INFO L226 Difference]: Without dead ends: 124 [2024-11-28 03:29:22,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:29:22,040 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 5 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:22,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 243 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:29:22,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-28 03:29:22,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 118. [2024-11-28 03:29:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 66 states have (on average 1.8333333333333333) internal successors, (121), 113 states have internal predecessors, (121), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:29:22,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2024-11-28 03:29:22,056 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 13 [2024-11-28 03:29:22,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:22,057 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2024-11-28 03:29:22,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:29:22,057 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2024-11-28 03:29:22,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-28 03:29:22,057 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:22,058 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:22,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:29:22,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:29:22,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:22,059 INFO L85 PathProgramCache]: Analyzing trace with hash -622859559, now seen corresponding path program 1 times [2024-11-28 03:29:22,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:22,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140987622] [2024-11-28 03:29:22,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:22,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:22,365 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 03:29:22,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:22,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140987622] [2024-11-28 03:29:22,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140987622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:22,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:22,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:29:22,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091177061] [2024-11-28 03:29:22,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:22,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:29:22,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:22,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:29:22,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:29:22,368 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:29:22,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:22,679 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2024-11-28 03:29:22,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:29:22,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-28 03:29:22,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:22,680 INFO L225 Difference]: With dead ends: 117 [2024-11-28 03:29:22,681 INFO L226 Difference]: Without dead ends: 117 [2024-11-28 03:29:22,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 03:29:22,682 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 2 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:22,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 382 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:29:22,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-28 03:29:22,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-28 03:29:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 66 states have (on average 1.8181818181818181) internal successors, (120), 112 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:29:22,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2024-11-28 03:29:22,696 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 22 [2024-11-28 03:29:22,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:22,699 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2024-11-28 03:29:22,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:29:22,700 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2024-11-28 03:29:22,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-28 03:29:22,701 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:22,701 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:22,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:29:22,701 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:29:22,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:22,702 INFO L85 PathProgramCache]: Analyzing trace with hash -622859558, now seen corresponding path program 1 times [2024-11-28 03:29:22,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:22,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143711555] [2024-11-28 03:29:22,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:22,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:23,072 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:29:23,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:23,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143711555] [2024-11-28 03:29:23,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143711555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:23,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:23,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:29:23,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959064562] [2024-11-28 03:29:23,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:23,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:29:23,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:23,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:29:23,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:29:23,074 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:29:23,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:23,313 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2024-11-28 03:29:23,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:29:23,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-28 03:29:23,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:23,315 INFO L225 Difference]: With dead ends: 116 [2024-11-28 03:29:23,315 INFO L226 Difference]: Without dead ends: 116 [2024-11-28 03:29:23,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 03:29:23,318 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:23,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 406 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:29:23,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-28 03:29:23,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-28 03:29:23,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 66 states have (on average 1.803030303030303) internal successors, (119), 111 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:29:23,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2024-11-28 03:29:23,333 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 22 [2024-11-28 03:29:23,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:23,334 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2024-11-28 03:29:23,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:29:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2024-11-28 03:29:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-28 03:29:23,338 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:23,338 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:23,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:29:23,338 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:29:23,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:23,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1350414585, now seen corresponding path program 1 times [2024-11-28 03:29:23,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:23,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075293899] [2024-11-28 03:29:23,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:23,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:23,766 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:29:23,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:23,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075293899] [2024-11-28 03:29:23,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075293899] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:29:23,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123305206] [2024-11-28 03:29:23,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:23,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:23,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:23,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:29:23,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:29:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:23,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-28 03:29:23,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:29:23,996 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 03:29:24,134 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 03:29:24,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-28 03:29:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:29:24,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:29:24,750 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:29:24,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123305206] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:29:24,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:29:24,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2024-11-28 03:29:24,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452115890] [2024-11-28 03:29:24,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:29:24,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 03:29:24,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:24,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 03:29:24,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-11-28 03:29:24,753 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 03:29:25,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:25,367 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2024-11-28 03:29:25,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:29:25,367 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2024-11-28 03:29:25,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:25,368 INFO L225 Difference]: With dead ends: 115 [2024-11-28 03:29:25,368 INFO L226 Difference]: Without dead ends: 115 [2024-11-28 03:29:25,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-11-28 03:29:25,369 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 1 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:25,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 743 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 03:29:25,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-28 03:29:25,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-28 03:29:25,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 66 states have (on average 1.7878787878787878) internal successors, (118), 110 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:29:25,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2024-11-28 03:29:25,378 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 25 [2024-11-28 03:29:25,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:25,378 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2024-11-28 03:29:25,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 03:29:25,378 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2024-11-28 03:29:25,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-28 03:29:25,379 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:25,379 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:25,389 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 03:29:25,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:25,584 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:29:25,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:25,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1350414584, now seen corresponding path program 1 times [2024-11-28 03:29:25,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:25,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600791139] [2024-11-28 03:29:25,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:25,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:26,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:29:26,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:26,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600791139] [2024-11-28 03:29:26,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600791139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:29:26,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069823034] [2024-11-28 03:29:26,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:26,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:26,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:26,043 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:29:26,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:29:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:26,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-28 03:29:26,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:29:26,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 03:29:26,211 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 03:29:26,594 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:29:26,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:29:26,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:29:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:26,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:29:26,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069823034] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:29:26,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:29:26,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2024-11-28 03:29:26,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925484928] [2024-11-28 03:29:26,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:29:26,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 03:29:26,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:26,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 03:29:26,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-11-28 03:29:26,966 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 13 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 03:29:27,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:27,829 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2024-11-28 03:29:27,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:29:27,830 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 13 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2024-11-28 03:29:27,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:27,831 INFO L225 Difference]: With dead ends: 116 [2024-11-28 03:29:27,831 INFO L226 Difference]: Without dead ends: 116 [2024-11-28 03:29:27,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2024-11-28 03:29:27,833 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:27,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 923 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 03:29:27,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-28 03:29:27,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2024-11-28 03:29:27,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 66 states have (on average 1.7727272727272727) internal successors, (117), 109 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:29:27,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2024-11-28 03:29:27,845 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 25 [2024-11-28 03:29:27,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:27,846 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2024-11-28 03:29:27,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 13 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 03:29:27,846 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2024-11-28 03:29:27,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 03:29:27,847 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:27,847 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-28 03:29:27,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 03:29:28,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:28,048 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:29:28,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:28,052 INFO L85 PathProgramCache]: Analyzing trace with hash 2111232865, now seen corresponding path program 1 times [2024-11-28 03:29:28,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:28,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419956168] [2024-11-28 03:29:28,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:28,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:28,894 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 03:29:28,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:28,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419956168] [2024-11-28 03:29:28,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419956168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:29:28,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545047987] [2024-11-28 03:29:28,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:28,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:28,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:28,901 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:29:28,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:29:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:29,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-28 03:29:29,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:29:29,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:29:29,123 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-28 03:29:29,183 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 03:29:29,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 03:29:29,255 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 03:29:29,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-28 03:29:29,349 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-28 03:29:29,384 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 03:29:29,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-28 03:29:29,407 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2024-11-28 03:29:29,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:29:30,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545047987] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:29:30,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:29:30,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2024-11-28 03:29:30,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253567759] [2024-11-28 03:29:30,013 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:29:30,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 03:29:30,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:30,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 03:29:30,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=379, Unknown=2, NotChecked=82, Total=552 [2024-11-28 03:29:30,015 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 03:29:30,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:30,700 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2024-11-28 03:29:30,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:29:30,701 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2024-11-28 03:29:30,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:30,702 INFO L225 Difference]: With dead ends: 125 [2024-11-28 03:29:30,704 INFO L226 Difference]: Without dead ends: 125 [2024-11-28 03:29:30,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=486, Unknown=2, NotChecked=94, Total=702 [2024-11-28 03:29:30,706 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 213 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 256 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:30,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 389 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 452 Invalid, 0 Unknown, 256 Unchecked, 0.5s Time] [2024-11-28 03:29:30,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-28 03:29:30,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 106. [2024-11-28 03:29:30,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 66 states have (on average 1.6515151515151516) internal successors, (109), 101 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:29:30,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2024-11-28 03:29:30,716 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 37 [2024-11-28 03:29:30,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:30,716 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2024-11-28 03:29:30,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 03:29:30,717 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2024-11-28 03:29:30,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 03:29:30,717 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:30,718 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-28 03:29:30,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 03:29:30,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:30,922 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:29:30,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:30,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2111232866, now seen corresponding path program 1 times [2024-11-28 03:29:30,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:30,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730934529] [2024-11-28 03:29:30,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:30,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:31,852 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:29:31,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:31,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730934529] [2024-11-28 03:29:31,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730934529] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:29:31,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814132940] [2024-11-28 03:29:31,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:31,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:31,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:31,856 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:29:31,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:29:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:32,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-28 03:29:32,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:29:32,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 03:29:32,090 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 03:29:32,104 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-28 03:29:32,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:29:32,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:29:32,193 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 03:29:32,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:29:32,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:29:32,346 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 03:29:32,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:29:32,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:29:32,438 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 03:29:32,439 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:29:32,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814132940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:32,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:29:32,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 14 [2024-11-28 03:29:32,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491431568] [2024-11-28 03:29:32,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:32,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:29:32,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:32,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:29:32,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=146, Unknown=1, NotChecked=24, Total=210 [2024-11-28 03:29:32,443 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 03:29:32,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:32,641 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2024-11-28 03:29:32,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:29:32,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-11-28 03:29:32,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:32,643 INFO L225 Difference]: With dead ends: 102 [2024-11-28 03:29:32,643 INFO L226 Difference]: Without dead ends: 102 [2024-11-28 03:29:32,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=169, Unknown=1, NotChecked=26, Total=240 [2024-11-28 03:29:32,644 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 34 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:32,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 254 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 138 Unchecked, 0.2s Time] [2024-11-28 03:29:32,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-28 03:29:32,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2024-11-28 03:29:32,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 66 states have (on average 1.5757575757575757) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:29:32,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2024-11-28 03:29:32,649 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 37 [2024-11-28 03:29:32,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:32,650 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2024-11-28 03:29:32,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 03:29:32,650 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2024-11-28 03:29:32,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 03:29:32,651 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:32,651 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-28 03:29:32,661 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 03:29:32,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:32,852 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:29:32,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:32,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1236649048, now seen corresponding path program 1 times [2024-11-28 03:29:32,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:32,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338183058] [2024-11-28 03:29:32,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:32,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:33,427 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:29:33,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:33,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338183058] [2024-11-28 03:29:33,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338183058] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:29:33,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782489779] [2024-11-28 03:29:33,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:33,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:33,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:33,430 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:29:33,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 03:29:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:33,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-28 03:29:33,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:29:34,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:29:34,087 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-28 03:29:34,155 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-28 03:29:34,156 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 24 [2024-11-28 03:29:34,170 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 17 treesize of output 9 [2024-11-28 03:29:34,180 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-11-28 03:29:34,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:29:34,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782489779] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:29:34,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:29:34,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-11-28 03:29:34,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670719860] [2024-11-28 03:29:34,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:29:34,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-28 03:29:34,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:34,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-28 03:29:34,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=537, Unknown=1, NotChecked=46, Total=650 [2024-11-28 03:29:34,276 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-28 03:29:35,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:35,287 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2024-11-28 03:29:35,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 03:29:35,288 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2024-11-28 03:29:35,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:35,289 INFO L225 Difference]: With dead ends: 132 [2024-11-28 03:29:35,289 INFO L226 Difference]: Without dead ends: 132 [2024-11-28 03:29:35,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=999, Unknown=1, NotChecked=64, Total=1190 [2024-11-28 03:29:35,290 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 179 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:35,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1098 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1003 Invalid, 0 Unknown, 140 Unchecked, 0.8s Time] [2024-11-28 03:29:35,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-28 03:29:35,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 104. [2024-11-28 03:29:35,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.5797101449275361) internal successors, (109), 99 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:29:35,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2024-11-28 03:29:35,296 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 41 [2024-11-28 03:29:35,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:35,296 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2024-11-28 03:29:35,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-28 03:29:35,297 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2024-11-28 03:29:35,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 03:29:35,297 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:35,297 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-28 03:29:35,309 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 03:29:35,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-28 03:29:35,498 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:29:35,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:35,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1236649047, now seen corresponding path program 1 times [2024-11-28 03:29:35,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:35,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924539353] [2024-11-28 03:29:35,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:35,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:36,199 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:29:36,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:36,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924539353] [2024-11-28 03:29:36,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924539353] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:29:36,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691205087] [2024-11-28 03:29:36,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:36,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:36,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:36,202 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:29:36,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 03:29:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:36,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-28 03:29:36,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:29:36,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 03:29:36,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:29:36,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:29:36,986 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2024-11-28 03:29:37,050 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 03:29:37,051 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 03:29:37,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-28 03:29:37,144 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 17 treesize of output 9 [2024-11-28 03:29:37,229 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-11-28 03:29:37,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:29:37,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691205087] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:29:37,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:29:37,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2024-11-28 03:29:37,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790226747] [2024-11-28 03:29:37,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:29:37,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-28 03:29:37,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:37,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-28 03:29:37,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=849, Unknown=1, NotChecked=58, Total=992 [2024-11-28 03:29:37,549 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand has 28 states, 26 states have (on average 2.423076923076923) internal successors, (63), 24 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-28 03:29:39,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:39,209 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2024-11-28 03:29:39,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 03:29:39,210 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.423076923076923) internal successors, (63), 24 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2024-11-28 03:29:39,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:39,211 INFO L225 Difference]: With dead ends: 139 [2024-11-28 03:29:39,211 INFO L226 Difference]: Without dead ends: 139 [2024-11-28 03:29:39,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=191, Invalid=1974, Unknown=1, NotChecked=90, Total=2256 [2024-11-28 03:29:39,214 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 262 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:39,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1087 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1080 Invalid, 0 Unknown, 145 Unchecked, 1.0s Time] [2024-11-28 03:29:39,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-28 03:29:39,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 111. [2024-11-28 03:29:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 75 states have (on average 1.52) internal successors, (114), 105 states have internal predecessors, (114), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:29:39,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2024-11-28 03:29:39,220 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 41 [2024-11-28 03:29:39,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:39,221 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2024-11-28 03:29:39,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.423076923076923) internal successors, (63), 24 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-28 03:29:39,221 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2024-11-28 03:29:39,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 03:29:39,222 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:39,222 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-28 03:29:39,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 03:29:39,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-28 03:29:39,424 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:29:39,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:39,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1236646806, now seen corresponding path program 1 times [2024-11-28 03:29:39,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:39,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439528249] [2024-11-28 03:29:39,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:39,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 03:29:39,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:39,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439528249] [2024-11-28 03:29:39,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439528249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:39,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:39,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:29:39,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689219168] [2024-11-28 03:29:39,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:39,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:29:39,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:39,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:29:39,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:29:39,501 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-28 03:29:39,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:39,518 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2024-11-28 03:29:39,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:29:39,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2024-11-28 03:29:39,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:39,520 INFO L225 Difference]: With dead ends: 112 [2024-11-28 03:29:39,520 INFO L226 Difference]: Without dead ends: 112 [2024-11-28 03:29:39,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:29:39,521 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:39,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 206 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:29:39,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-28 03:29:39,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-28 03:29:39,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 76 states have (on average 1.513157894736842) internal successors, (115), 106 states have internal predecessors, (115), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:29:39,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2024-11-28 03:29:39,530 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 41 [2024-11-28 03:29:39,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:39,531 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2024-11-28 03:29:39,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-28 03:29:39,531 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2024-11-28 03:29:39,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-28 03:29:39,532 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:39,532 INFO L218 NwaCegarLoop]: trace histogram [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 03:29:39,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:29:39,532 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:29:39,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:39,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1288608171, now seen corresponding path program 1 times [2024-11-28 03:29:39,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:39,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168847146] [2024-11-28 03:29:39,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:39,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:39,668 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-28 03:29:39,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:39,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168847146] [2024-11-28 03:29:39,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168847146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:39,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:39,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:29:39,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088212459] [2024-11-28 03:29:39,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:39,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:29:39,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:39,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:29:39,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:29:39,671 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-28 03:29:39,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:39,856 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2024-11-28 03:29:39,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:29:39,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-11-28 03:29:39,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:39,857 INFO L225 Difference]: With dead ends: 109 [2024-11-28 03:29:39,858 INFO L226 Difference]: Without dead ends: 109 [2024-11-28 03:29:39,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 03:29:39,858 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 21 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:39,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 301 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:29:39,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-28 03:29:39,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-28 03:29:39,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 103 states have internal predecessors, (112), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:29:39,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2024-11-28 03:29:39,865 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 43 [2024-11-28 03:29:39,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:39,865 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2024-11-28 03:29:39,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-28 03:29:39,866 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2024-11-28 03:29:39,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-28 03:29:39,868 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:39,868 INFO L218 NwaCegarLoop]: trace histogram [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 03:29:39,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 03:29:39,868 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:29:39,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:39,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1288608172, now seen corresponding path program 1 times [2024-11-28 03:29:39,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:39,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017969909] [2024-11-28 03:29:39,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:39,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:40,110 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-28 03:29:40,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:40,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017969909] [2024-11-28 03:29:40,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017969909] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:29:40,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782622527] [2024-11-28 03:29:40,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:40,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:40,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:40,114 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:29:40,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 03:29:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:40,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 03:29:40,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:29:40,421 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 03:29:40,421 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:29:40,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782622527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:40,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:29:40,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2024-11-28 03:29:40,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890370468] [2024-11-28 03:29:40,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:40,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:29:40,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:40,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:29:40,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:29:40,423 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 03:29:40,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:40,459 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2024-11-28 03:29:40,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:29:40,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-11-28 03:29:40,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:40,460 INFO L225 Difference]: With dead ends: 112 [2024-11-28 03:29:40,463 INFO L226 Difference]: Without dead ends: 112 [2024-11-28 03:29:40,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:29:40,465 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 59 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:40,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 234 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:29:40,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-28 03:29:40,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2024-11-28 03:29:40,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 102 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:29:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2024-11-28 03:29:40,470 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 43 [2024-11-28 03:29:40,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:40,471 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2024-11-28 03:29:40,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 03:29:40,471 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2024-11-28 03:29:40,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-28 03:29:40,472 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:40,472 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:40,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 03:29:40,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-28 03:29:40,672 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:29:40,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:40,673 INFO L85 PathProgramCache]: Analyzing trace with hash -906199647, now seen corresponding path program 1 times [2024-11-28 03:29:40,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:40,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347577663] [2024-11-28 03:29:40,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:40,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 03:29:40,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:40,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347577663] [2024-11-28 03:29:40,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347577663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:40,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:40,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:29:40,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918922656] [2024-11-28 03:29:40,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:40,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:29:40,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:40,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:29:40,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:29:40,835 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 03:29:40,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:40,868 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2024-11-28 03:29:40,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:29:40,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2024-11-28 03:29:40,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:40,869 INFO L225 Difference]: With dead ends: 108 [2024-11-28 03:29:40,869 INFO L226 Difference]: Without dead ends: 108 [2024-11-28 03:29:40,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:29:40,870 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 51 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:40,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 236 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:29:40,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-28 03:29:40,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2024-11-28 03:29:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 98 states have internal predecessors, (105), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:29:40,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2024-11-28 03:29:40,875 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 45 [2024-11-28 03:29:40,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:40,875 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2024-11-28 03:29:40,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 03:29:40,875 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2024-11-28 03:29:40,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-28 03:29:40,876 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:40,876 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:40,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 03:29:40,877 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:29:40,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:40,877 INFO L85 PathProgramCache]: Analyzing trace with hash -906197405, now seen corresponding path program 1 times [2024-11-28 03:29:40,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:40,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344712506] [2024-11-28 03:29:40,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:40,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 03:29:40,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:40,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344712506] [2024-11-28 03:29:40,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344712506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:40,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:40,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:29:40,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766685801] [2024-11-28 03:29:40,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:40,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:29:40,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:40,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:29:40,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:29:40,964 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-28 03:29:41,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:41,070 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2024-11-28 03:29:41,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:29:41,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2024-11-28 03:29:41,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:41,072 INFO L225 Difference]: With dead ends: 103 [2024-11-28 03:29:41,072 INFO L226 Difference]: Without dead ends: 103 [2024-11-28 03:29:41,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:29:41,073 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:41,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 214 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:29:41,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-28 03:29:41,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-28 03:29:41,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 97 states have internal predecessors, (104), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:29:41,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2024-11-28 03:29:41,077 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 45 [2024-11-28 03:29:41,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:41,078 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2024-11-28 03:29:41,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-28 03:29:41,078 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2024-11-28 03:29:41,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-28 03:29:41,079 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:41,079 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:41,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 03:29:41,079 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:29:41,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:41,079 INFO L85 PathProgramCache]: Analyzing trace with hash -906197404, now seen corresponding path program 1 times [2024-11-28 03:29:41,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:41,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055846605] [2024-11-28 03:29:41,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:41,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:41,213 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 03:29:41,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:41,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055846605] [2024-11-28 03:29:41,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055846605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:41,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:41,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:29:41,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089095674] [2024-11-28 03:29:41,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:41,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:29:41,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:41,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:29:41,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:29:41,215 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-28 03:29:41,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:41,327 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2024-11-28 03:29:41,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:29:41,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2024-11-28 03:29:41,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:41,328 INFO L225 Difference]: With dead ends: 102 [2024-11-28 03:29:41,329 INFO L226 Difference]: Without dead ends: 102 [2024-11-28 03:29:41,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:29:41,329 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:41,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 214 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:29:41,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-28 03:29:41,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-28 03:29:41,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 96 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:29:41,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2024-11-28 03:29:41,334 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 45 [2024-11-28 03:29:41,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:41,334 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2024-11-28 03:29:41,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-28 03:29:41,335 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2024-11-28 03:29:41,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-28 03:29:41,335 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:41,335 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:41,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 03:29:41,335 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:29:41,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:41,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1972651546, now seen corresponding path program 1 times [2024-11-28 03:29:41,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:41,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33085381] [2024-11-28 03:29:41,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:41,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:41,579 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 03:29:41,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:41,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33085381] [2024-11-28 03:29:41,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33085381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:41,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:41,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:29:41,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111508203] [2024-11-28 03:29:41,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:41,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:29:41,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:41,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:29:41,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:29:41,581 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-28 03:29:41,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:41,776 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2024-11-28 03:29:41,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:29:41,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-28 03:29:41,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:41,777 INFO L225 Difference]: With dead ends: 99 [2024-11-28 03:29:41,778 INFO L226 Difference]: Without dead ends: 99 [2024-11-28 03:29:41,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 03:29:41,778 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 13 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:41,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 305 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:29:41,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-28 03:29:41,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-28 03:29:41,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 73 states have (on average 1.36986301369863) internal successors, (100), 93 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:29:41,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2024-11-28 03:29:41,783 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 46 [2024-11-28 03:29:41,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:41,783 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2024-11-28 03:29:41,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-28 03:29:41,784 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2024-11-28 03:29:41,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-28 03:29:41,784 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:41,784 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:41,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 03:29:41,785 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:29:41,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:41,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1637559227, now seen corresponding path program 1 times [2024-11-28 03:29:41,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:41,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075461012] [2024-11-28 03:29:41,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:41,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:42,105 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-28 03:29:42,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:42,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075461012] [2024-11-28 03:29:42,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075461012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:42,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:42,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:29:42,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855666734] [2024-11-28 03:29:42,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:42,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:29:42,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:42,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:29:42,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:29:42,110 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 6 states, 4 states have (on average 7.5) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 03:29:42,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:42,198 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2024-11-28 03:29:42,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:29:42,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 7.5) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2024-11-28 03:29:42,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:42,200 INFO L225 Difference]: With dead ends: 97 [2024-11-28 03:29:42,200 INFO L226 Difference]: Without dead ends: 97 [2024-11-28 03:29:42,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:29:42,201 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 113 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:42,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 138 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:29:42,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-28 03:29:42,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2024-11-28 03:29:42,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 90 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:29:42,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2024-11-28 03:29:42,206 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 48 [2024-11-28 03:29:42,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:42,206 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2024-11-28 03:29:42,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 7.5) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 03:29:42,207 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2024-11-28 03:29:42,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-28 03:29:42,207 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:42,208 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:42,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 03:29:42,208 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:29:42,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:42,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1736387998, now seen corresponding path program 1 times [2024-11-28 03:29:42,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:42,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459912414] [2024-11-28 03:29:42,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:42,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:42,450 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 03:29:42,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:42,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459912414] [2024-11-28 03:29:42,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459912414] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:29:42,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060967451] [2024-11-28 03:29:42,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:42,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:42,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:42,454 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:29:42,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 03:29:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:42,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-28 03:29:42,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:29:42,703 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 03:29:42,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:29:42,905 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 03:29:42,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-28 03:29:43,024 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 17 treesize of output 9 [2024-11-28 03:29:43,029 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:29:43,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:29:43,402 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 18 treesize of output 10 [2024-11-28 03:29:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:29:43,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060967451] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:29:43,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:29:43,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15, 15] total 23 [2024-11-28 03:29:43,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310418050] [2024-11-28 03:29:43,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:29:43,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 03:29:43,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:43,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 03:29:43,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2024-11-28 03:29:43,450 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 19 states have internal predecessors, (79), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 03:29:44,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:44,402 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2024-11-28 03:29:44,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 03:29:44,402 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 19 states have internal predecessors, (79), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2024-11-28 03:29:44,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:44,403 INFO L225 Difference]: With dead ends: 125 [2024-11-28 03:29:44,403 INFO L226 Difference]: Without dead ends: 125 [2024-11-28 03:29:44,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=930, Unknown=0, NotChecked=0, Total=1056 [2024-11-28 03:29:44,404 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 200 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:44,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 911 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 03:29:44,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-28 03:29:44,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 99. [2024-11-28 03:29:44,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 93 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:29:44,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2024-11-28 03:29:44,409 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 50 [2024-11-28 03:29:44,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:44,409 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2024-11-28 03:29:44,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 19 states have internal predecessors, (79), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 03:29:44,410 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2024-11-28 03:29:44,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-28 03:29:44,410 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:44,410 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:44,422 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 03:29:44,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:44,615 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:29:44,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:44,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1736387999, now seen corresponding path program 1 times [2024-11-28 03:29:44,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:44,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569511998] [2024-11-28 03:29:44,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:44,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:45,704 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:29:45,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:45,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569511998] [2024-11-28 03:29:45,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569511998] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:29:45,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287899882] [2024-11-28 03:29:45,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:45,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:45,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:45,708 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:29:45,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 03:29:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:45,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-28 03:29:45,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:29:45,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 03:29:45,996 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 03:29:46,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:29:46,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:29:46,638 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 03:29:46,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-28 03:29:46,661 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 03:29:46,662 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 03:29:46,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 17 treesize of output 9 [2024-11-28 03:29:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:29:46,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:29:47,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287899882] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:29:47,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:29:47,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 28 [2024-11-28 03:29:47,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042303532] [2024-11-28 03:29:47,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:29:47,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-28 03:29:47,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:47,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-28 03:29:47,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=973, Unknown=0, NotChecked=0, Total=1056 [2024-11-28 03:29:47,221 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 29 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 24 states have internal predecessors, (73), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-28 03:29:48,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:48,924 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2024-11-28 03:29:48,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-28 03:29:48,925 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 24 states have internal predecessors, (73), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2024-11-28 03:29:48,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:48,926 INFO L225 Difference]: With dead ends: 123 [2024-11-28 03:29:48,926 INFO L226 Difference]: Without dead ends: 123 [2024-11-28 03:29:48,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=195, Invalid=2355, Unknown=0, NotChecked=0, Total=2550 [2024-11-28 03:29:48,928 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 77 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 1388 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:48,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1092 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1388 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 03:29:48,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-28 03:29:48,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 101. [2024-11-28 03:29:48,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 95 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:29:48,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2024-11-28 03:29:48,940 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 50 [2024-11-28 03:29:48,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:48,941 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2024-11-28 03:29:48,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 24 states have internal predecessors, (73), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-28 03:29:48,941 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2024-11-28 03:29:48,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-28 03:29:48,942 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:48,942 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:48,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-28 03:29:49,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:49,142 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:29:49,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:49,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2119545770, now seen corresponding path program 1 times [2024-11-28 03:29:49,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:49,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496940862] [2024-11-28 03:29:49,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:49,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:49,351 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 03:29:49,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:49,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496940862] [2024-11-28 03:29:49,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496940862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:29:49,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663787665] [2024-11-28 03:29:49,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:49,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:49,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:49,354 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:29:49,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 03:29:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:49,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-28 03:29:49,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:29:49,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:29:49,638 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2024-11-28 03:29:49,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:29:49,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:29:49,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:29:49,878 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:29:49,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:29:49,908 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 03:29:49,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:29:50,452 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 03:29:50,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663787665] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:29:50,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:29:50,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2024-11-28 03:29:50,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111550332] [2024-11-28 03:29:50,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:29:50,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 03:29:50,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:50,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 03:29:50,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=280, Unknown=1, NotChecked=34, Total=380 [2024-11-28 03:29:50,454 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 20 states, 20 states have (on average 4.35) internal successors, (87), 19 states have internal predecessors, (87), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-28 03:29:50,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:50,822 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2024-11-28 03:29:50,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:29:50,823 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.35) internal successors, (87), 19 states have internal predecessors, (87), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 51 [2024-11-28 03:29:50,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:50,824 INFO L225 Difference]: With dead ends: 86 [2024-11-28 03:29:50,824 INFO L226 Difference]: Without dead ends: 86 [2024-11-28 03:29:50,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 82 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=472, Unknown=9, NotChecked=46, Total=650 [2024-11-28 03:29:50,826 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 172 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:50,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 492 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 374 Invalid, 0 Unknown, 75 Unchecked, 0.2s Time] [2024-11-28 03:29:50,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-28 03:29:50,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-28 03:29:50,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 66 states have (on average 1.303030303030303) internal successors, (86), 80 states have internal predecessors, (86), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:29:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2024-11-28 03:29:50,831 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 51 [2024-11-28 03:29:50,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:50,831 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2024-11-28 03:29:50,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.35) internal successors, (87), 19 states have internal predecessors, (87), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-28 03:29:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2024-11-28 03:29:50,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-28 03:29:50,833 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:50,833 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:50,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-28 03:29:51,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:51,037 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:29:51,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:51,037 INFO L85 PathProgramCache]: Analyzing trace with hash 318237186, now seen corresponding path program 1 times [2024-11-28 03:29:51,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:51,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545642406] [2024-11-28 03:29:51,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:51,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:53,268 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:53,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:53,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545642406] [2024-11-28 03:29:53,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545642406] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:29:53,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110782547] [2024-11-28 03:29:53,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:53,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:53,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:53,271 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:29:53,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 03:29:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:53,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-11-28 03:29:53,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:29:53,852 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 03:29:54,128 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 03:29:54,265 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:29:54,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:29:54,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-28 03:29:54,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-28 03:29:54,905 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 17 treesize of output 3 [2024-11-28 03:29:54,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:29:55,011 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 03:29:55,011 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 03:29:55,029 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (let ((.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 4))) (or (= (select (select |c_#memory_int#1| .cse0) .cse1) 1) (exists ((|v_old(#memory_int#1)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int#1)_AFTER_CALL_31| |c_#memory_int#1|))) (and (= (select (select |v_old(#memory_int#1)_AFTER_CALL_31| .cse0) .cse1) 1) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_31| .cse2 (select |c_#memory_int#1| .cse2))) (= .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0))) is different from false [2024-11-28 03:29:55,033 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (let ((.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 4))) (or (= (select (select |c_#memory_int#1| .cse0) .cse1) 1) (exists ((|v_old(#memory_int#1)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int#1)_AFTER_CALL_31| |c_#memory_int#1|))) (and (= (select (select |v_old(#memory_int#1)_AFTER_CALL_31| .cse0) .cse1) 1) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_31| .cse2 (select |c_#memory_int#1| .cse2))) (= .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0))) is different from true [2024-11-28 03:29:55,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:29:55,599 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 45 treesize of output 21 [2024-11-28 03:29:55,694 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 26 treesize of output 21 [2024-11-28 03:29:55,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-28 03:29:55,784 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 03:29:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:29:55,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:29:57,123 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_27| Int) (v_ArrVal_1801 Int)) (or (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_27|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_27| v_ArrVal_1801))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1802) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2024-11-28 03:29:57,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110782547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:29:57,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:29:57,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32] total 58 [2024-11-28 03:29:57,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238966033] [2024-11-28 03:29:57,337 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:29:57,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-28 03:29:57,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:57,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-28 03:29:57,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=3999, Unknown=77, NotChecked=258, Total=4556 [2024-11-28 03:29:57,340 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 58 states, 54 states have (on average 1.5925925925925926) internal successors, (86), 50 states have internal predecessors, (86), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 03:30:01,526 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (+ (select .cse1 0) 4))) (let ((.cse0 (= (select (select |c_#memory_int#1| .cse2) .cse3) 1)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (and .cse0 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or .cse0 (exists ((|v_old(#memory_int#1)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int#1)_AFTER_CALL_31| |c_#memory_int#1|))) (and (= (select (select |v_old(#memory_int#1)_AFTER_CALL_31| .cse2) .cse3) 1) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_31| .cse4 (select |c_#memory_int#1| .cse4))) (= .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (not (= .cse5 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse5) 4)))))) is different from false [2024-11-28 03:30:01,530 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (+ (select .cse1 0) 4))) (let ((.cse0 (= (select (select |c_#memory_int#1| .cse2) .cse3) 1)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (and .cse0 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or .cse0 (exists ((|v_old(#memory_int#1)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int#1)_AFTER_CALL_31| |c_#memory_int#1|))) (and (= (select (select |v_old(#memory_int#1)_AFTER_CALL_31| .cse2) .cse3) 1) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_31| .cse4 (select |c_#memory_int#1| .cse4))) (= .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (not (= .cse5 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse5) 4)))))) is different from true [2024-11-28 03:30:02,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:30:02,957 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2024-11-28 03:30:02,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-28 03:30:02,958 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 54 states have (on average 1.5925925925925926) internal successors, (86), 50 states have internal predecessors, (86), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2024-11-28 03:30:02,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:30:02,960 INFO L225 Difference]: With dead ends: 128 [2024-11-28 03:30:02,961 INFO L226 Difference]: Without dead ends: 128 [2024-11-28 03:30:02,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1388 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=445, Invalid=6969, Unknown=80, NotChecked=516, Total=8010 [2024-11-28 03:30:02,963 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 101 mSDsluCounter, 1690 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:30:02,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1743 Invalid, 1749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1540 Invalid, 0 Unknown, 183 Unchecked, 1.1s Time] [2024-11-28 03:30:02,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-28 03:30:02,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 111. [2024-11-28 03:30:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 103 states have internal predecessors, (110), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:30:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2024-11-28 03:30:02,970 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 54 [2024-11-28 03:30:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:30:02,970 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2024-11-28 03:30:02,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 54 states have (on average 1.5925925925925926) internal successors, (86), 50 states have internal predecessors, (86), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 03:30:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2024-11-28 03:30:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-28 03:30:02,971 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:30:02,972 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:30:02,985 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-28 03:30:03,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-28 03:30:03,172 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:30:03,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:03,173 INFO L85 PathProgramCache]: Analyzing trace with hash 878430543, now seen corresponding path program 1 times [2024-11-28 03:30:03,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:30:03,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418107513] [2024-11-28 03:30:03,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:03,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:30:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:04,327 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 03:30:04,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:30:04,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418107513] [2024-11-28 03:30:04,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418107513] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:30:04,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954242692] [2024-11-28 03:30:04,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:04,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:04,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:30:04,331 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:30:04,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 03:30:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:04,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-28 03:30:04,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:30:04,642 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 03:30:04,796 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:30:04,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:30:04,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:30:05,025 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:30:05,025 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 34 treesize of output 33 [2024-11-28 03:30:05,178 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 38 treesize of output 14 [2024-11-28 03:30:05,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 03:30:05,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:30:05,443 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 46 treesize of output 35 [2024-11-28 03:30:05,486 INFO L349 Elim1Store]: treesize reduction 84, result has 37.8 percent of original size [2024-11-28 03:30:05,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 65 [2024-11-28 03:30:05,817 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2024-11-28 03:30:05,817 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 65 treesize of output 56 [2024-11-28 03:30:06,079 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-28 03:30:06,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 88 [2024-11-28 03:30:06,128 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 03:30:06,417 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 152 treesize of output 104 [2024-11-28 03:30:06,423 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 103 treesize of output 75 [2024-11-28 03:30:06,825 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 79 treesize of output 51 [2024-11-28 03:30:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:30:07,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:30:07,303 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1950 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1950) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2024-11-28 03:30:11,333 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1950 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1950) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2024-11-28 03:30:11,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954242692] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:30:11,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:30:11,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27] total 45 [2024-11-28 03:30:11,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072833642] [2024-11-28 03:30:11,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:30:11,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-28 03:30:11,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:30:11,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-28 03:30:11,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2101, Unknown=19, NotChecked=186, Total=2450 [2024-11-28 03:30:11,690 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand has 46 states, 43 states have (on average 2.116279069767442) internal successors, (91), 39 states have internal predecessors, (91), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-28 03:30:18,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:30:18,282 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2024-11-28 03:30:18,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-28 03:30:18,282 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 2.116279069767442) internal successors, (91), 39 states have internal predecessors, (91), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2024-11-28 03:30:18,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:30:18,283 INFO L225 Difference]: With dead ends: 150 [2024-11-28 03:30:18,283 INFO L226 Difference]: Without dead ends: 150 [2024-11-28 03:30:18,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1289 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=425, Invalid=5724, Unknown=21, NotChecked=310, Total=6480 [2024-11-28 03:30:18,286 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 161 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:30:18,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1204 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 03:30:18,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-28 03:30:18,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 115. [2024-11-28 03:30:18,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.2473118279569892) internal successors, (116), 107 states have internal predecessors, (116), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:30:18,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2024-11-28 03:30:18,292 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 56 [2024-11-28 03:30:18,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:30:18,292 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2024-11-28 03:30:18,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 2.116279069767442) internal successors, (91), 39 states have internal predecessors, (91), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-28 03:30:18,293 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2024-11-28 03:30:18,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-28 03:30:18,293 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:30:18,293 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:30:18,303 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 03:30:18,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:18,498 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:30:18,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:18,498 INFO L85 PathProgramCache]: Analyzing trace with hash 878430544, now seen corresponding path program 1 times [2024-11-28 03:30:18,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:30:18,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354029979] [2024-11-28 03:30:18,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:18,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:30:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:19,919 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 03:30:19,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:30:19,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354029979] [2024-11-28 03:30:19,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354029979] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:30:19,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960404426] [2024-11-28 03:30:19,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:19,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:19,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:30:19,922 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:30:19,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 03:30:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:20,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 124 conjuncts are in the unsatisfiable core [2024-11-28 03:30:20,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:30:20,233 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 03:30:20,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 03:30:20,712 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:30:20,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:30:20,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:30:20,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:30:20,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:30:21,081 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:30:21,081 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 59 treesize of output 52 [2024-11-28 03:30:21,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 03:30:21,435 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 43 treesize of output 19 [2024-11-28 03:30:21,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-28 03:30:21,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 03:30:21,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 03:30:21,996 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-28 03:30:21,996 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 03:30:22,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:30:22,012 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 51 treesize of output 34 [2024-11-28 03:30:22,034 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-28 03:30:22,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 29 [2024-11-28 03:30:22,062 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-28 03:30:22,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-28 03:30:22,584 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2024-11-28 03:30:22,584 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 53 treesize of output 48 [2024-11-28 03:30:22,604 INFO L349 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2024-11-28 03:30:22,605 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 23 treesize of output 22 [2024-11-28 03:30:22,922 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-28 03:30:22,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 82 [2024-11-28 03:30:22,952 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-28 03:30:22,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 109 [2024-11-28 03:30:23,071 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 03:30:23,115 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 03:30:23,650 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 245 treesize of output 169 [2024-11-28 03:30:24,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:30:24,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 142 [2024-11-28 03:30:24,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:30:24,664 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 110 treesize of output 114 [2024-11-28 03:30:25,722 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:30:25,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:30:26,278 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2108 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2108) .cse0) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2109) .cse0) .cse1)))) (forall ((v_ArrVal_2108 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2108) .cse0) .cse1) 4))))) is different from false [2024-11-28 03:30:32,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960404426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:30:32,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:30:32,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 28] total 49 [2024-11-28 03:30:32,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246152167] [2024-11-28 03:30:32,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:30:32,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-28 03:30:32,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:30:32,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-28 03:30:32,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=3107, Unknown=50, NotChecked=112, Total=3422 [2024-11-28 03:30:32,343 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand has 50 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 42 states have internal predecessors, (96), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-28 03:30:41,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:30:41,014 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2024-11-28 03:30:41,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-28 03:30:41,014 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 42 states have internal predecessors, (96), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2024-11-28 03:30:41,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:30:41,015 INFO L225 Difference]: With dead ends: 159 [2024-11-28 03:30:41,016 INFO L226 Difference]: Without dead ends: 159 [2024-11-28 03:30:41,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1237 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=407, Invalid=7555, Unknown=52, NotChecked=176, Total=8190 [2024-11-28 03:30:41,019 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 155 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 2244 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1891 SdHoareTripleChecker+Invalid, 2254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:30:41,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1891 Invalid, 2254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2244 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-28 03:30:41,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-28 03:30:41,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 124. [2024-11-28 03:30:41,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 101 states have (on average 1.2277227722772277) internal successors, (124), 115 states have internal predecessors, (124), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:30:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2024-11-28 03:30:41,033 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 56 [2024-11-28 03:30:41,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:30:41,033 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2024-11-28 03:30:41,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 42 states have internal predecessors, (96), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-28 03:30:41,033 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2024-11-28 03:30:41,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-28 03:30:41,034 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:30:41,034 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:30:41,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 03:30:41,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:41,235 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:30:41,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:41,235 INFO L85 PathProgramCache]: Analyzing trace with hash 91336745, now seen corresponding path program 1 times [2024-11-28 03:30:41,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:30:41,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384263954] [2024-11-28 03:30:41,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:41,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:30:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:42,431 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 03:30:42,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:30:42,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384263954] [2024-11-28 03:30:42,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384263954] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:30:42,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293335645] [2024-11-28 03:30:42,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:42,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:42,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:30:42,433 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:30:42,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 03:30:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:42,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-28 03:30:42,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:30:42,715 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 03:30:42,958 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:30:42,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:30:43,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:30:43,269 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:30:43,270 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 25 treesize of output 26 [2024-11-28 03:30:43,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:30:43,507 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 03:30:43,941 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 03:30:43,942 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 03:30:43,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2024-11-28 03:30:44,301 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2024-11-28 03:30:44,301 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 28 treesize of output 39 [2024-11-28 03:30:44,492 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2024-11-28 03:30:44,492 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 3 case distinctions, treesize of input 45 treesize of output 53 [2024-11-28 03:30:44,505 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 10 treesize of output 8 [2024-11-28 03:30:44,617 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-28 03:30:44,617 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 15 treesize of output 7 [2024-11-28 03:30:44,808 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 28 treesize of output 12 [2024-11-28 03:30:44,817 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 03:30:44,825 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:30:44,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:30:45,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293335645] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:30:45,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:30:45,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 29] total 45 [2024-11-28 03:30:45,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331834036] [2024-11-28 03:30:45,430 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:30:45,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-28 03:30:45,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:30:45,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-28 03:30:45,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=2117, Unknown=12, NotChecked=0, Total=2256 [2024-11-28 03:30:45,434 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand has 45 states, 43 states have (on average 2.13953488372093) internal successors, (92), 38 states have internal predecessors, (92), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-28 03:30:48,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:30:48,969 INFO L93 Difference]: Finished difference Result 159 states and 169 transitions. [2024-11-28 03:30:48,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-28 03:30:48,970 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 2.13953488372093) internal successors, (92), 38 states have internal predecessors, (92), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 59 [2024-11-28 03:30:48,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:30:48,971 INFO L225 Difference]: With dead ends: 159 [2024-11-28 03:30:48,971 INFO L226 Difference]: Without dead ends: 159 [2024-11-28 03:30:48,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1205 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=360, Invalid=5787, Unknown=15, NotChecked=0, Total=6162 [2024-11-28 03:30:48,973 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 154 mSDsluCounter, 1640 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:30:48,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1698 Invalid, 1604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1596 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-28 03:30:48,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-28 03:30:48,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 124. [2024-11-28 03:30:48,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 101 states have (on average 1.2178217821782178) internal successors, (123), 115 states have internal predecessors, (123), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:30:48,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2024-11-28 03:30:48,980 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 59 [2024-11-28 03:30:48,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:30:48,980 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2024-11-28 03:30:48,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 2.13953488372093) internal successors, (92), 38 states have internal predecessors, (92), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-28 03:30:48,981 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2024-11-28 03:30:48,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-28 03:30:48,981 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:30:48,982 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:30:48,994 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 03:30:49,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:49,182 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:30:49,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:49,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1546828493, now seen corresponding path program 1 times [2024-11-28 03:30:49,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:30:49,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309257923] [2024-11-28 03:30:49,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:49,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:30:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:51,094 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 03:30:51,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:30:51,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309257923] [2024-11-28 03:30:51,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309257923] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:30:51,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222516755] [2024-11-28 03:30:51,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:51,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:51,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:30:51,096 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:30:51,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 03:30:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:51,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 171 conjuncts are in the unsatisfiable core [2024-11-28 03:30:51,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:30:51,482 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 03:30:51,570 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 03:30:52,307 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:30:52,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:30:52,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 03:30:52,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:30:52,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:30:52,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 03:30:52,965 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:30:52,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 68 [2024-11-28 03:30:52,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:30:52,975 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 39 treesize of output 15 [2024-11-28 03:30:52,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 03:30:53,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2024-11-28 03:30:53,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:30:53,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-28 03:30:53,451 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 03:30:53,897 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 03:30:54,286 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 03:30:54,286 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 03:30:54,316 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 03:30:54,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2024-11-28 03:30:54,366 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-28 03:30:54,367 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 03:30:55,702 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-28 03:30:55,702 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 51 treesize of output 42 [2024-11-28 03:30:55,716 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 03:30:55,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 21 [2024-11-28 03:30:55,740 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-11-28 03:30:55,740 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 31 treesize of output 26 [2024-11-28 03:30:56,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 68 [2024-11-28 03:30:56,118 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 102 treesize of output 91 [2024-11-28 03:30:56,133 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-28 03:30:56,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 99 [2024-11-28 03:30:57,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:30:57,463 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 134 treesize of output 86 [2024-11-28 03:30:57,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:30:57,478 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 86 treesize of output 78 [2024-11-28 03:30:58,063 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 71 treesize of output 51 [2024-11-28 03:30:58,579 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:30:58,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:30:59,555 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (and (forall ((v_ArrVal_2429 (Array Int Int))) (or (forall ((v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2427 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2427) .cse2) .cse1))) (or (= .cse0 .cse1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2429) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2428) .cse2) .cse1)) (+ .cse0 4)))))) (not (= (store .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2429 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2429)))) (forall ((v_ArrVal_2429 (Array Int Int))) (or (forall ((v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2427 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2428) .cse2) .cse1))) (or (= .cse4 .cse2) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2429) .cse4) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2427) .cse2) .cse1) 4)))))) (not (= (store .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2429 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2429)))))) is different from false [2024-11-28 03:30:59,611 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_2429 (Array Int Int)) (v_ArrVal_2424 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2424))) (or (not (= (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2429 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2429)) (forall ((v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2427 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store .cse5 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2428) .cse3) .cse4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2429) .cse1) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store .cse2 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2427) .cse3) .cse4) 4))) (= .cse1 .cse3))))))) (forall ((v_ArrVal_2429 (Array Int Int)) (v_ArrVal_2424 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2424))) (or (not (= (store (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2429 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2429)) (forall ((v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2427 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store .cse2 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2427) .cse3) .cse4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2429) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store .cse5 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2428) .cse3) .cse4)) (+ .cse7 4))) (= .cse7 .cse4))))))))) is different from false [2024-11-28 03:30:59,886 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_2429 (Array Int Int)) (v_ArrVal_2424 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2424))) (or (not (= (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2429 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2429)) (forall ((v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2427 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse5 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2427) .cse4) .cse1))) (or (= .cse1 .cse2) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2429) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2428) .cse4) .cse1)) (+ 4 .cse2))))))))) (forall ((v_ArrVal_2429 (Array Int Int)) (v_ArrVal_2424 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2424))) (or (not (= (store (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2429 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2429)) (forall ((v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2427 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2428) .cse4) .cse1))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2429) .cse7) (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse5 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2427) .cse4) .cse1)))) (= .cse7 .cse4))))))))) is different from false [2024-11-28 03:31:00,011 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|)) (.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_2429 (Array Int Int)) (v_ArrVal_2424 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2424))) (or (forall ((v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2427 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store .cse5 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2427) .cse2) .cse3))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2429) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store .cse1 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2428) .cse2) .cse3)) (+ 4 .cse4))) (= .cse3 .cse4)))) (not (= (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2429 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2429))))) (forall ((v_ArrVal_2429 (Array Int Int)) (v_ArrVal_2424 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2424))) (or (forall ((v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2427 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store .cse1 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2428) .cse2) .cse3))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2429) .cse7) (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store .cse5 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2427) .cse2) .cse3)))) (= .cse2 .cse7)))) (not (= (store (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2429 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2429))))))) is different from false [2024-11-28 03:31:00,080 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse2 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_2429 (Array Int Int)) (v_ArrVal_2424 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse0 (store |c_#memory_int#1| .cse1 v_ArrVal_2424))) (or (not (= v_ArrVal_2429 (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2429 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (forall ((v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2427 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 (store .cse6 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2427) .cse3) .cse4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2429) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse2 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2428) .cse3) .cse4)) (+ .cse5 4))) (= .cse5 .cse4))))))) (forall ((v_ArrVal_2429 (Array Int Int)) (v_ArrVal_2424 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse7 (store |c_#memory_int#1| .cse1 v_ArrVal_2424))) (or (forall ((v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2427 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse2 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2428) .cse3) .cse4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2429) .cse8) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 (store .cse6 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2427) .cse3) .cse4) 4))) (= .cse8 .cse3)))) (not (= v_ArrVal_2429 (store (select .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2429 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))))))))) is different from false [2024-11-28 03:31:00,151 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse3)) (.cse4 (select |c_#memory_$Pointer$#1.offset| .cse3)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_2429 (Array Int Int)) (v_ArrVal_2424 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse2 (store |c_#memory_int#1| .cse3 v_ArrVal_2424))) (or (forall ((v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2427 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse6 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2428) .cse1) .cse5))) (or (= .cse0 .cse1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2429) .cse0) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 (store .cse4 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2427) .cse1) .cse5) 4)))))) (not (= (store (select .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_2429 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_2429))))) (forall ((v_ArrVal_2429 (Array Int Int)) (v_ArrVal_2424 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (let ((.cse7 (store |c_#memory_int#1| .cse3 v_ArrVal_2424))) (or (forall ((v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2427 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 (store .cse4 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2427) .cse1) .cse5))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse7 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2429) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse6 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2428) .cse1) .cse5)) (+ .cse8 4))) (= .cse8 .cse5)))) (not (= (store (select .cse7 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_2429 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_2429)))))))) is different from false [2024-11-28 03:31:00,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:31:00,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 307 treesize of output 308 [2024-11-28 03:31:01,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222516755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:31:01,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:31:01,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 38] total 61 [2024-11-28 03:31:01,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725212361] [2024-11-28 03:31:01,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:31:01,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-11-28 03:31:01,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:31:01,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-11-28 03:31:01,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=4474, Unknown=6, NotChecked=834, Total=5550 [2024-11-28 03:31:01,068 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand has 61 states, 58 states have (on average 1.7586206896551724) internal successors, (102), 53 states have internal predecessors, (102), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-28 03:31:07,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:31:07,511 INFO L93 Difference]: Finished difference Result 151 states and 161 transitions. [2024-11-28 03:31:07,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-11-28 03:31:07,512 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 58 states have (on average 1.7586206896551724) internal successors, (102), 53 states have internal predecessors, (102), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 60 [2024-11-28 03:31:07,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:31:07,513 INFO L225 Difference]: With dead ends: 151 [2024-11-28 03:31:07,513 INFO L226 Difference]: Without dead ends: 151 [2024-11-28 03:31:07,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2567 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=532, Invalid=11042, Unknown=6, NotChecked=1302, Total=12882 [2024-11-28 03:31:07,515 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 123 mSDsluCounter, 1588 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:31:07,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1639 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1996 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-28 03:31:07,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-28 03:31:07,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 124. [2024-11-28 03:31:07,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 115 states have internal predecessors, (122), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:31:07,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2024-11-28 03:31:07,525 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 60 [2024-11-28 03:31:07,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:31:07,526 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2024-11-28 03:31:07,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 58 states have (on average 1.7586206896551724) internal successors, (102), 53 states have internal predecessors, (102), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-28 03:31:07,526 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2024-11-28 03:31:07,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-28 03:31:07,527 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:31:07,527 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:31:07,540 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-28 03:31:07,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:31:07,728 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2024-11-28 03:31:07,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:31:07,729 INFO L85 PathProgramCache]: Analyzing trace with hash -448324544, now seen corresponding path program 2 times [2024-11-28 03:31:07,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:31:07,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054100330] [2024-11-28 03:31:07,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:31:07,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:31:07,788 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:31:07,791 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:31:10,959 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:31:10,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:31:10,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054100330] [2024-11-28 03:31:10,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054100330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:31:10,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039026303] [2024-11-28 03:31:10,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:31:10,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:31:10,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:31:10,962 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:31:10,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71ada805-652c-49fe-a665-5e0e1ab98253/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 03:31:11,287 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:31:11,287 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:31:11,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 156 conjuncts are in the unsatisfiable core [2024-11-28 03:31:11,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:31:11,301 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 03:31:11,880 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:31:11,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:31:12,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:31:12,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 03:31:12,375 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-28 03:31:12,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2024-11-28 03:31:12,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-11-28 03:31:12,832 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-28 03:31:12,832 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 64 treesize of output 31 [2024-11-28 03:31:12,840 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 03:31:12,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 03:31:13,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:31:13,649 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 03:31:13,650 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 72 treesize of output 55 [2024-11-28 03:31:13,693 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2024-11-28 03:31:13,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2024-11-28 03:31:13,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-11-28 03:31:16,070 INFO L349 Elim1Store]: treesize reduction 68, result has 59.3 percent of original size [2024-11-28 03:31:16,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 114 treesize of output 151 [2024-11-28 03:31:16,128 INFO L349 Elim1Store]: treesize reduction 72, result has 35.1 percent of original size [2024-11-28 03:31:16,128 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 2 case distinctions, treesize of input 42 treesize of output 60 [2024-11-28 03:31:17,816 INFO L349 Elim1Store]: treesize reduction 352, result has 62.3 percent of original size [2024-11-28 03:31:17,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 35 case distinctions, treesize of input 434 treesize of output 870 [2024-11-28 03:31:18,365 INFO L349 Elim1Store]: treesize reduction 268, result has 55.3 percent of original size [2024-11-28 03:31:18,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 331 treesize of output 604