./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/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_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:25:28,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:25:28,753 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 05:25:28,758 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:25:28,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:25:28,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:25:28,783 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:25:28,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:25:28,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:25:28,783 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:25:28,784 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:25:28,784 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:25:28,784 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:25:28,784 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:25:28,784 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:25:28,785 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:25:28,785 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 05:25:28,785 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:25:28,785 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:25:28,785 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:25:28,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:25:28,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 05:25:28,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:25:28,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 05:25:28,786 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:25:28,786 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 05:25:28,786 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:25:28,786 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:25:28,786 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:25:28,786 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:25:28,786 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:25:28,786 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:25:28,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:25:28,787 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:25:28,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:25:28,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:25:28,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:25:28,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:25:28,787 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:25:28,787 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:25:28,787 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 05:25:28,787 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 05:25:28,787 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 05:25:28,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 05:25:28,787 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:25:28,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:25:28,788 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:25:28,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:25:28,788 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_6a3956a6-568a-4ffb-a70e-11f1b084dc56/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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 [2024-11-28 05:25:29,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:25:29,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:25:29,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:25:29,134 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:25:29,134 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:25:29,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2024-11-28 05:25:32,204 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/data/feedc9998/32a2f11a05df489ab4ae0cd06b5c717e/FLAG4ad1ce326 [2024-11-28 05:25:32,595 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:25:32,596 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2024-11-28 05:25:32,610 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/data/feedc9998/32a2f11a05df489ab4ae0cd06b5c717e/FLAG4ad1ce326 [2024-11-28 05:25:32,629 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/data/feedc9998/32a2f11a05df489ab4ae0cd06b5c717e [2024-11-28 05:25:32,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:25:32,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:25:32,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:25:32,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:25:32,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:25:32,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:25:32" (1/1) ... [2024-11-28 05:25:32,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@386efbad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:32, skipping insertion in model container [2024-11-28 05:25:32,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:25:32" (1/1) ... [2024-11-28 05:25:32,694 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:25:33,166 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i[24211,24224] [2024-11-28 05:25:33,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:25:33,190 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:25:33,263 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i[24211,24224] [2024-11-28 05:25:33,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:25:33,292 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:25:33,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:33 WrapperNode [2024-11-28 05:25:33,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:25:33,293 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:25:33,293 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:25:33,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:25:33,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:33" (1/1) ... [2024-11-28 05:25:33,309 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:33" (1/1) ... [2024-11-28 05:25:33,327 INFO L138 Inliner]: procedures = 122, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90 [2024-11-28 05:25:33,327 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:25:33,328 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:25:33,328 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:25:33,328 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:25:33,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:33" (1/1) ... [2024-11-28 05:25:33,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:33" (1/1) ... [2024-11-28 05:25:33,341 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:33" (1/1) ... [2024-11-28 05:25:33,357 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2024-11-28 05:25:33,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:33" (1/1) ... [2024-11-28 05:25:33,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:33" (1/1) ... [2024-11-28 05:25:33,365 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:33" (1/1) ... [2024-11-28 05:25:33,366 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:33" (1/1) ... [2024-11-28 05:25:33,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:33" (1/1) ... [2024-11-28 05:25:33,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:33" (1/1) ... [2024-11-28 05:25:33,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:33" (1/1) ... [2024-11-28 05:25:33,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:25:33,374 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:25:33,374 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:25:33,374 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:25:33,375 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:33" (1/1) ... [2024-11-28 05:25:33,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:25:33,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:25:33,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:25:33,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:25:33,441 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-28 05:25:33,441 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-28 05:25:33,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 05:25:33,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 05:25:33,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 05:25:33,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 05:25:33,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 05:25:33,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:25:33,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 05:25:33,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 05:25:33,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 05:25:33,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 05:25:33,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 05:25:33,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 05:25:33,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 05:25:33,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:25:33,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:25:33,572 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:25:33,575 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:25:33,604 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-28 05:25:33,811 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-28 05:25:33,815 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:25:33,831 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:25:33,831 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-28 05:25:33,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:25:33 BoogieIcfgContainer [2024-11-28 05:25:33,832 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:25:33,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:25:33,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:25:33,842 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:25:33,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:25:32" (1/3) ... [2024-11-28 05:25:33,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557f063a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:25:33, skipping insertion in model container [2024-11-28 05:25:33,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:33" (2/3) ... [2024-11-28 05:25:33,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557f063a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:25:33, skipping insertion in model container [2024-11-28 05:25:33,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:25:33" (3/3) ... [2024-11-28 05:25:33,846 INFO L128 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2024-11-28 05:25:33,865 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:25:33,869 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll_circular_traversal-2.i that has 2 procedures, 28 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2024-11-28 05:25:33,939 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:25:33,953 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@53dd359c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:25:33,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 05:25:33,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:33,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 05:25:33,964 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:33,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:33,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:25:33,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:33,970 INFO L85 PathProgramCache]: Analyzing trace with hash 99948204, now seen corresponding path program 1 times [2024-11-28 05:25:33,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:33,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476153123] [2024-11-28 05:25:33,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:33,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:34,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:34,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:34,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476153123] [2024-11-28 05:25:34,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476153123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:34,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:34,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:25:34,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805063452] [2024-11-28 05:25:34,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:34,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 05:25:34,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:34,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 05:25:34,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 05:25:34,206 INFO L87 Difference]: Start difference. First operand has 27 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:34,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:34,222 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2024-11-28 05:25:34,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 05:25:34,224 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-28 05:25:34,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:34,230 INFO L225 Difference]: With dead ends: 42 [2024-11-28 05:25:34,230 INFO L226 Difference]: Without dead ends: 19 [2024-11-28 05:25:34,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 05:25:34,239 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:34,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:25:34,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-28 05:25:34,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-28 05:25:34,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:34,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-28 05:25:34,306 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 10 [2024-11-28 05:25:34,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:34,307 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-28 05:25:34,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:34,308 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-11-28 05:25:34,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 05:25:34,308 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:34,310 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:34,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 05:25:34,310 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:25:34,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:34,311 INFO L85 PathProgramCache]: Analyzing trace with hash -243601608, now seen corresponding path program 1 times [2024-11-28 05:25:34,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:34,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940532267] [2024-11-28 05:25:34,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:34,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:34,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:34,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:34,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940532267] [2024-11-28 05:25:34,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940532267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:34,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:34,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:25:34,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132469738] [2024-11-28 05:25:34,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:34,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:25:34,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:34,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:25:34,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:25:34,560 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:34,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:34,583 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2024-11-28 05:25:34,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:25:34,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-28 05:25:34,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:34,584 INFO L225 Difference]: With dead ends: 34 [2024-11-28 05:25:34,584 INFO L226 Difference]: Without dead ends: 23 [2024-11-28 05:25:34,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:25:34,586 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:34,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 35 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:25:34,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-28 05:25:34,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2024-11-28 05:25:34,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:34,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-11-28 05:25:34,590 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 10 [2024-11-28 05:25:34,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:34,590 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-28 05:25:34,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:34,590 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-11-28 05:25:34,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-28 05:25:34,591 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:34,591 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:34,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 05:25:34,591 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:25:34,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:34,592 INFO L85 PathProgramCache]: Analyzing trace with hash 2050217406, now seen corresponding path program 1 times [2024-11-28 05:25:34,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:34,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637215610] [2024-11-28 05:25:34,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:34,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:34,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:34,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:34,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637215610] [2024-11-28 05:25:34,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637215610] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:25:34,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071321239] [2024-11-28 05:25:34,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:34,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:25:34,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:25:34,807 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:25:34,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 05:25:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:35,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 05:25:35,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:25:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:35,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:25:35,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:35,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071321239] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:25:35,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:25:35,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-28 05:25:35,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969555086] [2024-11-28 05:25:35,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:25:35,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:25:35,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:35,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:25:35,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:25:35,160 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:35,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:35,224 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-11-28 05:25:35,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:25:35,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-28 05:25:35,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:35,226 INFO L225 Difference]: With dead ends: 43 [2024-11-28 05:25:35,226 INFO L226 Difference]: Without dead ends: 32 [2024-11-28 05:25:35,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:25:35,227 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:35,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 52 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:25:35,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-28 05:25:35,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-28 05:25:35,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:35,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-11-28 05:25:35,236 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 14 [2024-11-28 05:25:35,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:35,236 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-11-28 05:25:35,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:35,239 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-11-28 05:25:35,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 05:25:35,240 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:35,240 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:35,249 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 05:25:35,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:25:35,441 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:25:35,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:35,441 INFO L85 PathProgramCache]: Analyzing trace with hash -992716976, now seen corresponding path program 2 times [2024-11-28 05:25:35,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:35,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664062643] [2024-11-28 05:25:35,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:25:35,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:35,556 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:25:35,556 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:25:36,992 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 05:25:36,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:36,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664062643] [2024-11-28 05:25:36,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664062643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:25:36,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673291544] [2024-11-28 05:25:36,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:25:36,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:25:36,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:25:36,998 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:25:37,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 05:25:37,280 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:25:37,281 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:25:37,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-28 05:25:37,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:25:37,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:25:37,670 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:25:37,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 05:25:37,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-28 05:25:37,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 05:25:37,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:25:37,894 INFO L349 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2024-11-28 05:25:37,895 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 55 treesize of output 11 [2024-11-28 05:25:37,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 05:25:38,042 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 05:25:38,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:25:38,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:25:38,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 32 [2024-11-28 05:25:38,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:25:38,198 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 146 treesize of output 144 [2024-11-28 05:25:38,219 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 154 treesize of output 146 [2024-11-28 05:25:38,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 39 treesize of output 33 [2024-11-28 05:25:38,785 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 05:25:38,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673291544] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:25:38,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:25:38,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2024-11-28 05:25:38,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656257440] [2024-11-28 05:25:38,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:25:38,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-28 05:25:38,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:38,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-28 05:25:38,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2024-11-28 05:25:38,789 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:39,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:39,440 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-11-28 05:25:39,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:25:39,441 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-28 05:25:39,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:39,442 INFO L225 Difference]: With dead ends: 36 [2024-11-28 05:25:39,443 INFO L226 Difference]: Without dead ends: 34 [2024-11-28 05:25:39,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-11-28 05:25:39,446 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:39,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 155 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 05:25:39,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-28 05:25:39,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-28 05:25:39,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:39,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-28 05:25:39,461 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 26 [2024-11-28 05:25:39,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:39,464 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-28 05:25:39,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:39,464 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-28 05:25:39,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 05:25:39,465 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:39,465 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:39,480 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 05:25:39,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:25:39,666 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:25:39,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:39,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1114423962, now seen corresponding path program 1 times [2024-11-28 05:25:39,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:39,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406081416] [2024-11-28 05:25:39,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:39,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:42,302 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:25:42,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:42,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406081416] [2024-11-28 05:25:42,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406081416] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:25:42,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396794081] [2024-11-28 05:25:42,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:42,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:25:42,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:25:42,308 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:25:42,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 05:25:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:42,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-28 05:25:42,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:25:42,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:25:42,587 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 05:25:42,587 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 05:25:42,657 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 05:25:42,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 05:25:42,803 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-28 05:25:42,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2024-11-28 05:25:42,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-28 05:25:42,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 05:25:43,125 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-28 05:25:43,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-11-28 05:25:43,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2024-11-28 05:25:43,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:25:43,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2024-11-28 05:25:43,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2024-11-28 05:25:43,317 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:25:43,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2024-11-28 05:25:43,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 05:25:43,332 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 26 treesize of output 15 [2024-11-28 05:25:43,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2024-11-28 05:25:43,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2024-11-28 05:25:43,485 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 67 treesize of output 23 [2024-11-28 05:25:43,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-28 05:25:43,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 20 [2024-11-28 05:25:43,506 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 18 [2024-11-28 05:25:43,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-11-28 05:25:43,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-28 05:25:43,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-28 05:25:43,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 05:25:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:25:43,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:25:44,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:25:44,358 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 7432 treesize of output 7406 [2024-11-28 05:25:44,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:25:44,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1047 treesize of output 806 [2024-11-28 05:25:44,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:25:44,509 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 5746 treesize of output 5622 [2024-11-28 05:25:44,589 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 875 treesize of output 839 [2024-11-28 05:25:44,620 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 983 treesize of output 939 [2024-11-28 05:26:24,080 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 67 treesize of output 59 [2024-11-28 05:26:24,114 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 143 treesize of output 135 [2024-11-28 05:26:24,508 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 33 treesize of output 29 [2024-11-28 05:26:24,532 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 33 treesize of output 29 [2024-11-28 05:26:24,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 135 [2024-11-28 05:26:24,843 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 143 treesize of output 135 [2024-11-28 05:26:25,047 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 143 treesize of output 135 [2024-11-28 05:26:25,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 143 treesize of output 135 [2024-11-28 05:26:25,642 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 67 treesize of output 59 [2024-11-28 05:26:25,797 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 33 treesize of output 29 [2024-11-28 05:26:25,818 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 33 treesize of output 29 [2024-11-28 05:26:25,849 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 143 treesize of output 135 [2024-11-28 05:26:26,178 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 143 treesize of output 135 [2024-11-28 05:26:26,483 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 143 treesize of output 135 [2024-11-28 05:26:26,830 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 143 treesize of output 135 [2024-11-28 05:26:27,027 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 143 treesize of output 135 [2024-11-28 05:26:27,364 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 143 treesize of output 135 [2024-11-28 05:26:27,724 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 143 treesize of output 135 [2024-11-28 05:26:28,076 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 33 treesize of output 29 [2024-11-28 05:26:28,151 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 33 treesize of output 29 [2024-11-28 05:26:28,182 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 33 treesize of output 29 [2024-11-28 05:26:28,206 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 143 treesize of output 135 [2024-11-28 05:26:28,498 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 33 treesize of output 29 [2024-11-28 05:26:28,521 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 33 treesize of output 29 [2024-11-28 05:26:28,537 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 143 treesize of output 135 [2024-11-28 05:26:28,797 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 143 treesize of output 135 [2024-11-28 05:26:29,159 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 67 treesize of output 59 [2024-11-28 05:26:29,396 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 143 treesize of output 135 [2024-11-28 05:26:29,588 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 33 treesize of output 29 [2024-11-28 05:26:29,612 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 33 treesize of output 29 [2024-11-28 05:26:29,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 135 [2024-11-28 05:26:29,845 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 143 treesize of output 135 [2024-11-28 05:26:30,062 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 67 treesize of output 59 [2024-11-28 05:26:30,149 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 33 treesize of output 29 [2024-11-28 05:26:30,172 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 33 treesize of output 29 [2024-11-28 05:26:30,218 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 33 treesize of output 29 [2024-11-28 05:26:30,233 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 33 treesize of output 29 [2024-11-28 05:26:30,314 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 67 treesize of output 59 [2024-11-28 05:26:30,383 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 143 treesize of output 135 [2024-11-28 05:26:30,728 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 143 treesize of output 135 [2024-11-28 05:26:31,012 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 143 treesize of output 135 [2024-11-28 05:26:31,595 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 33 treesize of output 29 [2024-11-28 05:26:31,614 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 33 treesize of output 29 [2024-11-28 05:26:31,674 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 143 treesize of output 135 [2024-11-28 05:26:32,134 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 67 treesize of output 59 [2024-11-28 05:26:32,161 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 67 treesize of output 59 [2024-11-28 05:26:32,196 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 67 treesize of output 59 [2024-11-28 05:26:32,315 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 33 treesize of output 29 [2024-11-28 05:26:32,344 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 67 treesize of output 59 [2024-11-28 05:26:32,383 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 67 treesize of output 59 [2024-11-28 05:26:32,431 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 67 treesize of output 59 [2024-11-28 05:26:32,462 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 67 treesize of output 59 [2024-11-28 05:26:32,491 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 67 treesize of output 59 [2024-11-28 05:26:32,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2024-11-28 05:26:32,541 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 33 treesize of output 29 [2024-11-28 05:26:32,561 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 67 treesize of output 59 [2024-11-28 05:26:32,600 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 143 treesize of output 135 [2024-11-28 05:26:32,895 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 143 treesize of output 135 [2024-11-28 05:26:33,426 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 67 treesize of output 59 [2024-11-28 05:26:33,447 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 67 treesize of output 59 [2024-11-28 05:26:33,478 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 33 treesize of output 29 [2024-11-28 05:26:33,515 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 67 treesize of output 59 [2024-11-28 05:26:33,552 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 67 treesize of output 59 [2024-11-28 05:26:33,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2024-11-28 05:26:33,613 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 67 treesize of output 59 [2024-11-28 05:26:33,810 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 143 treesize of output 135 [2024-11-28 05:26:34,123 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 143 treesize of output 135 [2024-11-28 05:26:34,391 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 143 treesize of output 135 [2024-11-28 05:26:34,820 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 33 treesize of output 29 [2024-11-28 05:26:34,835 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 33 treesize of output 29 [2024-11-28 05:26:34,885 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 67 treesize of output 59 [2024-11-28 05:26:35,064 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 143 treesize of output 135 [2024-11-28 05:26:35,433 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 67 treesize of output 59 [2024-11-28 05:26:35,462 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 67 treesize of output 59 [2024-11-28 05:26:35,500 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 33 treesize of output 29 [2024-11-28 05:26:35,544 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 67 treesize of output 59 [2024-11-28 05:26:35,585 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 67 treesize of output 59 [2024-11-28 05:26:35,616 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 33 treesize of output 29 [2024-11-28 05:26:35,634 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 67 treesize of output 59 [2024-11-28 05:26:35,690 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 143 treesize of output 135 [2024-11-28 05:26:35,941 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 67 treesize of output 59 [2024-11-28 05:26:35,979 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 143 treesize of output 135 [2024-11-28 05:26:36,466 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 143 treesize of output 135 [2024-11-28 05:26:36,951 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 33 treesize of output 29 [2024-11-28 05:26:36,982 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 33 treesize of output 29 [2024-11-28 05:26:37,049 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 143 treesize of output 135 [2024-11-28 05:26:37,422 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 67 treesize of output 59 [2024-11-28 05:26:37,451 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 67 treesize of output 59 [2024-11-28 05:26:37,493 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 33 treesize of output 29 [2024-11-28 05:26:37,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2024-11-28 05:26:37,569 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 05:26:37,576 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 05:26:37,583 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 05:26:37,591 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 67 treesize of output 59 [2024-11-28 05:26:37,630 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 33 treesize of output 29 [2024-11-28 05:26:37,650 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 67 treesize of output 59 [2024-11-28 05:26:37,699 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 05:26:37,716 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 67 treesize of output 59 [2024-11-28 05:26:37,749 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:26:37,752 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 05:26:37,808 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 05:26:37,814 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 05:26:37,819 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:26:37,822 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 05:26:37,847 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 143 treesize of output 135 [2024-11-28 05:26:38,187 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 143 treesize of output 135 [2024-11-28 05:26:38,531 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 143 treesize of output 135 [2024-11-28 05:26:38,807 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 143 treesize of output 135 [2024-11-28 05:26:39,148 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 143 treesize of output 135 [2024-11-28 05:26:39,608 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 67 treesize of output 59 [2024-11-28 05:26:39,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2024-11-28 05:26:39,660 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 33 treesize of output 29 [2024-11-28 05:26:39,701 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 67 treesize of output 59 [2024-11-28 05:26:39,741 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 67 treesize of output 59 [2024-11-28 05:26:39,774 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 33 treesize of output 29 [2024-11-28 05:26:39,792 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 67 treesize of output 59 [2024-11-28 05:26:39,876 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 143 treesize of output 135 [2024-11-28 05:26:41,450 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 89927 treesize of output 86107 [2024-11-28 05:27:59,182 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-28 05:27:59,183 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-28 05:27:59,183 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-28 05:27:59,192 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 05:27:59,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:27:59,385 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:864) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2024-11-28 05:27:59,391 INFO L158 Benchmark]: Toolchain (without parser) took 146753.33ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 93.1MB in the beginning and 409.6MB in the end (delta: -316.5MB). Peak memory consumption was 313.0MB. Max. memory is 16.1GB. [2024-11-28 05:27:59,392 INFO L158 Benchmark]: CDTParser took 1.54ms. Allocated memory is still 167.8MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:27:59,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 652.06ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 75.3MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 05:27:59,393 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.96ms. Allocated memory is still 117.4MB. Free memory was 75.3MB in the beginning and 73.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:27:59,393 INFO L158 Benchmark]: Boogie Preprocessor took 45.85ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 71.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:27:59,394 INFO L158 Benchmark]: RCFGBuilder took 457.94ms. Allocated memory is still 117.4MB. Free memory was 71.3MB in the beginning and 57.4MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 05:27:59,394 INFO L158 Benchmark]: TraceAbstraction took 145555.13ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 56.7MB in the beginning and 409.6MB in the end (delta: -352.9MB). Peak memory consumption was 279.5MB. Max. memory is 16.1GB. [2024-11-28 05:27:59,396 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.54ms. Allocated memory is still 167.8MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 652.06ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 75.3MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.96ms. Allocated memory is still 117.4MB. Free memory was 75.3MB in the beginning and 73.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.85ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 71.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 457.94ms. Allocated memory is still 117.4MB. Free memory was 71.3MB in the beginning and 57.4MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 145555.13ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 56.7MB in the beginning and 409.6MB in the end (delta: -352.9MB). Peak memory consumption was 279.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/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_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:28:02,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:28:02,498 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-28 05:28:02,505 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:28:02,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:28:02,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:28:02,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:28:02,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:28:02,533 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:28:02,533 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:28:02,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:28:02,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:28:02,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:28:02,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:28:02,534 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:28:02,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:28:02,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 05:28:02,535 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:28:02,535 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:28:02,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:28:02,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 05:28:02,536 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:28:02,536 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 05:28:02,536 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 05:28:02,536 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 05:28:02,536 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 05:28:02,536 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:28:02,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 05:28:02,537 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:28:02,537 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:28:02,537 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:28:02,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:28:02,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:28:02,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:28:02,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:28:02,537 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:28:02,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:28:02,538 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:28:02,538 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:28:02,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:28:02,538 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:28:02,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:28:02,538 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 05:28:02,538 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 05:28:02,538 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 05:28:02,538 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 05:28:02,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:28:02,539 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:28:02,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:28:02,539 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:28:02,539 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_6a3956a6-568a-4ffb-a70e-11f1b084dc56/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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 [2024-11-28 05:28:02,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:28:02,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:28:02,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:28:02,918 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:28:02,918 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:28:02,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2024-11-28 05:28:05,945 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/data/0129ea620/24243997a19f4dd89639752c826fd256/FLAG7423cfd21 [2024-11-28 05:28:06,307 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:28:06,307 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2024-11-28 05:28:06,321 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/data/0129ea620/24243997a19f4dd89639752c826fd256/FLAG7423cfd21 [2024-11-28 05:28:06,343 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/data/0129ea620/24243997a19f4dd89639752c826fd256 [2024-11-28 05:28:06,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:28:06,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:28:06,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:28:06,349 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:28:06,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:28:06,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:28:06" (1/1) ... [2024-11-28 05:28:06,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@390821ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:06, skipping insertion in model container [2024-11-28 05:28:06,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:28:06" (1/1) ... [2024-11-28 05:28:06,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:28:06,870 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i[24211,24224] [2024-11-28 05:28:06,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:28:06,899 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:28:06,973 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i[24211,24224] [2024-11-28 05:28:06,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:28:07,013 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:28:07,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07 WrapperNode [2024-11-28 05:28:07,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:28:07,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:28:07,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:28:07,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:28:07,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07" (1/1) ... [2024-11-28 05:28:07,052 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07" (1/1) ... [2024-11-28 05:28:07,074 INFO L138 Inliner]: procedures = 125, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 91 [2024-11-28 05:28:07,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:28:07,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:28:07,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:28:07,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:28:07,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07" (1/1) ... [2024-11-28 05:28:07,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07" (1/1) ... [2024-11-28 05:28:07,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07" (1/1) ... [2024-11-28 05:28:07,105 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2024-11-28 05:28:07,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07" (1/1) ... [2024-11-28 05:28:07,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07" (1/1) ... [2024-11-28 05:28:07,116 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07" (1/1) ... [2024-11-28 05:28:07,117 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07" (1/1) ... [2024-11-28 05:28:07,121 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07" (1/1) ... [2024-11-28 05:28:07,123 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07" (1/1) ... [2024-11-28 05:28:07,124 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07" (1/1) ... [2024-11-28 05:28:07,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:28:07,128 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:28:07,128 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:28:07,128 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:28:07,129 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07" (1/1) ... [2024-11-28 05:28:07,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:28:07,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:28:07,163 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:28:07,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:28:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-28 05:28:07,192 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-28 05:28:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-28 05:28:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-28 05:28:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 05:28:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:28:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 05:28:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 05:28:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 05:28:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 05:28:07,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 05:28:07,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-28 05:28:07,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-28 05:28:07,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 05:28:07,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 05:28:07,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:28:07,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:28:07,320 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:28:07,322 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:28:07,351 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-28 05:28:07,834 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-28 05:28:07,835 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:28:07,852 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:28:07,852 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-28 05:28:07,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:28:07 BoogieIcfgContainer [2024-11-28 05:28:07,853 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:28:07,855 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:28:07,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:28:07,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:28:07,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:28:06" (1/3) ... [2024-11-28 05:28:07,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a46aba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:28:07, skipping insertion in model container [2024-11-28 05:28:07,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07" (2/3) ... [2024-11-28 05:28:07,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a46aba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:28:07, skipping insertion in model container [2024-11-28 05:28:07,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:28:07" (3/3) ... [2024-11-28 05:28:07,862 INFO L128 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2024-11-28 05:28:07,877 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:28:07,879 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll_circular_traversal-2.i that has 2 procedures, 28 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2024-11-28 05:28:07,933 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:28:07,949 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@8e5cd93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:28:07,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 05:28:07,958 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:28:07,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 05:28:07,964 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:28:07,965 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:28:07,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:28:07,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:28:07,971 INFO L85 PathProgramCache]: Analyzing trace with hash 99948204, now seen corresponding path program 1 times [2024-11-28 05:28:07,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:28:07,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1640239579] [2024-11-28 05:28:07,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:28:07,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:07,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:28:07,988 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:28:07,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 05:28:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:28:08,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 05:28:08,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:28:08,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:28:08,151 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:28:08,152 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:28:08,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640239579] [2024-11-28 05:28:08,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640239579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:28:08,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:28:08,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:28:08,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473284708] [2024-11-28 05:28:08,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:28:08,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 05:28:08,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:28:08,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 05:28:08,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 05:28:08,182 INFO L87 Difference]: Start difference. First operand has 27 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:28:08,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:28:08,200 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2024-11-28 05:28:08,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 05:28:08,202 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-28 05:28:08,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:28:08,209 INFO L225 Difference]: With dead ends: 42 [2024-11-28 05:28:08,210 INFO L226 Difference]: Without dead ends: 19 [2024-11-28 05:28:08,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 05:28:08,219 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:28:08,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:28:08,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-28 05:28:08,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-28 05:28:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:28:08,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-28 05:28:08,258 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 10 [2024-11-28 05:28:08,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:28:08,259 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-28 05:28:08,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:28:08,260 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-11-28 05:28:08,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 05:28:08,261 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:28:08,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:28:08,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 05:28:08,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:08,462 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:28:08,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:28:08,463 INFO L85 PathProgramCache]: Analyzing trace with hash -243601608, now seen corresponding path program 1 times [2024-11-28 05:28:08,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:28:08,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [86247527] [2024-11-28 05:28:08,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:28:08,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:08,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:28:08,467 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:28:08,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 05:28:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:28:08,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 05:28:08,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:28:08,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:28:08,687 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:28:08,687 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:28:08,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86247527] [2024-11-28 05:28:08,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86247527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:28:08,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:28:08,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:28:08,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386499917] [2024-11-28 05:28:08,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:28:08,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:28:08,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:28:08,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:28:08,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:28:08,692 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:28:08,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:28:08,829 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2024-11-28 05:28:08,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:28:08,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-28 05:28:08,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:28:08,832 INFO L225 Difference]: With dead ends: 34 [2024-11-28 05:28:08,832 INFO L226 Difference]: Without dead ends: 23 [2024-11-28 05:28:08,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:28:08,833 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 35 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.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:28:08,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 35 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:28:08,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-28 05:28:08,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2024-11-28 05:28:08,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:28:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-11-28 05:28:08,843 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 10 [2024-11-28 05:28:08,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:28:08,844 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-28 05:28:08,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:28:08,845 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-11-28 05:28:08,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-28 05:28:08,847 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:28:08,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:28:08,857 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 05:28:09,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:09,053 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:28:09,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:28:09,054 INFO L85 PathProgramCache]: Analyzing trace with hash 2050217406, now seen corresponding path program 1 times [2024-11-28 05:28:09,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:28:09,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [695704286] [2024-11-28 05:28:09,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:28:09,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:09,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:28:09,063 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:28:09,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 05:28:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:28:09,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 05:28:09,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:28:09,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:28:09,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:28:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:28:09,479 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:28:09,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695704286] [2024-11-28 05:28:09,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695704286] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:28:09,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:28:09,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2024-11-28 05:28:09,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809929015] [2024-11-28 05:28:09,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:28:09,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:28:09,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:28:09,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:28:09,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:28:09,481 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:28:09,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:28:09,957 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-11-28 05:28:09,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:28:09,960 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-28 05:28:09,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:28:09,961 INFO L225 Difference]: With dead ends: 43 [2024-11-28 05:28:09,961 INFO L226 Difference]: Without dead ends: 32 [2024-11-28 05:28:09,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:28:09,962 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:28:09,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 84 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 05:28:09,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-28 05:28:09,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-28 05:28:09,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:28:09,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-11-28 05:28:09,974 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 14 [2024-11-28 05:28:09,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:28:09,975 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-11-28 05:28:09,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:28:09,975 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-11-28 05:28:09,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 05:28:09,976 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:28:09,976 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:28:09,987 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 05:28:10,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:10,177 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:28:10,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:28:10,177 INFO L85 PathProgramCache]: Analyzing trace with hash -992716976, now seen corresponding path program 2 times [2024-11-28 05:28:10,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:28:10,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2131366295] [2024-11-28 05:28:10,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:28:10,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:10,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:28:10,187 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:28:10,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 05:28:10,864 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:28:10,864 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:28:10,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-28 05:28:10,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:28:11,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 05:28:11,295 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:28:11,296 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 13 treesize of output 13 [2024-11-28 05:28:11,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-28 05:28:11,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 05:28:11,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2024-11-28 05:28:11,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 05:28:11,617 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 05:28:11,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:28:11,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:28:11,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 32 [2024-11-28 05:28:11,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:28:11,927 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 218 treesize of output 214 [2024-11-28 05:28:11,951 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 154 treesize of output 146 [2024-11-28 05:28:12,311 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 39 treesize of output 33 [2024-11-28 05:28:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 05:28:12,942 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:28:12,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131366295] [2024-11-28 05:28:12,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131366295] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:28:12,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:28:12,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2024-11-28 05:28:12,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761847567] [2024-11-28 05:28:12,943 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:28:12,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 05:28:12,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:28:12,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 05:28:12,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-28 05:28:12,947 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:28:16,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:28:16,029 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-11-28 05:28:16,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:28:16,030 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-28 05:28:16,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:28:16,031 INFO L225 Difference]: With dead ends: 36 [2024-11-28 05:28:16,031 INFO L226 Difference]: Without dead ends: 34 [2024-11-28 05:28:16,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2024-11-28 05:28:16,033 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:28:16,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 123 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-28 05:28:16,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-28 05:28:16,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-28 05:28:16,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:28:16,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-28 05:28:16,041 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 26 [2024-11-28 05:28:16,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:28:16,041 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-28 05:28:16,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:28:16,042 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-28 05:28:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 05:28:16,042 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:28:16,043 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:28:16,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 05:28:16,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:16,243 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:28:16,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:28:16,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1114423962, now seen corresponding path program 1 times [2024-11-28 05:28:16,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:28:16,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1047911529] [2024-11-28 05:28:16,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:28:16,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:28:16,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:28:16,249 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:28:16,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 05:28:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:28:16,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-28 05:28:16,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:28:16,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 05:28:16,893 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 05:28:16,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-28 05:28:17,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-28 05:28:17,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 05:28:17,303 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-28 05:28:17,304 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 20 treesize of output 22 [2024-11-28 05:28:17,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2024-11-28 05:28:17,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:28:17,528 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 45 treesize of output 34 [2024-11-28 05:28:17,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-28 05:28:17,551 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 39 treesize of output 15 [2024-11-28 05:28:17,585 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:28:17,585 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 45 treesize of output 42 [2024-11-28 05:28:17,606 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 26 treesize of output 15 [2024-11-28 05:28:17,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 05:28:17,809 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-28 05:28:17,809 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 29 [2024-11-28 05:28:17,852 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2024-11-28 05:28:17,870 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 67 treesize of output 23 [2024-11-28 05:28:18,046 INFO L349 Elim1Store]: treesize reduction 28, result has 57.6 percent of original size [2024-11-28 05:28:18,047 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 2 case distinctions, treesize of input 66 treesize of output 68 [2024-11-28 05:28:18,081 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 93 treesize of output 48 [2024-11-28 05:28:18,102 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 20 treesize of output 1 [2024-11-28 05:28:18,139 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 26 treesize of output 15 [2024-11-28 05:28:18,868 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-28 05:28:18,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 35 [2024-11-28 05:28:18,908 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 05:28:18,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 66 [2024-11-28 05:28:19,000 INFO L349 Elim1Store]: treesize reduction 44, result has 41.3 percent of original size [2024-11-28 05:28:19,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 88 [2024-11-28 05:28:19,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:28:19,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 59 [2024-11-28 05:28:19,053 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 05:28:19,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 05:28:19,486 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:28:19,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:28:19,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:28:19,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2024-11-28 05:28:19,939 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ BitVec 32)) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (or (not (= v_ArrVal_332 (store (select |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 (select v_ArrVal_332 .cse0)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (let ((.cse1 (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv4 32)))) (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_5) (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1)))) (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) is different from false [2024-11-28 05:28:20,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:28:20,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 85 [2024-11-28 05:28:20,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:28:20,976 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 492 treesize of output 490 [2024-11-28 05:28:21,017 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 550 treesize of output 534 [2024-11-28 05:28:21,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:28:21,247 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 10614 treesize of output 10540 [2024-11-28 05:28:21,382 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 394 treesize of output 370 [2024-11-28 05:28:21,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:28:21,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 46 [2024-11-28 05:28:22,239 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 231 treesize of output 215 [2024-11-28 05:28:26,475 INFO L349 Elim1Store]: treesize reduction 104, result has 29.7 percent of original size [2024-11-28 05:28:26,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 118 [2024-11-28 05:28:26,583 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 12 treesize of output 8 [2024-11-28 05:28:26,687 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 12 treesize of output 8 [2024-11-28 05:28:26,773 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:28:29,189 INFO L349 Elim1Store]: treesize reduction 39, result has 32.8 percent of original size [2024-11-28 05:28:29,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2024-11-28 05:28:29,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 05:28:30,423 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2024-11-28 05:28:30,423 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 20 treesize of output 18 [2024-11-28 05:28:32,793 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2024-11-28 05:28:32,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 53 [2024-11-28 05:28:32,825 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 12 treesize of output 8 [2024-11-28 05:28:32,877 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 6 treesize of output 4 [2024-11-28 05:28:32,962 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 6 treesize of output 4 [2024-11-28 05:28:33,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 05:28:34,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 05:28:34,244 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32))) (.cse8 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse7 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (not .cse8)) (.cse2 (not (= .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (.cse10 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (or (and (= |c_ULTIMATE.start_main_~data_init~0#1| (_ bv1 32)) .cse0) (let ((.cse3 (not .cse0))) (and (or .cse1 (and (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5) v_arrayElimCell_45) v_arrayElimCell_48)) (not (= |c_ULTIMATE.start_dll_circular_create_~data#1| (select v_ArrVal_327 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) (or .cse2 (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5) v_arrayElimCell_45) v_arrayElimCell_48))))))) (or (and (or .cse2 (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5) v_arrayElimCell_45) v_arrayElimCell_48))))) .cse3 (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5) v_arrayElimCell_45) v_arrayElimCell_48)) (not (= |c_ULTIMATE.start_dll_circular_create_~data#1| (select v_arrayElimArr_10 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))))) .cse1) (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= |c_ULTIMATE.start_dll_circular_create_~data#1| (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5))) (or (= (select (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse4 v_arrayElimCell_45) v_arrayElimCell_48))) (not (= v_ArrVal_327 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_327 .cse5))))))))))) (or (and .cse3 (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5))) (or (= (select (select .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse6 v_arrayElimCell_45) v_arrayElimCell_48))) (not (= (store .cse7 .cse5 (select v_ArrVal_327 .cse5)) v_ArrVal_327)))))))) .cse8) (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse9 v_arrayElimCell_45) v_arrayElimCell_48)) (= (select (select .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_327 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_327 .cse5))))))) (not (= |c_ULTIMATE.start_dll_circular_create_~data#1| (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))))))) (or (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ BitVec 32)) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= (store .cse7 .cse5 (select v_ArrVal_327 .cse5)) v_ArrVal_327)) (not (= |c_ULTIMATE.start_dll_circular_create_~data#1| (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 (select v_ArrVal_332 .cse10)) v_ArrVal_332)))) .cse8) (or (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store .cse7 .cse5 (select v_ArrVal_327 .cse5)) v_ArrVal_327)))) .cse0 .cse8) (or .cse1 (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_48 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~data#1| (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (not (= v_ArrVal_327 (store v_arrayElimArr_7 .cse5 (select v_ArrVal_327 .cse5)))) (not (= (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 (select v_ArrVal_332 .cse10)) v_ArrVal_332)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5) v_arrayElimCell_45) v_arrayElimCell_48) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or .cse1 (and (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ BitVec 32))) (or (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 (select v_ArrVal_332 .cse10)) v_ArrVal_332)) (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5) v_arrayElimCell_45) v_arrayElimCell_48) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= v_ArrVal_327 (store v_arrayElimArr_7 .cse5 (select v_ArrVal_327 .cse5)))))) (not (= |c_ULTIMATE.start_dll_circular_create_~data#1| (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) (or (let ((.cse11 (= (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv4 32)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse13 (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse10)))) (and (or .cse11 (let ((.cse12 (forall ((v_arrayElimArr_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_156 (_ BitVec 32)) (v_prenex_157 (_ BitVec 32))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_9) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5) v_prenex_157) v_prenex_156)))))) (and (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_arrayElimArr_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_156 (_ BitVec 32)) (v_prenex_157 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_9) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5) v_prenex_157) v_prenex_156)) (not (= (select v_arrayElimArr_9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)))))) (or .cse2 .cse12) (or .cse13 .cse12)))) (or (not .cse11) (and (or .cse13 (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5) v_arrayElimCell_45) v_arrayElimCell_48)) (not (= v_DerPreprocessor_10 (select (store (store v_arrayElimArr_8 .cse5 v_DerPreprocessor_10) .cse10 v_DerPreprocessor_11) .cse5)))))) (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5) v_arrayElimCell_45) v_arrayElimCell_48)) (not (= v_DerPreprocessor_10 (select (store (store v_arrayElimArr_8 .cse5 v_DerPreprocessor_10) .cse10 v_DerPreprocessor_11) .cse5))) (not (= (select v_arrayElimArr_8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)))))))))) .cse0))) (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (not (= v_ArrVal_327 (store (select .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_327 .cse5)))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ BitVec 32))) (or (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse15 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= (store (select (store .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 (select v_ArrVal_332 .cse10)) v_ArrVal_332)) (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (= (select (select .cse15 v_arrayElimCell_45) v_arrayElimCell_48) |c_ULTIMATE.start_main_~data_init~0#1|))))) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (not (= |c_ULTIMATE.start_dll_circular_create_~data#1| (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) (or (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_48 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7)) (.cse17 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (not (= |c_ULTIMATE.start_dll_circular_create_~data#1| (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (not (= v_ArrVal_327 (store (select .cse16 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_327 .cse5)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse17 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= (store (select (store .cse16 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 (select v_ArrVal_332 .cse10)) v_ArrVal_332)) (= (select (select .cse17 v_arrayElimCell_45) v_arrayElimCell_48) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse0)))) is different from false [2024-11-28 05:28:38,261 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32))) (.cse8 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse7 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (not .cse8)) (.cse2 (not (= .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (.cse10 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (or (and (= |c_ULTIMATE.start_main_~data_init~0#1| (_ bv1 32)) .cse0) (let ((.cse3 (not .cse0))) (and (or .cse1 (and (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5) v_arrayElimCell_45) v_arrayElimCell_48)) (not (= |c_ULTIMATE.start_dll_circular_create_~data#1| (select v_ArrVal_327 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) (or .cse2 (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5) v_arrayElimCell_45) v_arrayElimCell_48))))))) (or (and (or .cse2 (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5) v_arrayElimCell_45) v_arrayElimCell_48))))) .cse3 (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5) v_arrayElimCell_45) v_arrayElimCell_48)) (not (= |c_ULTIMATE.start_dll_circular_create_~data#1| (select v_arrayElimArr_10 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))))) .cse1) (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= |c_ULTIMATE.start_dll_circular_create_~data#1| (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5))) (or (= (select (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse4 v_arrayElimCell_45) v_arrayElimCell_48))) (not (= v_ArrVal_327 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_327 .cse5))))))))))) (or (and .cse3 (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5))) (or (= (select (select .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse6 v_arrayElimCell_45) v_arrayElimCell_48))) (not (= (store .cse7 .cse5 (select v_ArrVal_327 .cse5)) v_ArrVal_327)))))))) .cse8) (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse9 v_arrayElimCell_45) v_arrayElimCell_48)) (= (select (select .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_327 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_327 .cse5))))))) (not (= |c_ULTIMATE.start_dll_circular_create_~data#1| (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))))))) (or (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ BitVec 32)) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= (store .cse7 .cse5 (select v_ArrVal_327 .cse5)) v_ArrVal_327)) (not (= |c_ULTIMATE.start_dll_circular_create_~data#1| (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 (select v_ArrVal_332 .cse10)) v_ArrVal_332)))) .cse8) (or (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store .cse7 .cse5 (select v_ArrVal_327 .cse5)) v_ArrVal_327)))) .cse0 .cse8) (or .cse1 (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_48 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~data#1| (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (not (= v_ArrVal_327 (store v_arrayElimArr_7 .cse5 (select v_ArrVal_327 .cse5)))) (not (= (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 (select v_ArrVal_332 .cse10)) v_ArrVal_332)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5) v_arrayElimCell_45) v_arrayElimCell_48) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or .cse1 (and (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ BitVec 32))) (or (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 (select v_ArrVal_332 .cse10)) v_ArrVal_332)) (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5) v_arrayElimCell_45) v_arrayElimCell_48) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= v_ArrVal_327 (store v_arrayElimArr_7 .cse5 (select v_ArrVal_327 .cse5)))))) (not (= |c_ULTIMATE.start_dll_circular_create_~data#1| (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) (or (let ((.cse11 (= (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv4 32)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse13 (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse10)))) (and (or .cse11 (let ((.cse12 (forall ((v_arrayElimArr_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_156 (_ BitVec 32)) (v_prenex_157 (_ BitVec 32))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_9) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5) v_prenex_157) v_prenex_156)))))) (and (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_arrayElimArr_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_156 (_ BitVec 32)) (v_prenex_157 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_9) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5) v_prenex_157) v_prenex_156)) (not (= (select v_arrayElimArr_9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)))))) (or .cse2 .cse12) (or .cse13 .cse12)))) (or (not .cse11) (and (or .cse13 (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5) v_arrayElimCell_45) v_arrayElimCell_48)) (not (= v_DerPreprocessor_10 (select (store (store v_arrayElimArr_8 .cse5 v_DerPreprocessor_10) .cse10 v_DerPreprocessor_11) .cse5)))))) (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5) v_arrayElimCell_45) v_arrayElimCell_48)) (not (= v_DerPreprocessor_10 (select (store (store v_arrayElimArr_8 .cse5 v_DerPreprocessor_10) .cse10 v_DerPreprocessor_11) .cse5))) (not (= (select v_arrayElimArr_8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)))))))))) .cse0))) (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (not (= v_ArrVal_327 (store (select .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_327 .cse5)))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ BitVec 32))) (or (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse15 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= (store (select (store .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 (select v_ArrVal_332 .cse10)) v_ArrVal_332)) (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (= (select (select .cse15 v_arrayElimCell_45) v_arrayElimCell_48) |c_ULTIMATE.start_main_~data_init~0#1|))))) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (not (= |c_ULTIMATE.start_dll_circular_create_~data#1| (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) (or (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_48 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7)) (.cse17 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_5))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (not (= |c_ULTIMATE.start_dll_circular_create_~data#1| (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (not (= v_ArrVal_327 (store (select .cse16 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_327 .cse5)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse17 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= (store (select (store .cse16 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 (select v_ArrVal_332 .cse10)) v_ArrVal_332)) (= (select (select .cse17 v_arrayElimCell_45) v_arrayElimCell_48) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse0)))) is different from true [2024-11-28 05:28:40,491 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2024-11-28 05:28:40,491 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 20 treesize of output 18 [2024-11-28 05:28:40,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 05:28:41,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 05:28:41,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:28:41,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-28 05:28:41,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:28:41,215 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2024-11-28 05:28:41,215 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 20 treesize of output 18 [2024-11-28 05:28:41,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 05:28:41,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 05:28:41,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 05:28:41,941 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (let ((.cse1 (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_48 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_332 (store (select |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse9 (select v_ArrVal_332 .cse9)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_5) v_arrayElimCell_45) v_arrayElimCell_48)) (not (= (_ bv1 32) (select v_arrayElimArr_5 (_ bv0 32))))))) (.cse3 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse0 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (.cse6 (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_5) v_arrayElimCell_45) v_arrayElimCell_48)) (not (= (_ bv1 32) (select v_arrayElimArr_5 (_ bv0 32))))))) (.cse4 (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32))) (.cse2 (= (_ bv0 32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (and (or .cse0 .cse1) (or .cse2 (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| (_ BitVec 32)) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_arrayElimArr_5) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= (store .cse3 .cse4 (select v_ArrVal_327 .cse4)) v_ArrVal_327)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) (not (= (_ bv1 32) (select v_arrayElimArr_5 (_ bv0 32))))))) (or .cse0 (and .cse1 (or .cse2 (let ((.cse5 (= (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv4 32)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (and (or (not .cse5) .cse6) (or (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_156 (_ BitVec 32)) (v_prenex_157 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_5) v_prenex_157) v_prenex_156)) (not (= (_ bv1 32) (select v_arrayElimArr_5 (_ bv0 32)))))) .cse5)))))) (or .cse2 (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_48 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| (_ BitVec 32)) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_332) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_arrayElimArr_5)) (.cse8 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_arrayElimArr_7))) (or (= (select (select .cse7 v_arrayElimCell_45) v_arrayElimCell_48) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= (select v_arrayElimArr_7 (_ bv0 32)) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (not (= v_ArrVal_327 (store (select .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_327 .cse4)))) (not (= (_ bv1 32) (select v_arrayElimArr_5 (_ bv0 32)))) (not (= (store (select (store .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse9 (select v_ArrVal_332 .cse9)) v_ArrVal_332)))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|))) (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ BitVec 32)) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_332) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_arrayElimArr_5) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= (store .cse3 .cse4 (select v_ArrVal_327 .cse4)) v_ArrVal_327)) (not (= (select v_arrayElimArr_7 (_ bv0 32)) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (not (= (_ bv1 32) (select v_arrayElimArr_5 (_ bv0 32)))) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) (not (= (store (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse9 (select v_ArrVal_332 .cse9)) v_ArrVal_332)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| (_ BitVec 32))) (or (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 (_ bv0 32)))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_arrayElimArr_7))) (or (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ BitVec 32))) (or (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_332) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_arrayElimArr_5))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (= (select (select .cse10 v_arrayElimCell_45) v_arrayElimCell_48) |c_ULTIMATE.start_main_~data_init~0#1|)) (not (= (store (select (store .cse11 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse9 (select v_ArrVal_332 .cse9)) v_ArrVal_332))))) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|))) (not (= v_ArrVal_327 (store (select .cse11 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_327 .cse4))))))) (not (= (select v_arrayElimArr_7 (_ bv0 32)) |c_ULTIMATE.start_dll_circular_create_~data#1|)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|))))) (or (and (= |c_ULTIMATE.start_main_~data_init~0#1| (_ bv1 32)) .cse2) (let ((.cse12 (not .cse2))) (and (or (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|)))) .cse12) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|))) (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_arrayElimArr_5))) (or (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse13 v_arrayElimCell_45) v_arrayElimCell_48))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= (store .cse3 .cse4 (select v_ArrVal_327 .cse4)) v_ArrVal_327))))) (not (= (_ bv1 32) (select v_arrayElimArr_5 (_ bv0 32)))))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|))) (or .cse0 .cse6) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|))) (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv1 32) (select v_arrayElimArr_5 (_ bv0 32)))) (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_arrayElimArr_5))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse14 v_arrayElimCell_45) v_arrayElimCell_48)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= v_ArrVal_327 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_327 .cse4))))))) (not (= (select v_arrayElimArr_7 (_ bv0 32)) |c_ULTIMATE.start_dll_circular_create_~data#1|)))))))) (or .cse0 (and .cse12 .cse6)) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|))) (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_327) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_arrayElimArr_5))) (or (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse15 v_arrayElimCell_45) v_arrayElimCell_48))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse15 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= v_ArrVal_327 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_327 .cse4))))))) (not (= (select v_arrayElimArr_7 (_ bv0 32)) |c_ULTIMATE.start_dll_circular_create_~data#1|)))) (not (= (_ bv1 32) (select v_arrayElimArr_5 (_ bv0 32)))))))))))))) is different from false [2024-11-28 05:28:44,592 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 52 treesize of output 48 [2024-11-28 05:28:44,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:28:44,627 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 54 treesize of output 56 [2024-11-28 05:28:44,640 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 22 treesize of output 20 [2024-11-28 05:28:44,713 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:28:44,902 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-28 05:28:44,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 265 treesize of output 275 [2024-11-28 05:28:44,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:28:44,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 209 treesize of output 207 [2024-11-28 05:28:45,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:28:45,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 191 treesize of output 191 [2024-11-28 05:28:45,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:28:45,120 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 182 treesize of output 180 [2024-11-28 05:28:45,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 05:28:45,778 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 17 treesize of output 13 [2024-11-28 05:28:45,821 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:28:45,980 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-28 05:28:45,980 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 2 case distinctions, treesize of input 268 treesize of output 278 [2024-11-28 05:28:46,015 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:28:46,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:28:46,065 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 209 treesize of output 207 [2024-11-28 05:28:46,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:28:46,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 191 [2024-11-28 05:28:46,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:28:46,208 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 182 treesize of output 180 [2024-11-28 05:28:46,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 05:28:47,303 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 17 treesize of output 13 [2024-11-28 05:28:47,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 05:28:47,340 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:28:47,562 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-28 05:28:47,562 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 2 case distinctions, treesize of input 268 treesize of output 278 [2024-11-28 05:28:47,600 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:28:47,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:28:47,646 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 209 treesize of output 207 [2024-11-28 05:28:47,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:28:47,722 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 191 treesize of output 191 [2024-11-28 05:28:47,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:28:47,793 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 182 treesize of output 180 [2024-11-28 05:28:47,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 05:28:48,802 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 17 treesize of output 13 [2024-11-28 05:28:48,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 05:28:48,835 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:28:49,632 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2024-11-28 05:28:49,633 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 7 case distinctions, treesize of input 1180 treesize of output 1209 [2024-11-28 05:28:49,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:28:49,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1185 treesize of output 1183 [2024-11-28 05:28:53,250 INFO L349 Elim1Store]: treesize reduction 132, result has 35.9 percent of original size [2024-11-28 05:28:53,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 694 treesize of output 744 [2024-11-28 05:28:54,108 INFO L349 Elim1Store]: treesize reduction 86, result has 46.3 percent of original size [2024-11-28 05:28:54,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 667 treesize of output 674 [2024-11-28 05:28:54,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:28:54,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 454 treesize of output 456 [2024-11-28 05:28:56,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 05:28:56,450 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 05:28:57,954 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 13 treesize of output 1 [2024-11-28 05:28:58,520 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 13 treesize of output 1 [2024-11-28 05:29:00,946 INFO L349 Elim1Store]: treesize reduction 19, result has 34.5 percent of original size [2024-11-28 05:29:00,946 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 3 case distinctions, treesize of input 50 treesize of output 30 [2024-11-28 05:29:02,985 INFO L349 Elim1Store]: treesize reduction 19, result has 34.5 percent of original size [2024-11-28 05:29:02,985 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 3 case distinctions, treesize of input 50 treesize of output 30 [2024-11-28 05:29:04,438 INFO L349 Elim1Store]: treesize reduction 19, result has 34.5 percent of original size [2024-11-28 05:29:04,438 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 3 case distinctions, treesize of input 50 treesize of output 30 [2024-11-28 05:29:07,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:29:07,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 67 [2024-11-28 05:29:07,611 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 110 treesize of output 106 [2024-11-28 05:29:08,349 INFO L349 Elim1Store]: treesize reduction 129, result has 33.8 percent of original size [2024-11-28 05:29:08,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 259 treesize of output 321 [2024-11-28 05:29:13,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:29:13,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 957 treesize of output 987 [2024-11-28 05:36:06,059 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-28 05:36:06,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-28 05:36:06,060 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:36:06,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047911529] [2024-11-28 05:36:06,061 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-28 05:36:06,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 05:36:06,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:36:06,262 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:590) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 75 more [2024-11-28 05:36:06,268 INFO L158 Benchmark]: Toolchain (without parser) took 479920.80ms. Allocated memory was 83.9MB in the beginning and 486.5MB in the end (delta: 402.7MB). Free memory was 57.7MB in the beginning and 450.7MB in the end (delta: -393.0MB). Peak memory consumption was 286.2MB. Max. memory is 16.1GB. [2024-11-28 05:36:06,270 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 83.9MB. Free memory was 63.6MB in the beginning and 63.5MB in the end (delta: 17.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:36:06,270 INFO L158 Benchmark]: CACSL2BoogieTranslator took 666.85ms. Allocated memory is still 83.9MB. Free memory was 57.7MB in the beginning and 39.3MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 05:36:06,271 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.79ms. Allocated memory is still 83.9MB. Free memory was 38.7MB in the beginning and 37.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:36:06,271 INFO L158 Benchmark]: Boogie Preprocessor took 52.07ms. Allocated memory is still 83.9MB. Free memory was 37.0MB in the beginning and 34.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:36:06,271 INFO L158 Benchmark]: RCFGBuilder took 725.23ms. Allocated memory is still 83.9MB. Free memory was 34.6MB in the beginning and 56.7MB in the end (delta: -22.1MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2024-11-28 05:36:06,272 INFO L158 Benchmark]: TraceAbstraction took 478411.88ms. Allocated memory was 83.9MB in the beginning and 486.5MB in the end (delta: 402.7MB). Free memory was 56.2MB in the beginning and 450.7MB in the end (delta: -394.5MB). Peak memory consumption was 281.9MB. Max. memory is 16.1GB. [2024-11-28 05:36:06,274 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46ms. Allocated memory is still 83.9MB. Free memory was 63.6MB in the beginning and 63.5MB in the end (delta: 17.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 666.85ms. Allocated memory is still 83.9MB. Free memory was 57.7MB in the beginning and 39.3MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.79ms. Allocated memory is still 83.9MB. Free memory was 38.7MB in the beginning and 37.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.07ms. Allocated memory is still 83.9MB. Free memory was 37.0MB in the beginning and 34.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 725.23ms. Allocated memory is still 83.9MB. Free memory was 34.6MB in the beginning and 56.7MB in the end (delta: -22.1MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * TraceAbstraction took 478411.88ms. Allocated memory was 83.9MB in the beginning and 486.5MB in the end (delta: 402.7MB). Free memory was 56.2MB in the beginning and 450.7MB in the end (delta: -394.5MB). Peak memory consumption was 281.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a3956a6-568a-4ffb-a70e-11f1b084dc56/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")