./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd --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 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:07:50,546 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:07:50,626 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:07:50,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:07:50,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:07:50,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:07:50,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:07:50,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:07:50,676 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:07:50,676 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:07:50,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:07:50,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:07:50,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:07:50,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:07:50,677 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:07:50,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:07:50,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:07:50,679 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:07:50,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:07:50,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:07:50,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:07:50,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:07:50,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:07:50,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:07:50,680 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:07:50,680 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:07:50,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:07:50,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:07:50,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:07:50,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:07:50,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:07:50,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:07:50,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:07:50,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:07:50,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:07:50,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:07:50,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:07:50,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:07:50,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:07:50,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:07:50,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:07:50,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:07:50,684 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_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2024-11-13 14:07:51,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:07:51,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:07:51,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:07:51,133 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:07:51,134 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:07:51,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i Unable to find full path for "g++" [2024-11-13 14:07:53,289 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:07:53,699 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:07:53,700 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2024-11-13 14:07:53,715 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/data/cd466c0aa/22ecd5ea8e254ed489e6ce2f7c5027bf/FLAG6881372b6 [2024-11-13 14:07:53,744 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/data/cd466c0aa/22ecd5ea8e254ed489e6ce2f7c5027bf [2024-11-13 14:07:53,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:07:53,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:07:53,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:07:53,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:07:53,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:07:53,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:07:53" (1/1) ... [2024-11-13 14:07:53,764 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46b3d60f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:53, skipping insertion in model container [2024-11-13 14:07:53,764 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:07:53" (1/1) ... [2024-11-13 14:07:53,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:07:54,200 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_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2024-11-13 14:07:54,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:07:54,213 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:07:54,269 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_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2024-11-13 14:07:54,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:07:54,314 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:07:54,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:54 WrapperNode [2024-11-13 14:07:54,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:07:54,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:07:54,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:07:54,317 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:07:54,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:54" (1/1) ... [2024-11-13 14:07:54,344 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:54" (1/1) ... [2024-11-13 14:07:54,380 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 117 [2024-11-13 14:07:54,383 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:07:54,384 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:07:54,384 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:07:54,386 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:07:54,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:54" (1/1) ... [2024-11-13 14:07:54,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:54" (1/1) ... [2024-11-13 14:07:54,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:54" (1/1) ... [2024-11-13 14:07:54,442 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 5, 9]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 6 writes are split as follows [0, 1, 5]. [2024-11-13 14:07:54,443 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:54" (1/1) ... [2024-11-13 14:07:54,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:54" (1/1) ... [2024-11-13 14:07:54,464 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:54" (1/1) ... [2024-11-13 14:07:54,471 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:54" (1/1) ... [2024-11-13 14:07:54,473 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:54" (1/1) ... [2024-11-13 14:07:54,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:54" (1/1) ... [2024-11-13 14:07:54,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:07:54,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:07:54,482 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:07:54,482 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:07:54,488 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:54" (1/1) ... [2024-11-13 14:07:54,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:07:54,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:07:54,539 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:07:54,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:07:54,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 14:07:54,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 14:07:54,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 14:07:54,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 14:07:54,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 14:07:54,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 14:07:54,587 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-13 14:07:54,587 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-13 14:07:54,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 14:07:54,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:07:54,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 14:07:54,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 14:07:54,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 14:07:54,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 14:07:54,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 14:07:54,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 14:07:54,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 14:07:54,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 14:07:54,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 14:07:54,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 14:07:54,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 14:07:54,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:07:54,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 14:07:54,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 14:07:54,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:07:54,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:07:54,770 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:07:54,772 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:07:55,050 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-13 14:07:55,050 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:07:55,061 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:07:55,061 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-13 14:07:55,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:07:55 BoogieIcfgContainer [2024-11-13 14:07:55,062 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:07:55,064 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:07:55,065 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:07:55,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:07:55,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:07:53" (1/3) ... [2024-11-13 14:07:55,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd66ae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:07:55, skipping insertion in model container [2024-11-13 14:07:55,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:54" (2/3) ... [2024-11-13 14:07:55,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd66ae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:07:55, skipping insertion in model container [2024-11-13 14:07:55,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:07:55" (3/3) ... [2024-11-13 14:07:55,073 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2024-11-13 14:07:55,091 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:07:55,093 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_insert_equal.i that has 2 procedures, 29 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2024-11-13 14:07:55,174 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:07:55,195 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;@123ac8d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:07:55,196 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:07:55,202 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:07:55,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 14:07:55,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:07:55,212 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:07:55,213 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:07:55,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:07:55,220 INFO L85 PathProgramCache]: Analyzing trace with hash -750718869, now seen corresponding path program 1 times [2024-11-13 14:07:55,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:07:55,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840833524] [2024-11-13 14:07:55,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:07:55,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:07:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:55,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:07:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:55,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:07:55,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:07:55,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840833524] [2024-11-13 14:07:55,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840833524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:07:55,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:07:55,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:07:55,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306149778] [2024-11-13 14:07:55,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:07:55,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:07:55,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:07:55,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:07:55,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:07:55,920 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:07:56,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:07:56,014 INFO L93 Difference]: Finished difference Result 56 states and 80 transitions. [2024-11-13 14:07:56,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:07:56,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-13 14:07:56,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:07:56,024 INFO L225 Difference]: With dead ends: 56 [2024-11-13 14:07:56,025 INFO L226 Difference]: Without dead ends: 26 [2024-11-13 14:07:56,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:07:56,032 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:07:56,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 85 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:07:56,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-13 14:07:56,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-11-13 14:07:56,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:07:56,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2024-11-13 14:07:56,086 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 19 [2024-11-13 14:07:56,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:07:56,086 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-11-13 14:07:56,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:07:56,087 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2024-11-13 14:07:56,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 14:07:56,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:07:56,089 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:07:56,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:07:56,089 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:07:56,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:07:56,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1908804259, now seen corresponding path program 1 times [2024-11-13 14:07:56,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:07:56,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860857531] [2024-11-13 14:07:56,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:07:56,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:07:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:56,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:07:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:56,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 14:07:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:56,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 14:07:56,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:07:56,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860857531] [2024-11-13 14:07:56,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860857531] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:07:56,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706767824] [2024-11-13 14:07:56,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:07:56,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:07:56,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:07:56,501 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:07:56,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:07:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:56,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:07:56,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:07:56,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:07:56,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:07:56,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 14:07:56,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706767824] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:07:56,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:07:56,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-11-13 14:07:56,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934983627] [2024-11-13 14:07:56,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:07:56,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:07:56,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:07:56,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:07:56,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:07:56,957 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:07:57,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:07:57,039 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2024-11-13 14:07:57,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:07:57,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2024-11-13 14:07:57,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:07:57,042 INFO L225 Difference]: With dead ends: 45 [2024-11-13 14:07:57,042 INFO L226 Difference]: Without dead ends: 27 [2024-11-13 14:07:57,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:07:57,043 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:07:57,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 83 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:07:57,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-13 14:07:57,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-13 14:07:57,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:07:57,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-13 14:07:57,056 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 27 [2024-11-13 14:07:57,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:07:57,059 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-13 14:07:57,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:07:57,060 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-13 14:07:57,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 14:07:57,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:07:57,062 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:07:57,086 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:07:57,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:07:57,267 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:07:57,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:07:57,268 INFO L85 PathProgramCache]: Analyzing trace with hash 495545563, now seen corresponding path program 2 times [2024-11-13 14:07:57,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:07:57,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596531940] [2024-11-13 14:07:57,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:07:57,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:07:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:57,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:07:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:57,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:07:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:57,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:07:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:57,454 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 14:07:57,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:07:57,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596531940] [2024-11-13 14:07:57,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596531940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:07:57,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:07:57,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:07:57,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198155969] [2024-11-13 14:07:57,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:07:57,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:07:57,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:07:57,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:07:57,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:07:57,456 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 14:07:57,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:07:57,502 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-11-13 14:07:57,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:07:57,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-13 14:07:57,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:07:57,505 INFO L225 Difference]: With dead ends: 36 [2024-11-13 14:07:57,505 INFO L226 Difference]: Without dead ends: 29 [2024-11-13 14:07:57,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:07:57,507 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:07:57,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:07:57,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-13 14:07:57,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-13 14:07:57,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:07:57,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-11-13 14:07:57,516 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 35 [2024-11-13 14:07:57,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:07:57,517 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-11-13 14:07:57,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 14:07:57,517 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-11-13 14:07:57,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 14:07:57,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:07:57,518 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:07:57,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:07:57,519 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:07:57,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:07:57,519 INFO L85 PathProgramCache]: Analyzing trace with hash 552803865, now seen corresponding path program 1 times [2024-11-13 14:07:57,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:07:57,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593631891] [2024-11-13 14:07:57,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:07:57,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:07:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:58,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:07:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:58,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:07:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:58,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:07:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:58,925 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 14:07:58,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:07:58,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593631891] [2024-11-13 14:07:58,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593631891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:07:58,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:07:58,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 14:07:58,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780478989] [2024-11-13 14:07:58,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:07:58,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 14:07:58,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:07:58,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 14:07:58,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:07:58,931 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:07:59,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:07:59,332 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2024-11-13 14:07:59,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 14:07:59,332 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2024-11-13 14:07:59,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:07:59,333 INFO L225 Difference]: With dead ends: 40 [2024-11-13 14:07:59,334 INFO L226 Difference]: Without dead ends: 38 [2024-11-13 14:07:59,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-13 14:07:59,335 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 15 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:07:59,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 127 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:07:59,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-13 14:07:59,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2024-11-13 14:07:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:07:59,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2024-11-13 14:07:59,345 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 35 [2024-11-13 14:07:59,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:07:59,346 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-11-13 14:07:59,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:07:59,347 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2024-11-13 14:07:59,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 14:07:59,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:07:59,348 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:07:59,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:07:59,348 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:07:59,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:07:59,349 INFO L85 PathProgramCache]: Analyzing trace with hash 552802191, now seen corresponding path program 1 times [2024-11-13 14:07:59,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:07:59,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762626693] [2024-11-13 14:07:59,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:07:59,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:07:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:59,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:07:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:59,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:07:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:59,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:07:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:59,900 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 14:07:59,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:07:59,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762626693] [2024-11-13 14:07:59,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762626693] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:07:59,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57422212] [2024-11-13 14:07:59,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:07:59,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:07:59,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:07:59,907 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:07:59,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:08:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:00,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:08:00,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:08:00,237 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 14:08:00,239 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:08:00,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57422212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:08:00,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:08:00,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-13 14:08:00,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241128547] [2024-11-13 14:08:00,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:08:00,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:08:00,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:08:00,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:08:00,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:08:00,241 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:08:00,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:08:00,286 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-11-13 14:08:00,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:08:00,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2024-11-13 14:08:00,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:08:00,287 INFO L225 Difference]: With dead ends: 44 [2024-11-13 14:08:00,289 INFO L226 Difference]: Without dead ends: 34 [2024-11-13 14:08:00,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:08:00,291 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:08:00,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 54 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:08:00,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-13 14:08:00,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-13 14:08:00,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:08:00,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-11-13 14:08:00,304 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 35 [2024-11-13 14:08:00,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:08:00,304 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-11-13 14:08:00,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:08:00,304 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-11-13 14:08:00,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 14:08:00,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:08:00,306 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:08:00,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 14:08:00,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:00,506 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:08:00,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:08:00,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1254003739, now seen corresponding path program 1 times [2024-11-13 14:08:00,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:08:00,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829824250] [2024-11-13 14:08:00,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:08:00,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:08:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:02,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:08:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:02,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:08:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:02,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:08:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:02,567 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 14:08:02,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:08:02,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829824250] [2024-11-13 14:08:02,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829824250] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:08:02,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100520554] [2024-11-13 14:08:02,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:08:02,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:02,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:08:02,571 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:08:02,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 14:08:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:03,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-13 14:08:03,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:08:03,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:08:03,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 14:08:03,326 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-13 14:08:03,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 9 treesize of output 3 [2024-11-13 14:08:03,622 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 11 treesize of output 3 [2024-11-13 14:08:03,985 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-13 14:08:03,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-13 14:08:04,022 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-13 14:08:04,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-13 14:08:04,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-13 14:08:04,662 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-13 14:08:04,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 14:08:04,913 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 14:08:04,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:08:11,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100520554] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:08:11,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:08:11,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2024-11-13 14:08:11,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086490911] [2024-11-13 14:08:11,812 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:08:11,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-13 14:08:11,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:08:11,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-13 14:08:11,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1308, Unknown=50, NotChecked=0, Total=1482 [2024-11-13 14:08:11,818 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 34 states, 32 states have (on average 1.5625) internal successors, (50), 28 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-13 14:08:23,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:08:23,496 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2024-11-13 14:08:23,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 14:08:23,496 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.5625) internal successors, (50), 28 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2024-11-13 14:08:23,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:08:23,497 INFO L225 Difference]: With dead ends: 50 [2024-11-13 14:08:23,497 INFO L226 Difference]: Without dead ends: 48 [2024-11-13 14:08:23,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=178, Invalid=2121, Unknown=53, NotChecked=0, Total=2352 [2024-11-13 14:08:23,500 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 33 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:08:23,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 229 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 14:08:23,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-13 14:08:23,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2024-11-13 14:08:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:08:23,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2024-11-13 14:08:23,511 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 36 [2024-11-13 14:08:23,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:08:23,511 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2024-11-13 14:08:23,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.5625) internal successors, (50), 28 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-13 14:08:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2024-11-13 14:08:23,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 14:08:23,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:08:23,513 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:08:23,534 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 14:08:23,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-13 14:08:23,714 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:08:23,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:08:23,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1254005413, now seen corresponding path program 1 times [2024-11-13 14:08:23,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:08:23,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42915796] [2024-11-13 14:08:23,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:08:23,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:08:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:23,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:08:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:23,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:08:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:24,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:08:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:24,023 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 14:08:24,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:08:24,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42915796] [2024-11-13 14:08:24,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42915796] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:08:24,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473522199] [2024-11-13 14:08:24,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:08:24,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:24,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:08:24,027 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:08:24,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 14:08:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:24,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 14:08:24,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:08:24,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-13 14:08:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 14:08:24,365 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:08:24,446 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 14:08:24,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473522199] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:08:24,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:08:24,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 11 [2024-11-13 14:08:24,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308087034] [2024-11-13 14:08:24,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:08:24,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 14:08:24,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:08:24,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 14:08:24,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:08:24,448 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 14:08:28,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:08:32,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:08:36,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:08:40,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:08:44,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:08:44,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:08:44,768 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2024-11-13 14:08:44,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 14:08:44,769 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2024-11-13 14:08:44,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:08:44,770 INFO L225 Difference]: With dead ends: 52 [2024-11-13 14:08:44,770 INFO L226 Difference]: Without dead ends: 49 [2024-11-13 14:08:44,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-13 14:08:44,772 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:08:44,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 204 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2024-11-13 14:08:44,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-13 14:08:44,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2024-11-13 14:08:44,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:08:44,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2024-11-13 14:08:44,783 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 36 [2024-11-13 14:08:44,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:08:44,784 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2024-11-13 14:08:44,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 14:08:44,784 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2024-11-13 14:08:44,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 14:08:44,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:08:44,786 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:08:44,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 14:08:44,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:44,990 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:08:44,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:08:44,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1196747111, now seen corresponding path program 1 times [2024-11-13 14:08:44,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:08:44,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293782544] [2024-11-13 14:08:44,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:08:44,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:08:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:45,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:08:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:45,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:08:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:45,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:08:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:45,838 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 14:08:45,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:08:45,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293782544] [2024-11-13 14:08:45,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293782544] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:08:45,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505229254] [2024-11-13 14:08:45,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:08:45,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:45,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:08:45,841 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:08:45,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 14:08:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:46,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-13 14:08:46,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:08:46,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:08:46,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 14:08:46,572 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-13 14:08:46,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-13 14:08:46,905 INFO L349 Elim1Store]: treesize reduction 71, result has 25.3 percent of original size [2024-11-13 14:08:46,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 43 [2024-11-13 14:08:47,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:08:47,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 143 [2024-11-13 14:08:47,623 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 14:08:47,623 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:08:47,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505229254] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:08:47,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:08:47,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2024-11-13 14:08:47,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197066539] [2024-11-13 14:08:47,954 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:08:47,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-13 14:08:47,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:08:47,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 14:08:47,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 14:08:47,956 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 29 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 23 states have internal predecessors, (48), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-13 14:08:52,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:08:56,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:09:00,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:09:00,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:09:00,904 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2024-11-13 14:09:00,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 14:09:00,905 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 23 states have internal predecessors, (48), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2024-11-13 14:09:00,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:09:00,906 INFO L225 Difference]: With dead ends: 58 [2024-11-13 14:09:00,906 INFO L226 Difference]: Without dead ends: 49 [2024-11-13 14:09:00,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=155, Invalid=1651, Unknown=0, NotChecked=0, Total=1806 [2024-11-13 14:09:00,908 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 15 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:09:00,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 342 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 392 Invalid, 3 Unknown, 0 Unchecked, 12.5s Time] [2024-11-13 14:09:00,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-13 14:09:00,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2024-11-13 14:09:00,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:09:00,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2024-11-13 14:09:00,925 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 36 [2024-11-13 14:09:00,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:09:00,925 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2024-11-13 14:09:00,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 23 states have internal predecessors, (48), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-13 14:09:00,926 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2024-11-13 14:09:00,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 14:09:00,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:09:00,930 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:09:00,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-13 14:09:01,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:09:01,131 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:09:01,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:09:01,132 INFO L85 PathProgramCache]: Analyzing trace with hash 344542747, now seen corresponding path program 2 times [2024-11-13 14:09:01,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:09:01,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813602381] [2024-11-13 14:09:01,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:09:01,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:09:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:01,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:09:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:01,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:09:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:01,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:09:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:01,382 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 14:09:01,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:09:01,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813602381] [2024-11-13 14:09:01,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813602381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:09:01,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471994950] [2024-11-13 14:09:01,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:09:01,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:09:01,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:09:01,386 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:09:01,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 14:09:01,612 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 14:09:01,612 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:09:01,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 14:09:01,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:09:01,656 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 14:09:01,657 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:09:01,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471994950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:09:01,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:09:01,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2024-11-13 14:09:01,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961873640] [2024-11-13 14:09:01,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:09:01,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:09:01,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:09:01,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:09:01,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:09:01,659 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:09:01,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:09:01,701 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2024-11-13 14:09:01,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:09:01,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-11-13 14:09:01,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:09:01,702 INFO L225 Difference]: With dead ends: 51 [2024-11-13 14:09:01,702 INFO L226 Difference]: Without dead ends: 37 [2024-11-13 14:09:01,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:09:01,703 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 12 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:09:01,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 52 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:09:01,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-13 14:09:01,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-11-13 14:09:01,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:09:01,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-13 14:09:01,712 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 37 [2024-11-13 14:09:01,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:09:01,712 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-13 14:09:01,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:09:01,712 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-13 14:09:01,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 14:09:01,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:09:01,713 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:09:01,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-13 14:09:01,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:09:01,914 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:09:01,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:09:01,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1788252288, now seen corresponding path program 1 times [2024-11-13 14:09:01,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:09:01,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059107384] [2024-11-13 14:09:01,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:09:01,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:09:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:03,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 14:09:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:03,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:09:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:03,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:09:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:03,724 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 14:09:03,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:09:03,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059107384] [2024-11-13 14:09:03,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059107384] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:09:03,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097886232] [2024-11-13 14:09:03,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:09:03,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:09:03,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:09:03,727 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:09:03,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 14:09:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:04,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 103 conjuncts are in the unsatisfiable core [2024-11-13 14:09:04,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:09:04,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:09:04,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 14:09:04,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 14:09:04,655 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-13 14:09:04,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-13 14:09:04,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 14:09:04,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 14:09:05,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 14:09:05,122 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-13 14:09:05,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 76 [2024-11-13 14:09:05,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2024-11-13 14:09:05,139 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 36 treesize of output 15 [2024-11-13 14:09:05,234 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 50 treesize of output 30 [2024-11-13 14:09:05,303 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-13 14:09:05,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 14:09:05,445 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 14:09:05,446 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:09:05,678 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1333 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (v_ArrVal_1331 (Array Int Int))) (or (not (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse0 (select v_ArrVal_1331 .cse0))) v_ArrVal_1331)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1331) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1332) .cse1) .cse2)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1333) .cse1) .cse2)))))) is different from false [2024-11-13 14:09:05,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:09:05,696 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 67 treesize of output 68 [2024-11-13 14:09:05,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:09:05,713 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 130 treesize of output 129 [2024-11-13 14:09:05,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:09:05,726 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 106 treesize of output 96 [2024-11-13 14:09:05,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:09:05,745 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 176 treesize of output 161 [2024-11-13 14:09:05,755 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 37 treesize of output 29 [2024-11-13 14:09:05,762 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 29 treesize of output 21 [2024-11-13 14:09:06,308 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) (.cse3 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse14))) (let ((.cse10 (not .cse3)) (.cse11 (forall ((v_ArrVal_1326 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_1331 (Array Int Int)) (v_arrayElimCell_37 Int)) (or (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1331 .cse1)) v_ArrVal_1331)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1331) v_arrayElimCell_36) v_arrayElimCell_37)))))) (let ((.cse2 (forall ((v_ArrVal_1326 (Array Int Int)) (v_arrayElimCell_35 Int) (v_ArrVal_1331 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1326))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1331 v_arrayElimCell_35)) (not (= (store (select .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1331 .cse1)) v_ArrVal_1331)) (forall ((v_arrayElimCell_36 Int) (v_arrayElimCell_37 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1331) v_arrayElimCell_36) v_arrayElimCell_37))))))) (.cse4 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse7 (or .cse3 (forall ((v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1331 (Array Int Int)) (v_arrayElimCell_33 Int)) (let ((.cse20 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1326))) (or (not (= (store (select .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1331 .cse1)) v_ArrVal_1331)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1331) v_arrayElimCell_33) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))))))) (.cse8 (or .cse3 (forall ((v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1331 (Array Int Int)) (v_arrayElimCell_35 Int) (v_arrayElimCell_33 Int)) (let ((.cse19 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1326))) (or (not (= (store (select .cse19 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1331 .cse1)) v_ArrVal_1331)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse19 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1331) v_arrayElimCell_33) v_arrayElimCell_35))))))) (.cse9 (forall ((v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1331 (Array Int Int)) (v_arrayElimCell_33 Int)) (let ((.cse17 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1326))) (let ((.cse18 (store .cse17 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1331))) (or (not (= (store (select .cse17 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1331 .cse1)) v_ArrVal_1331)) (forall ((v_arrayElimCell_36 Int) (v_arrayElimCell_37 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse18 v_arrayElimCell_36) v_arrayElimCell_37))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse18 v_arrayElimCell_33) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))))))) (.cse5 (or .cse10 .cse11)) (.cse12 (forall ((v_ArrVal_1326 (Array Int Int)) (v_arrayElimCell_35 Int) (v_ArrVal_1331 (Array Int Int)) (v_arrayElimCell_33 Int)) (let ((.cse15 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1326))) (let ((.cse16 (store .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1331))) (or (not (= (store (select .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1331 .cse1)) v_ArrVal_1331)) (forall ((v_arrayElimCell_36 Int) (v_arrayElimCell_37 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_arrayElimCell_36) v_arrayElimCell_37))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_arrayElimCell_33) v_arrayElimCell_35))))))) (.cse6 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| .cse14))) (and (forall ((v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1331 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1326))) (or (not (= (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1331 .cse1)) v_ArrVal_1331)) (forall ((v_arrayElimCell_36 Int) (v_arrayElimCell_37 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1331) v_arrayElimCell_36) v_arrayElimCell_37))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1331 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))))) (or (and .cse2 (or (forall ((v_ArrVal_1326 (Array Int Int)) (v_arrayElimCell_35 Int) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_2) v_arrayElimCell_35))) .cse3)) .cse4) (or (and .cse2 (or (forall ((v_ArrVal_1326 (Array Int Int)) (v_arrayElimCell_35 Int) (v_DerPreprocessor_3 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_3) v_arrayElimCell_35))) .cse3) .cse5) .cse6) (or (and .cse7 .cse8 .cse9 (or .cse10 .cse6 .cse11) .cse12) .cse4) (or .cse10 (forall ((v_ArrVal_1326 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_1331 (Array Int Int)) (v_arrayElimCell_37 Int)) (let ((.cse13 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1326))) (or (not (= (store (select .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1331 .cse1)) v_ArrVal_1331)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1331) v_arrayElimCell_36) v_arrayElimCell_37)))))) (or (and .cse7 .cse8 .cse9 .cse5 .cse12) .cse6) (or .cse3 (forall ((v_ArrVal_1326 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))))))))) is different from false [2024-11-13 14:09:06,996 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) (.cse3 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse16))) (let ((.cse5 (not .cse3)) (.cse12 (forall ((v_ArrVal_1326 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_1331 (Array Int Int)) (v_arrayElimCell_37 Int)) (or (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_1331 .cse2)) v_ArrVal_1331)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1331) v_arrayElimCell_36) v_arrayElimCell_37)))))) (let ((.cse1 (forall ((v_ArrVal_1326 (Array Int Int)) (v_arrayElimCell_35 Int) (v_ArrVal_1331 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1326))) (or (forall ((v_arrayElimCell_36 Int) (v_arrayElimCell_37 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1331) v_arrayElimCell_36) v_arrayElimCell_37))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1331 v_arrayElimCell_35)) (not (= v_ArrVal_1331 (store (select .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_1331 .cse2)))))))) (.cse6 (or .cse5 .cse12)) (.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_insert_~last~0#1.offset|)) (.cse8 (forall ((v_ArrVal_1326 (Array Int Int)) (v_arrayElimCell_35 Int) (v_ArrVal_1331 (Array Int Int)) (v_arrayElimCell_33 Int)) (let ((.cse20 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1326))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1331))) (or (forall ((v_arrayElimCell_36 Int) (v_arrayElimCell_37 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse19 v_arrayElimCell_36) v_arrayElimCell_37))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse19 v_arrayElimCell_33) v_arrayElimCell_35)) (not (= v_ArrVal_1331 (store (select .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_1331 .cse2))))))))) (.cse9 (forall ((v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1331 (Array Int Int)) (v_arrayElimCell_33 Int)) (let ((.cse18 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1326))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1331))) (or (forall ((v_arrayElimCell_36 Int) (v_arrayElimCell_37 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse17 v_arrayElimCell_36) v_arrayElimCell_37))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse17 v_arrayElimCell_33) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (not (= v_ArrVal_1331 (store (select .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_1331 .cse2))))))))) (.cse7 (= .cse16 |c_ULTIMATE.start_sll_insert_~last~0#1.base|)) (.cse10 (or .cse3 (forall ((v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1331 (Array Int Int)) (v_arrayElimCell_35 Int) (v_arrayElimCell_33 Int)) (let ((.cse15 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1326))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1331) v_arrayElimCell_33) v_arrayElimCell_35)) (not (= v_ArrVal_1331 (store (select .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_1331 .cse2))))))))) (.cse11 (or .cse3 (forall ((v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1331 (Array Int Int)) (v_arrayElimCell_33 Int)) (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1326))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1331) v_arrayElimCell_33) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (not (= v_ArrVal_1331 (store (select .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_1331 .cse2)))))))))) (and (or .cse0 (and .cse1 (or (forall ((v_ArrVal_1326 (Array Int Int)) (v_arrayElimCell_35 Int) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) v_arrayElimCell_35))) .cse3))) (or .cse3 (forall ((v_ArrVal_1326 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (or (forall ((v_ArrVal_1326 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_1331 (Array Int Int)) (v_arrayElimCell_37 Int)) (let ((.cse4 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1326))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1331) v_arrayElimCell_36) v_arrayElimCell_37)) (not (= v_ArrVal_1331 (store (select .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_1331 .cse2))))))) .cse5) (or (and .cse6 .cse1 (or .cse3 (forall ((v_ArrVal_1326 (Array Int Int)) (v_arrayElimCell_35 Int) (v_DerPreprocessor_3 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_3) v_arrayElimCell_35))))) .cse7) (or (and .cse8 .cse6 .cse9 .cse10 .cse11) .cse7) (or .cse0 (and .cse8 .cse9 (or .cse5 .cse12 .cse7) .cse10 .cse11)) (forall ((v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1331 (Array Int Int))) (let ((.cse13 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1326))) (or (forall ((v_arrayElimCell_36 Int) (v_arrayElimCell_37 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1331) v_arrayElimCell_36) v_arrayElimCell_37))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1331 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (not (= v_ArrVal_1331 (store (select .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_1331 .cse2)))))))))))) is different from false [2024-11-13 14:09:07,315 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse12 (+ 4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (.cse8 (= |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| .cse16))) (let ((.cse3 (not .cse8)) (.cse4 (forall ((v_ArrVal_1326 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_1331 (Array Int Int)) (v_arrayElimCell_37 Int)) (or (= (select (select (store (store |c_#memory_int#2| .cse9 v_ArrVal_1326) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1331) v_arrayElimCell_36) v_arrayElimCell_37) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse12 (select v_ArrVal_1331 .cse12)) v_ArrVal_1331)))))) (let ((.cse10 (or .cse3 .cse4)) (.cse0 (or (forall ((v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1331 (Array Int Int)) (v_arrayElimCell_35 Int) (v_arrayElimCell_33 Int)) (let ((.cse22 (store |c_#memory_int#2| .cse9 v_ArrVal_1326))) (or (= (select (select (store .cse22 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1331) v_arrayElimCell_33) v_arrayElimCell_35) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_1331 (store (select .cse22 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse12 (select v_ArrVal_1331 .cse12))))))) .cse8)) (.cse1 (forall ((v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1331 (Array Int Int)) (v_arrayElimCell_33 Int)) (let ((.cse21 (store |c_#memory_int#2| .cse9 v_ArrVal_1326))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1331))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 v_arrayElimCell_33) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (forall ((v_arrayElimCell_36 Int) (v_arrayElimCell_37 Int)) (= (select (select .cse20 v_arrayElimCell_36) v_arrayElimCell_37) |c_ULTIMATE.start_main_~data~0#1|)) (not (= v_ArrVal_1331 (store (select .cse21 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse12 (select v_ArrVal_1331 .cse12))))))))) (.cse2 (forall ((v_ArrVal_1326 (Array Int Int)) (v_arrayElimCell_35 Int) (v_ArrVal_1331 (Array Int Int)) (v_arrayElimCell_33 Int)) (let ((.cse19 (store |c_#memory_int#2| .cse9 v_ArrVal_1326))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1331))) (or (forall ((v_arrayElimCell_36 Int) (v_arrayElimCell_37 Int)) (= (select (select .cse18 v_arrayElimCell_36) v_arrayElimCell_37) |c_ULTIMATE.start_main_~data~0#1|)) (= (select (select .cse18 v_arrayElimCell_33) v_arrayElimCell_35) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_1331 (store (select .cse19 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse12 (select v_ArrVal_1331 .cse12))))))))) (.cse6 (or (forall ((v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1331 (Array Int Int)) (v_arrayElimCell_33 Int)) (let ((.cse17 (store |c_#memory_int#2| .cse9 v_ArrVal_1326))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse17 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1331) v_arrayElimCell_33) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (not (= v_ArrVal_1331 (store (select .cse17 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse12 (select v_ArrVal_1331 .cse12))))))) .cse8)) (.cse5 (= .cse16 .cse9)) (.cse11 (forall ((v_ArrVal_1326 (Array Int Int)) (v_arrayElimCell_35 Int) (v_ArrVal_1331 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#2| .cse9 v_ArrVal_1326))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1331 v_arrayElimCell_35)) (forall ((v_arrayElimCell_36 Int) (v_arrayElimCell_37 Int)) (= (select (select (store .cse15 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1331) v_arrayElimCell_36) v_arrayElimCell_37) |c_ULTIMATE.start_main_~data~0#1|)) (not (= v_ArrVal_1331 (store (select .cse15 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse12 (select v_ArrVal_1331 .cse12)))))))) (.cse7 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)))) (and (or (and .cse0 .cse1 .cse2 (or .cse3 .cse4 .cse5) .cse6) .cse7) (or .cse8 (forall ((v_ArrVal_1326 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| .cse9 v_ArrVal_1326) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)))) (or (and .cse10 .cse11 (or .cse8 (forall ((v_ArrVal_1326 (Array Int Int)) (v_arrayElimCell_35 Int) (v_DerPreprocessor_3 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| .cse9 v_ArrVal_1326) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse12 v_DerPreprocessor_3) v_arrayElimCell_35))))) .cse5) (or (and .cse10 .cse0 .cse1 .cse2 .cse6) .cse5) (forall ((v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1331 (Array Int Int))) (let ((.cse13 (store |c_#memory_int#2| .cse9 v_ArrVal_1326))) (or (forall ((v_arrayElimCell_36 Int) (v_arrayElimCell_37 Int)) (= (select (select (store .cse13 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1331) v_arrayElimCell_36) v_arrayElimCell_37) |c_ULTIMATE.start_main_~data~0#1|)) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1331 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (not (= v_ArrVal_1331 (store (select .cse13 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse12 (select v_ArrVal_1331 .cse12))))))) (or (and .cse11 (or (forall ((v_ArrVal_1326 (Array Int Int)) (v_arrayElimCell_35 Int) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| .cse9 v_ArrVal_1326) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse12 v_DerPreprocessor_2) v_arrayElimCell_35))) .cse8)) .cse7) (or .cse3 (forall ((v_ArrVal_1326 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_1331 (Array Int Int)) (v_arrayElimCell_37 Int)) (let ((.cse14 (store |c_#memory_int#2| .cse9 v_ArrVal_1326))) (or (= (select (select (store .cse14 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1331) v_arrayElimCell_36) v_arrayElimCell_37) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_1331 (store (select .cse14 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse12 (select v_ArrVal_1331 .cse12))))))))))))) is different from false [2024-11-13 14:09:11,352 INFO L349 Elim1Store]: treesize reduction 1615, result has 18.7 percent of original size [2024-11-13 14:09:11,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 21 new quantified variables, introduced 211 case distinctions, treesize of input 2499 treesize of output 2688 [2024-11-13 14:09:11,794 INFO L224 Elim1Store]: Index analysis took 212 ms [2024-11-13 14:09:15,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:09:15,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 2143 treesize of output 3593 [2024-11-13 14:09:17,265 INFO L349 Elim1Store]: treesize reduction 24, result has 61.9 percent of original size [2024-11-13 14:09:17,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1934 treesize of output 1964 [2024-11-13 14:09:18,034 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-13 14:09:18,036 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 1925 treesize of output 1938 [2024-11-13 14:09:19,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:09:19,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1918 treesize of output 1926 [2024-11-13 14:09:20,586 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 1913 treesize of output 1911 [2024-11-13 14:09:21,627 INFO L349 Elim1Store]: treesize reduction 20, result has 56.5 percent of original size [2024-11-13 14:09:21,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1911 treesize of output 1928 [2024-11-13 14:09:22,872 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 1904 treesize of output 1902 [2024-11-13 14:09:23,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 1902 treesize of output 1900 [2024-11-13 14:09:24,388 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-13 14:09:24,388 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 1900 treesize of output 1913 [2024-11-13 14:09:25,137 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-13 14:09:25,138 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 1893 treesize of output 1906 [2024-11-13 14:09:25,773 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 1896 treesize of output 1894 [2024-11-13 14:09:26,570 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-13 14:09:26,571 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 1894 treesize of output 1907 [2024-11-13 14:09:27,486 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-13 14:09:27,487 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 1887 treesize of output 1900 [2024-11-13 14:09:28,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 1890 treesize of output 1888 [2024-11-13 14:09:29,185 INFO L349 Elim1Store]: treesize reduction 24, result has 61.9 percent of original size [2024-11-13 14:09:29,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1888 treesize of output 1918 [2024-11-13 14:09:30,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 1879 treesize of output 1877 [2024-11-13 14:09:30,976 INFO L349 Elim1Store]: treesize reduction 20, result has 56.5 percent of original size [2024-11-13 14:09:30,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1877 treesize of output 1894 [2024-11-13 14:09:32,536 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-13 14:09:32,537 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 1870 treesize of output 1883 [2024-11-13 14:09:33,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:09:33,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1863 treesize of output 1871 [2024-11-13 14:13:21,065 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-13 14:13:21,065 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-13 14:13:21,066 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-13 14:13:21,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 14:13:21,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-13 14:13:21,267 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_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) 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.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:360) 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:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) 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:302) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) ... 68 more [2024-11-13 14:13:21,272 INFO L158 Benchmark]: Toolchain (without parser) took 327523.48ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 118.1MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 957.9MB. Max. memory is 16.1GB. [2024-11-13 14:13:21,273 INFO L158 Benchmark]: CDTParser took 1.64ms. Allocated memory is still 142.6MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:13:21,273 INFO L158 Benchmark]: CACSL2BoogieTranslator took 563.57ms. Allocated memory is still 142.6MB. Free memory was 118.1MB in the beginning and 100.2MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:13:21,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.15ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 98.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:13:21,273 INFO L158 Benchmark]: Boogie Preprocessor took 97.44ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 95.9MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:13:21,273 INFO L158 Benchmark]: RCFGBuilder took 579.48ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 79.9MB in the end (delta: 15.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:13:21,274 INFO L158 Benchmark]: TraceAbstraction took 326207.02ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 79.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 924.3MB. Max. memory is 16.1GB. [2024-11-13 14:13:21,275 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.64ms. Allocated memory is still 142.6MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 563.57ms. Allocated memory is still 142.6MB. Free memory was 118.1MB in the beginning and 100.2MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.15ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 98.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 97.44ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 95.9MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 579.48ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 79.9MB in the end (delta: 15.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 326207.02ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 79.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 924.3MB. 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_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/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_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/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_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd --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 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:13:23,746 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:13:23,886 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 14:13:23,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:13:23,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:13:23,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:13:23,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:13:23,945 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:13:23,945 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:13:23,945 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:13:23,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:13:23,946 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:13:23,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:13:23,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:13:23,948 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:13:23,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:13:23,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:13:23,948 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:13:23,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:13:23,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:13:23,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:13:23,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:13:23,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:13:23,950 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:13:23,950 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:13:23,950 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:13:23,950 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:13:23,950 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:13:23,950 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:13:23,950 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:13:23,951 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:13:23,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:13:23,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:13:23,951 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:13:23,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:13:23,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:13:23,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:13:23,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:13:23,953 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:13:23,953 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:13:23,953 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:13:23,953 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:13:23,953 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:13:23,954 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:13:23,954 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_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2024-11-13 14:13:24,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:13:24,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:13:24,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:13:24,280 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:13:24,280 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:13:24,282 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i Unable to find full path for "g++" [2024-11-13 14:13:26,187 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:13:26,461 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:13:26,462 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2024-11-13 14:13:26,484 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/data/c9f144b5d/5fda37d35d2945d78191559c077ef3b2/FLAGa1b9c3829 [2024-11-13 14:13:26,515 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/data/c9f144b5d/5fda37d35d2945d78191559c077ef3b2 [2024-11-13 14:13:26,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:13:26,520 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:13:26,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:13:26,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:13:26,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:13:26,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:13:26" (1/1) ... [2024-11-13 14:13:26,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e979eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:26, skipping insertion in model container [2024-11-13 14:13:26,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:13:26" (1/1) ... [2024-11-13 14:13:26,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:13:27,000 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_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2024-11-13 14:13:27,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:13:27,021 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:13:27,072 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_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2024-11-13 14:13:27,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:13:27,103 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:13:27,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:27 WrapperNode [2024-11-13 14:13:27,104 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:13:27,105 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:13:27,105 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:13:27,105 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:13:27,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:27" (1/1) ... [2024-11-13 14:13:27,138 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:27" (1/1) ... [2024-11-13 14:13:27,172 INFO L138 Inliner]: procedures = 130, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 118 [2024-11-13 14:13:27,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:13:27,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:13:27,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:13:27,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:13:27,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:27" (1/1) ... [2024-11-13 14:13:27,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:27" (1/1) ... [2024-11-13 14:13:27,187 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:27" (1/1) ... [2024-11-13 14:13:27,216 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 9, 5]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 6 writes are split as follows [0, 5, 1]. [2024-11-13 14:13:27,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:27" (1/1) ... [2024-11-13 14:13:27,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:27" (1/1) ... [2024-11-13 14:13:27,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:27" (1/1) ... [2024-11-13 14:13:27,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:27" (1/1) ... [2024-11-13 14:13:27,255 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:27" (1/1) ... [2024-11-13 14:13:27,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:27" (1/1) ... [2024-11-13 14:13:27,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:13:27,263 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:13:27,263 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:13:27,263 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:13:27,268 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:27" (1/1) ... [2024-11-13 14:13:27,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:13:27,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:13:27,303 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:13:27,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:13:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 14:13:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 14:13:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-13 14:13:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-13 14:13:27,339 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-13 14:13:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 14:13:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:13:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 14:13:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 14:13:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 14:13:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 14:13:27,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 14:13:27,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 14:13:27,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 14:13:27,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 14:13:27,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 14:13:27,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 14:13:27,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-13 14:13:27,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 14:13:27,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 14:13:27,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 14:13:27,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:13:27,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 14:13:27,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-13 14:13:27,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:13:27,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:13:27,535 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:13:27,539 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:13:27,940 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-13 14:13:27,940 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:13:27,949 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:13:27,949 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-13 14:13:27,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:13:27 BoogieIcfgContainer [2024-11-13 14:13:27,950 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:13:27,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:13:27,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:13:27,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:13:27,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:13:26" (1/3) ... [2024-11-13 14:13:27,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3b2596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:13:27, skipping insertion in model container [2024-11-13 14:13:27,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:13:27" (2/3) ... [2024-11-13 14:13:27,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3b2596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:13:27, skipping insertion in model container [2024-11-13 14:13:27,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:13:27" (3/3) ... [2024-11-13 14:13:27,961 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2024-11-13 14:13:27,977 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:13:27,978 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_insert_equal.i that has 2 procedures, 29 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2024-11-13 14:13:28,030 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:13:28,042 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;@774a1800, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:13:28,042 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:13:28,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:13:28,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 14:13:28,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:13:28,054 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:13:28,054 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:13:28,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:13:28,059 INFO L85 PathProgramCache]: Analyzing trace with hash -750718869, now seen corresponding path program 1 times [2024-11-13 14:13:28,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:13:28,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1295321735] [2024-11-13 14:13:28,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:13:28,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:13:28,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:13:28,075 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:13:28,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:13:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:13:28,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:13:28,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:13:28,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:13:28,411 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:13:28,413 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:13:28,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295321735] [2024-11-13 14:13:28,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295321735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:13:28,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:13:28,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:13:28,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852003369] [2024-11-13 14:13:28,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:13:28,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:13:28,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:13:28,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:13:28,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:13:28,452 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:13:28,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:13:28,519 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2024-11-13 14:13:28,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:13:28,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-13 14:13:28,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:13:28,528 INFO L225 Difference]: With dead ends: 55 [2024-11-13 14:13:28,529 INFO L226 Difference]: Without dead ends: 25 [2024-11-13 14:13:28,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:13:28,538 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 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-13 14:13:28,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:13:28,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-13 14:13:28,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-13 14:13:28,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:13:28,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-11-13 14:13:28,582 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 19 [2024-11-13 14:13:28,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:13:28,583 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-13 14:13:28,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:13:28,585 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2024-11-13 14:13:28,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 14:13:28,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:13:28,587 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:13:28,606 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:13:28,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:13:28,788 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:13:28,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:13:28,788 INFO L85 PathProgramCache]: Analyzing trace with hash -693460567, now seen corresponding path program 1 times [2024-11-13 14:13:28,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:13:28,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2115996332] [2024-11-13 14:13:28,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:13:28,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:13:28,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:13:28,792 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:13:28,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:13:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:13:29,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:13:29,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:13:29,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:13:29,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:13:29,084 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:13:29,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115996332] [2024-11-13 14:13:29,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115996332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:13:29,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:13:29,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:13:29,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411296839] [2024-11-13 14:13:29,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:13:29,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:13:29,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:13:29,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:13:29,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:13:29,090 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:13:29,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:13:29,130 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2024-11-13 14:13:29,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:13:29,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-13 14:13:29,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:13:29,132 INFO L225 Difference]: With dead ends: 48 [2024-11-13 14:13:29,132 INFO L226 Difference]: Without dead ends: 28 [2024-11-13 14:13:29,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:13:29,133 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 49 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-13 14:13:29,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 49 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:13:29,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-13 14:13:29,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-11-13 14:13:29,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:13:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-13 14:13:29,139 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 19 [2024-11-13 14:13:29,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:13:29,139 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-13 14:13:29,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:13:29,140 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-13 14:13:29,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 14:13:29,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:13:29,140 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:13:29,162 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 14:13:29,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:13:29,341 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:13:29,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:13:29,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1966062561, now seen corresponding path program 1 times [2024-11-13 14:13:29,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:13:29,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [66092459] [2024-11-13 14:13:29,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:13:29,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:13:29,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:13:29,345 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:13:29,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 14:13:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:13:29,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 14:13:29,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:13:29,588 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:13:29,588 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:13:29,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 14:13:29,707 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:13:29,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66092459] [2024-11-13 14:13:29,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66092459] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:13:29,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:13:29,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2024-11-13 14:13:29,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452340130] [2024-11-13 14:13:29,708 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:13:29,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:13:29,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:13:29,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:13:29,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:13:29,709 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:13:29,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:13:29,850 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2024-11-13 14:13:29,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:13:29,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2024-11-13 14:13:29,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:13:29,852 INFO L225 Difference]: With dead ends: 55 [2024-11-13 14:13:29,852 INFO L226 Difference]: Without dead ends: 35 [2024-11-13 14:13:29,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:13:29,853 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:13:29,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 96 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:13:29,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-13 14:13:29,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-13 14:13:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:13:29,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2024-11-13 14:13:29,863 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 27 [2024-11-13 14:13:29,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:13:29,863 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2024-11-13 14:13:29,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:13:29,864 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2024-11-13 14:13:29,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 14:13:29,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:13:29,865 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:13:29,888 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 14:13:30,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:13:30,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:13:30,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:13:30,066 INFO L85 PathProgramCache]: Analyzing trace with hash 552803865, now seen corresponding path program 2 times [2024-11-13 14:13:30,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:13:30,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2034626161] [2024-11-13 14:13:30,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:13:30,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:13:30,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:13:30,073 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:13:30,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 14:13:30,241 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 14:13:30,241 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:13:30,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-13 14:13:30,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:13:30,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 14:13:30,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 14:13:30,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 14:13:30,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2024-11-13 14:13:30,636 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 23 treesize of output 15 [2024-11-13 14:13:30,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 14:13:30,681 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-13 14:13:30,711 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 14:13:30,711 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:13:30,711 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:13:30,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034626161] [2024-11-13 14:13:30,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034626161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:13:30,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:13:30,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 14:13:30,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979558462] [2024-11-13 14:13:30,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:13:30,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 14:13:30,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:13:30,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 14:13:30,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:13:30,714 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:13:31,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:13:31,444 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2024-11-13 14:13:31,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 14:13:31,445 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2024-11-13 14:13:31,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:13:31,446 INFO L225 Difference]: With dead ends: 46 [2024-11-13 14:13:31,448 INFO L226 Difference]: Without dead ends: 44 [2024-11-13 14:13:31,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-13 14:13:31,449 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:13:31,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 135 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 14:13:31,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-13 14:13:31,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2024-11-13 14:13:31,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:13:31,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2024-11-13 14:13:31,468 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 35 [2024-11-13 14:13:31,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:13:31,469 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2024-11-13 14:13:31,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:13:31,470 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2024-11-13 14:13:31,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 14:13:31,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:13:31,471 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:13:31,488 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 14:13:31,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:13:31,675 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:13:31,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:13:31,676 INFO L85 PathProgramCache]: Analyzing trace with hash 552802191, now seen corresponding path program 1 times [2024-11-13 14:13:31,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:13:31,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1195613392] [2024-11-13 14:13:31,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:13:31,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:13:31,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:13:31,678 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:13:31,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 14:13:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:13:31,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 14:13:31,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:13:32,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 14:13:32,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-13 14:13:32,064 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 14:13:32,065 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:13:32,065 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:13:32,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195613392] [2024-11-13 14:13:32,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195613392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:13:32,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:13:32,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 14:13:32,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350986025] [2024-11-13 14:13:32,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:13:32,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:13:32,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:13:32,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:13:32,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:13:32,069 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:13:32,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:13:32,296 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2024-11-13 14:13:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:13:32,297 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2024-11-13 14:13:32,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:13:32,297 INFO L225 Difference]: With dead ends: 47 [2024-11-13 14:13:32,298 INFO L226 Difference]: Without dead ends: 44 [2024-11-13 14:13:32,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:13:32,299 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 13 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:13:32,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 134 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:13:32,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-13 14:13:32,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2024-11-13 14:13:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:13:32,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2024-11-13 14:13:32,316 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 35 [2024-11-13 14:13:32,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:13:32,317 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-11-13 14:13:32,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:13:32,317 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2024-11-13 14:13:32,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 14:13:32,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:13:32,318 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:13:32,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 14:13:32,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:13:32,519 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:13:32,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:13:32,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1254003739, now seen corresponding path program 1 times [2024-11-13 14:13:32,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:13:32,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [268574256] [2024-11-13 14:13:32,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:13:32,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:13:32,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:13:32,523 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:13:32,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 14:13:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:13:32,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-13 14:13:32,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:13:32,749 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-13 14:13:32,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 14:13:32,921 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-13 14:13:33,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 11 treesize of output 5 [2024-11-13 14:13:33,421 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-13 14:13:33,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-13 14:13:33,441 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-13 14:13:33,470 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-13 14:13:33,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-13 14:13:33,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-13 14:13:34,070 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-13 14:13:34,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 14:13:34,249 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-13 14:13:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 14:13:34,303 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:13:34,463 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_299) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-11-13 14:13:35,158 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_16| (_ BitVec 32)) (v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_297 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (store |c_#memory_int#1| .cse0 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_16| v_ArrVal_303) .cse0) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) v_ArrVal_297))) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_16| v_ArrVal_299) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_16|))))) is different from false [2024-11-13 14:13:35,162 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:13:35,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268574256] [2024-11-13 14:13:35,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268574256] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:13:35,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [880533617] [2024-11-13 14:13:35,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:13:35,162 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 14:13:35,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/cvc4 [2024-11-13 14:13:35,167 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 14:13:35,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-13 14:13:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:13:35,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-13 14:13:35,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:13:35,678 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-13 14:13:35,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 14:13:35,872 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-13 14:13:36,285 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 5 [2024-11-13 14:13:36,290 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 11 treesize of output 3 [2024-11-13 14:13:40,736 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-13 14:13:40,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-13 14:13:40,800 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-13 14:13:40,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-13 14:13:41,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-13 14:13:41,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-13 14:13:41,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 14:13:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 14:13:41,991 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:13:43,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [880533617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:13:43,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:13:43,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2024-11-13 14:13:43,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355890531] [2024-11-13 14:13:43,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:13:43,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-13 14:13:43,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:13:43,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-13 14:13:43,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1642, Unknown=97, NotChecked=170, Total=2070 [2024-11-13 14:13:43,415 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 34 states, 32 states have (on average 1.5) internal successors, (48), 28 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-13 14:13:46,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:13:46,184 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2024-11-13 14:13:46,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 14:13:46,185 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.5) internal successors, (48), 28 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2024-11-13 14:13:46,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:13:46,186 INFO L225 Difference]: With dead ends: 57 [2024-11-13 14:13:46,186 INFO L226 Difference]: Without dead ends: 55 [2024-11-13 14:13:46,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=204, Invalid=2257, Unknown=97, NotChecked=198, Total=2756 [2024-11-13 14:13:46,188 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 37 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:13:46,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 309 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-13 14:13:46,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-13 14:13:46,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2024-11-13 14:13:46,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:13:46,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2024-11-13 14:13:46,201 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 36 [2024-11-13 14:13:46,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:13:46,201 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2024-11-13 14:13:46,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.5) internal successors, (48), 28 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-13 14:13:46,202 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2024-11-13 14:13:46,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 14:13:46,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:13:46,203 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:13:46,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 14:13:46,409 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-13 14:13:46,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt [2024-11-13 14:13:46,606 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:13:46,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:13:46,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1254005413, now seen corresponding path program 1 times [2024-11-13 14:13:46,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:13:46,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [876117776] [2024-11-13 14:13:46,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:13:46,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:13:46,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:13:46,609 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:13:46,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 14:13:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:13:46,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:13:46,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:13:46,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-13 14:13:46,985 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 14:13:46,986 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:13:47,068 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 14:13:47,068 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:13:47,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876117776] [2024-11-13 14:13:47,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876117776] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:13:47,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:13:47,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2024-11-13 14:13:47,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861818724] [2024-11-13 14:13:47,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:13:47,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 14:13:47,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:13:47,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 14:13:47,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:13:47,070 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 14:13:47,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:13:47,679 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2024-11-13 14:13:47,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 14:13:47,680 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2024-11-13 14:13:47,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:13:47,683 INFO L225 Difference]: With dead ends: 59 [2024-11-13 14:13:47,683 INFO L226 Difference]: Without dead ends: 56 [2024-11-13 14:13:47,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:13:47,684 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 17 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:13:47,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 218 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 14:13:47,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-13 14:13:47,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2024-11-13 14:13:47,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:13:47,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2024-11-13 14:13:47,709 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 36 [2024-11-13 14:13:47,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:13:47,712 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2024-11-13 14:13:47,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 14:13:47,713 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2024-11-13 14:13:47,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 14:13:47,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:13:47,714 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:13:47,736 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 14:13:47,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:13:47,914 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:13:47,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:13:47,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1331395148, now seen corresponding path program 1 times [2024-11-13 14:13:47,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:13:47,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1130358664] [2024-11-13 14:13:47,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:13:47,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:13:47,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:13:47,918 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:13:47,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 14:13:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:13:48,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:13:48,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:13:48,139 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 14:13:48,139 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:13:48,139 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:13:48,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130358664] [2024-11-13 14:13:48,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130358664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:13:48,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:13:48,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:13:48,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026134251] [2024-11-13 14:13:48,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:13:48,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:13:48,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:13:48,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:13:48,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:13:48,141 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:13:48,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:13:48,196 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2024-11-13 14:13:48,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:13:48,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-11-13 14:13:48,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:13:48,198 INFO L225 Difference]: With dead ends: 58 [2024-11-13 14:13:48,198 INFO L226 Difference]: Without dead ends: 48 [2024-11-13 14:13:48,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:13:48,199 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:13:48,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 54 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:13:48,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-13 14:13:48,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2024-11-13 14:13:48,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:13:48,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2024-11-13 14:13:48,212 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 37 [2024-11-13 14:13:48,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:13:48,212 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-11-13 14:13:48,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:13:48,212 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-11-13 14:13:48,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 14:13:48,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:13:48,214 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:13:48,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-13 14:13:48,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:13:48,414 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:13:48,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:13:48,415 INFO L85 PathProgramCache]: Analyzing trace with hash 344542747, now seen corresponding path program 2 times [2024-11-13 14:13:48,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:13:48,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1470092227] [2024-11-13 14:13:48,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:13:48,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:13:48,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:13:48,417 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:13:48,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 14:13:48,637 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 14:13:48,637 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:13:48,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:13:48,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:13:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 14:13:48,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:13:48,823 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 14:13:48,823 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:13:48,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470092227] [2024-11-13 14:13:48,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470092227] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:13:48,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:13:48,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-13 14:13:48,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961589722] [2024-11-13 14:13:48,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:13:48,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:13:48,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:13:48,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:13:48,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:13:48,825 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 14:13:48,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:13:48,892 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2024-11-13 14:13:48,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:13:48,893 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 37 [2024-11-13 14:13:48,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:13:48,893 INFO L225 Difference]: With dead ends: 57 [2024-11-13 14:13:48,893 INFO L226 Difference]: Without dead ends: 43 [2024-11-13 14:13:48,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:13:48,894 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:13:48,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 104 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:13:48,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-13 14:13:48,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-11-13 14:13:48,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:13:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2024-11-13 14:13:48,906 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 37 [2024-11-13 14:13:48,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:13:48,906 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2024-11-13 14:13:48,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 14:13:48,906 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2024-11-13 14:13:48,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 14:13:48,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:13:48,907 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:13:48,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 14:13:49,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:13:49,108 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:13:49,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:13:49,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1788252288, now seen corresponding path program 1 times [2024-11-13 14:13:49,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:13:49,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2112903178] [2024-11-13 14:13:49,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:13:49,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:13:49,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:13:49,112 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:13:49,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbdc449f-988b-4182-a4be-f7a3bd5ae58c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 14:13:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:13:49,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-13 14:13:49,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:13:49,304 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-13 14:13:49,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 11 treesize of output 5 [2024-11-13 14:13:49,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 14:13:49,746 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-13 14:13:49,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-13 14:13:50,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 14:13:50,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 14:13:50,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 14:13:50,300 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-13 14:13:50,300 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 119 treesize of output 76 [2024-11-13 14:13:50,306 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 36 treesize of output 15 [2024-11-13 14:13:50,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2024-11-13 14:13:50,420 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 50 treesize of output 30 [2024-11-13 14:13:50,530 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-13 14:13:50,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 14:13:50,660 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-13 14:13:50,710 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 14:13:50,711 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:13:51,019 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_635 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_633 (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse0 (select v_ArrVal_633 .cse0))))) (= (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_633) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_635) .cse1) .cse2)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_634) .cse1) .cse2))) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2024-11-13 14:13:51,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:13:51,053 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 67 treesize of output 68 [2024-11-13 14:13:51,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:13:51,117 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 130 treesize of output 129 [2024-11-13 14:13:51,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:13:51,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 96 [2024-11-13 14:13:51,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:13:51,181 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 176 treesize of output 161 [2024-11-13 14:13:51,195 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 37 treesize of output 29 [2024-11-13 14:13:51,207 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 29 treesize of output 21 [2024-11-13 14:13:52,162 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (.cse9 (= .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|))) (let ((.cse12 (not .cse9)) (.cse13 (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32)) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_633 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse11 (select v_ArrVal_633 .cse11)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_633) v_arrayElimCell_41) v_arrayElimCell_42) |c_ULTIMATE.start_main_~data~0#1|))))) (let ((.cse3 (or .cse12 .cse13)) (.cse6 (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_632))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse22 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_633) v_arrayElimCell_38) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (not (= v_ArrVal_633 (store (select .cse22 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse11 (select v_ArrVal_633 .cse11))))))) .cse9)) (.cse7 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_632))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_633))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 v_arrayElimCell_38) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (not (= v_ArrVal_633 (store (select .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse11 (select v_ArrVal_633 .cse11)))) (forall ((v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (= (select (select .cse20 v_arrayElimCell_41) v_arrayElimCell_42) |c_ULTIMATE.start_main_~data~0#1|))))))) (.cse8 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|)) (.cse0 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_40 (_ BitVec 32)) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_632))) (let ((.cse19 (store .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_633))) (or (not (= v_ArrVal_633 (store (select .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse11 (select v_ArrVal_633 .cse11)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse19 v_arrayElimCell_38) v_arrayElimCell_40)) (forall ((v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (= (select (select .cse19 v_arrayElimCell_41) v_arrayElimCell_42) |c_ULTIMATE.start_main_~data~0#1|))))))) (.cse1 (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_40 (_ BitVec 32)) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_632))) (or (not (= v_ArrVal_633 (store (select .cse17 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse11 (select v_ArrVal_633 .cse11)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse17 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_633) v_arrayElimCell_38) v_arrayElimCell_40))))) .cse9)) (.cse2 (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_40 (_ BitVec 32)) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_632))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_633 v_arrayElimCell_40)) (not (= v_ArrVal_633 (store (select .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse11 (select v_ArrVal_633 .cse11)))) (forall ((v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (= (select (select (store .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_633) v_arrayElimCell_41) v_arrayElimCell_42) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse5 (= .cse15 |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|)) (.cse4 (or .cse9 (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_arrayElimCell_40 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse11 v_DerPreprocessor_1) v_arrayElimCell_40)))))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4) .cse5) (or (and .cse6 .cse7 .cse3) .cse5) (or .cse8 (and .cse6 .cse7)) (or .cse9 (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_632))) (or (not (= v_ArrVal_633 (store (select .cse10 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse11 (select v_ArrVal_633 .cse11)))) (= (select v_ArrVal_633 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (= (select (select (store .cse10 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_633) v_arrayElimCell_41) v_arrayElimCell_42) |c_ULTIMATE.start_main_~data~0#1|))))) (or .cse8 (and .cse0 .cse1 .cse2 (or .cse12 .cse13 .cse5) .cse4)) (or .cse12 (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32)) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_632))) (or (not (= v_ArrVal_633 (store (select .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse11 (select v_ArrVal_633 .cse11)))) (= (select (select (store .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_633) v_arrayElimCell_41) v_arrayElimCell_42) |c_ULTIMATE.start_main_~data~0#1|)))))))))) is different from false [2024-11-13 14:13:53,333 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse14 (= .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))) (let ((.cse13 (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32)) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_633 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_633 .cse1)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_633) v_arrayElimCell_41) v_arrayElimCell_42) |c_ULTIMATE.start_main_~data~0#1|)))) (.cse12 (not .cse14))) (let ((.cse4 (= |c_ULTIMATE.start_sll_insert_~last~0#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse5 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_40 (_ BitVec 32)) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_632))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_633))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse21 v_arrayElimCell_38) v_arrayElimCell_40)) (not (= v_ArrVal_633 (store (select .cse22 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_633 .cse1)))) (forall ((v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (= (select (select .cse21 v_arrayElimCell_41) v_arrayElimCell_42) |c_ULTIMATE.start_main_~data~0#1|))))))) (.cse6 (or .cse14 (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_arrayElimCell_40 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_1) v_arrayElimCell_40))))) (.cse7 (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_40 (_ BitVec 32)) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_632))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_633) v_arrayElimCell_38) v_arrayElimCell_40)) (not (= v_ArrVal_633 (store (select .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_633 .cse1))))))) .cse14)) (.cse9 (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_40 (_ BitVec 32)) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_632))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_633 v_arrayElimCell_40)) (not (= v_ArrVal_633 (store (select .cse19 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_633 .cse1)))) (forall ((v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (= (select (select (store .cse19 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_633) v_arrayElimCell_41) v_arrayElimCell_42) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse10 (= .cse18 |c_ULTIMATE.start_sll_insert_~last~0#1.base|)) (.cse2 (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_632))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse17 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_633) v_arrayElimCell_38) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (not (= v_ArrVal_633 (store (select .cse17 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_633 .cse1))))))) .cse14)) (.cse3 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_632))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_633))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 v_arrayElimCell_38) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (not (= v_ArrVal_633 (store (select .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_633 .cse1)))) (forall ((v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (= (select (select .cse15 v_arrayElimCell_41) v_arrayElimCell_42) |c_ULTIMATE.start_main_~data~0#1|))))))) (.cse8 (or .cse13 .cse12))) (and (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_632))) (or (= (select v_ArrVal_633 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_633 (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_633 .cse1)))) (forall ((v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (= (select (select (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_633) v_arrayElimCell_41) v_arrayElimCell_42) |c_ULTIMATE.start_main_~data~0#1|))))) (or (and .cse2 .cse3) .cse4) (or (and .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (or (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32)) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_632))) (or (not (= v_ArrVal_633 (store (select .cse11 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_633 .cse1)))) (= (select (select (store .cse11 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_633) v_arrayElimCell_41) v_arrayElimCell_42) |c_ULTIMATE.start_main_~data~0#1|)))) .cse12) (or .cse4 (and .cse5 .cse6 .cse7 (or .cse13 .cse12 .cse10) .cse9)) (or .cse10 (and .cse2 .cse3 .cse8)) (or (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|)) .cse14)))))) is different from false [2024-11-13 14:13:54,630 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse19 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse10 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (.cse6 (= |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| .cse19))) (let ((.cse8 (not .cse6)) (.cse14 (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32)) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse7 v_ArrVal_632) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_633) v_arrayElimCell_41) v_arrayElimCell_42)) (not (= v_ArrVal_633 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse10 (select v_ArrVal_633 .cse10)))))))) (let ((.cse1 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_40 (_ BitVec 32)) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_int#1| .cse7 v_ArrVal_632))) (let ((.cse22 (store .cse23 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_633))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse22 v_arrayElimCell_38) v_arrayElimCell_40)) (not (= v_ArrVal_633 (store (select .cse23 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse10 (select v_ArrVal_633 .cse10)))) (forall ((v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse22 v_arrayElimCell_41) v_arrayElimCell_42)))))))) (.cse2 (or .cse6 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_40 (_ BitVec 32)) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_int#1| .cse7 v_ArrVal_632))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse21 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_633) v_arrayElimCell_38) v_arrayElimCell_40)) (not (= v_ArrVal_633 (store (select .cse21 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse10 (select v_ArrVal_633 .cse10))))))))) (.cse3 (or (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_arrayElimCell_40 (_ BitVec 32))) (= (select (store (select (store |c_#memory_int#1| .cse7 v_ArrVal_632) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse10 v_DerPreprocessor_1) v_arrayElimCell_40) |c_ULTIMATE.start_main_~data~0#1|)) .cse6)) (.cse5 (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_40 (_ BitVec 32)) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_int#1| .cse7 v_ArrVal_632))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_633 v_arrayElimCell_40)) (not (= v_ArrVal_633 (store (select .cse20 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse10 (select v_ArrVal_633 .cse10)))) (forall ((v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse20 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_633) v_arrayElimCell_41) v_arrayElimCell_42))))))) (.cse13 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (.cse0 (= .cse19 .cse7)) (.cse11 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_int#1| .cse7 v_ArrVal_632))) (let ((.cse18 (store .cse17 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_633))) (or (not (= v_ArrVal_633 (store (select .cse17 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse10 (select v_ArrVal_633 .cse10)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse18 v_arrayElimCell_38) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (forall ((v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse18 v_arrayElimCell_41) v_arrayElimCell_42)))))))) (.cse12 (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_int#1| .cse7 v_ArrVal_632))) (or (not (= v_ArrVal_633 (store (select .cse16 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse10 (select v_ArrVal_633 .cse10)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse16 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_633) v_arrayElimCell_38) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|))))) .cse6)) (.cse4 (or .cse8 .cse14))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5)) (or .cse6 (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#1| .cse7 v_ArrVal_632) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|) |c_ULTIMATE.start_main_~data~0#1|))) (or .cse8 (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32)) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_int#1| .cse7 v_ArrVal_632))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse9 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_633) v_arrayElimCell_41) v_arrayElimCell_42)) (not (= v_ArrVal_633 (store (select .cse9 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse10 (select v_ArrVal_633 .cse10)))))))) (or (and .cse11 .cse12) .cse13) (or (and .cse1 .cse2 .cse3 .cse5 (or .cse0 .cse8 .cse14)) .cse13) (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_int#1| .cse7 v_ArrVal_632))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_633 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (not (= v_ArrVal_633 (store (select .cse15 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse10 (select v_ArrVal_633 .cse10)))) (forall ((v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse15 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_633) v_arrayElimCell_41) v_arrayElimCell_42)))))) (or .cse0 (and .cse11 .cse12 .cse4))))))) is different from false [2024-11-13 14:20:45,380 WARN L286 SmtUtils]: Spent 6.84m on a formula simplification. DAG size of input: 960 DAG size of output: 219 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 14:20:45,381 INFO L349 Elim1Store]: treesize reduction 1615, result has 18.7 percent of original size [2024-11-13 14:20:45,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 21 new quantified variables, introduced 211 case distinctions, treesize of input 2413 treesize of output 2604 [2024-11-13 14:20:47,213 INFO L224 Elim1Store]: Index analysis took 1558 ms [2024-11-13 14:21:11,528 WARN L286 SmtUtils]: Spent 24.31s on a formula simplification that was a NOOP. DAG size: 801 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 14:21:11,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:21:11,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 2135 treesize of output 3585 [2024-11-13 14:21:15,460 INFO L349 Elim1Store]: treesize reduction 24, result has 61.9 percent of original size [2024-11-13 14:21:15,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1926 treesize of output 1956 [2024-11-13 14:21:17,029 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-13 14:21:17,030 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 1917 treesize of output 1930 [2024-11-13 14:21:17,907 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 1920 treesize of output 1918 [2024-11-13 14:21:18,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 1918 treesize of output 1916 [2024-11-13 14:21:20,151 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-13 14:21:20,152 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 1916 treesize of output 1929 [2024-11-13 14:21:21,895 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-13 14:21:21,896 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 1909 treesize of output 1922 [2024-11-13 14:21:23,496 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-13 14:21:23,497 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 1902 treesize of output 1915 [2024-11-13 14:21:25,691 INFO L349 Elim1Store]: treesize reduction 20, result has 56.5 percent of original size [2024-11-13 14:21:25,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1895 treesize of output 1912 [2024-11-13 14:21:27,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:21:27,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1888 treesize of output 1896 [2024-11-13 14:21:29,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1883 treesize of output 1881 [2024-11-13 14:21:30,278 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 1881 treesize of output 1879 [2024-11-13 14:21:32,876 INFO L349 Elim1Store]: treesize reduction 24, result has 61.9 percent of original size [2024-11-13 14:21:32,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1879 treesize of output 1909 [2024-11-13 14:21:34,713 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-13 14:21:34,715 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 1870 treesize of output 1883 [2024-11-13 14:21:35,858 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 1863 treesize of output 1861 [2024-11-13 14:21:37,570 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-13 14:21:37,571 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 1861 treesize of output 1874 [2024-11-13 14:21:39,276 INFO L349 Elim1Store]: treesize reduction 20, result has 56.5 percent of original size [2024-11-13 14:21:39,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1854 treesize of output 1871 [2024-11-13 14:21:40,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:21:40,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1847 treesize of output 1855 [2024-11-13 14:21:42,568 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 1852 treesize of output 1850