./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.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_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 02:41:59,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 02:41:59,172 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 02:41:59,177 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 02:41:59,177 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 02:41:59,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 02:41:59,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 02:41:59,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 02:41:59,200 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 02:41:59,200 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 02:41:59,201 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 02:41:59,201 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 02:41:59,201 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 02:41:59,201 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 02:41:59,201 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 02:41:59,201 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 02:41:59,201 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 02:41:59,201 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 02:41:59,201 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 02:41:59,202 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 02:41:59,202 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 02:41:59,202 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 02:41:59,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 02:41:59,202 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 02:41:59,202 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 02:41:59,203 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 02:41:59,203 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 02:41:59,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 02:41:59,203 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 02:41:59,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 02:41:59,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 02:41:59,203 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 02:41:59,203 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 02:41:59,203 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 02:41:59,203 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 02:41:59,203 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 02:41:59,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 02:41:59,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 02:41:59,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 02:41:59,204 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 02:41:59,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 02:41:59,204 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 02:41:59,204 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 02:41:59,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 02:41:59,204 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 02:41:59,204 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 02:41:59,205 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 02:41:59,205 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E 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 -> Taipan 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 -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2024-11-14 02:41:59,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 02:41:59,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 02:41:59,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 02:41:59,571 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 02:41:59,571 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 02:41:59,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i Unable to find full path for "g++" [2024-11-14 02:42:01,992 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 02:42:02,388 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 02:42:02,389 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2024-11-14 02:42:02,405 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/data/05c6336d5/badacb202eca44eba0d5c690a90f843a/FLAGaa1785261 [2024-11-14 02:42:02,427 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/data/05c6336d5/badacb202eca44eba0d5c690a90f843a [2024-11-14 02:42:02,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 02:42:02,433 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 02:42:02,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 02:42:02,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 02:42:02,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 02:42:02,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:42:02" (1/1) ... [2024-11-14 02:42:02,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f21dccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:02, skipping insertion in model container [2024-11-14 02:42:02,444 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:42:02" (1/1) ... [2024-11-14 02:42:02,488 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 02:42:02,911 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_e07abd3f-8ce1-434c-b985-9cff1abfb155/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2024-11-14 02:42:02,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 02:42:02,924 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 02:42:03,002 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_e07abd3f-8ce1-434c-b985-9cff1abfb155/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2024-11-14 02:42:03,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 02:42:03,039 INFO L204 MainTranslator]: Completed translation [2024-11-14 02:42:03,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:03 WrapperNode [2024-11-14 02:42:03,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 02:42:03,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 02:42:03,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 02:42:03,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 02:42:03,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:03" (1/1) ... [2024-11-14 02:42:03,066 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:03" (1/1) ... [2024-11-14 02:42:03,100 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 156 [2024-11-14 02:42:03,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 02:42:03,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 02:42:03,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 02:42:03,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 02:42:03,111 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:03" (1/1) ... [2024-11-14 02:42:03,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:03" (1/1) ... [2024-11-14 02:42:03,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:03" (1/1) ... [2024-11-14 02:42:03,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:03" (1/1) ... [2024-11-14 02:42:03,137 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:03" (1/1) ... [2024-11-14 02:42:03,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:03" (1/1) ... [2024-11-14 02:42:03,150 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:03" (1/1) ... [2024-11-14 02:42:03,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:03" (1/1) ... [2024-11-14 02:42:03,160 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 02:42:03,161 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 02:42:03,161 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 02:42:03,161 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 02:42:03,162 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:03" (1/1) ... [2024-11-14 02:42:03,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 02:42:03,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:42:03,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 02:42:03,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 02:42:03,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 02:42:03,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 02:42:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-14 02:42:03,244 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-14 02:42:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 02:42:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 02:42:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 02:42:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 02:42:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 02:42:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 02:42:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 02:42:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 02:42:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 02:42:03,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 02:42:03,410 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 02:42:03,412 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 02:42:03,692 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-14 02:42:03,692 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 02:42:03,736 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 02:42:03,736 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-14 02:42:03,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:42:03 BoogieIcfgContainer [2024-11-14 02:42:03,737 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 02:42:03,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 02:42:03,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 02:42:03,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 02:42:03,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 02:42:02" (1/3) ... [2024-11-14 02:42:03,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a05c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:42:03, skipping insertion in model container [2024-11-14 02:42:03,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:03" (2/3) ... [2024-11-14 02:42:03,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a05c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:42:03, skipping insertion in model container [2024-11-14 02:42:03,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:42:03" (3/3) ... [2024-11-14 02:42:03,752 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2024-11-14 02:42:03,771 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 02:42:03,773 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_append_unequal.i that has 2 procedures, 32 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2024-11-14 02:42:03,838 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 02:42:03,857 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=FINITE_AUTOMATA, 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;@6c89cf87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 02:42:03,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 02:42:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 27 states have internal predecessors, (41), 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-14 02:42:03,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 02:42:03,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:42:03,870 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:42:03,871 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:42:03,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:42:03,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1332761823, now seen corresponding path program 1 times [2024-11-14 02:42:03,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:42:03,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709377688] [2024-11-14 02:42:03,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:42:03,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:42:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:42:04,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 02:42:04,374 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:42:04,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709377688] [2024-11-14 02:42:04,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709377688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:42:04,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:42:04,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 02:42:04,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137029739] [2024-11-14 02:42:04,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:42:04,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 02:42:04,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:42:04,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 02:42:04,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 02:42:04,403 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 27 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 02:42:04,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:42:04,448 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2024-11-14 02:42:04,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 02:42:04,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 18 [2024-11-14 02:42:04,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:42:04,456 INFO L225 Difference]: With dead ends: 61 [2024-11-14 02:42:04,456 INFO L226 Difference]: Without dead ends: 29 [2024-11-14 02:42:04,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 02:42:04,463 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 02:42:04,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 02:42:04,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-14 02:42:04,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-11-14 02:42:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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-14 02:42:04,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-14 02:42:04,512 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2024-11-14 02:42:04,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:42:04,512 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-14 02:42:04,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 02:42:04,513 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-14 02:42:04,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 02:42:04,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:42:04,514 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:42:04,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 02:42:04,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:42:04,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:42:04,515 INFO L85 PathProgramCache]: Analyzing trace with hash 906853239, now seen corresponding path program 1 times [2024-11-14 02:42:04,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:42:04,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283532886] [2024-11-14 02:42:04,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:42:04,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:42:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:42:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 02:42:05,339 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:42:05,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283532886] [2024-11-14 02:42:05,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283532886] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:42:05,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326282764] [2024-11-14 02:42:05,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:42:05,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:42:05,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:42:05,344 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:42:05,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 02:42:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:42:05,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 02:42:05,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:42:05,737 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 8 treesize of output 4 [2024-11-14 02:42:05,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:42:05,838 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 17 treesize of output 12 [2024-11-14 02:42:05,901 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-14 02:42:05,905 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 02:42:05,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:42:06,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326282764] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:42:06,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2068992204] [2024-11-14 02:42:06,098 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-14 02:42:06,098 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:42:06,102 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:42:06,106 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:42:06,107 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:42:08,424 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2024-11-14 02:42:08,437 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 02:42:45,258 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '273#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~last~2#1.offset|) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~last~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |ULTIMATE.start_main_~uneq~0#1| 5) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_14| Int) (|v_#memory_$Pointer$.base_60| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_57| (Array Int (Array Int Int))) (|v_#memory_int_26| (Array Int (Array Int Int))) (|v_#memory_int_71| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_57| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.offset_57| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_14| (store (select (store |v_#memory_$Pointer$.offset_57| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.offset_57| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0 0))) (= |#memory_int| (store |v_#memory_int_26| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14| (store (select |v_#memory_int_26| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.base_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0))) |v_ULTIMATE.start_sll_circular_append_~head#1.base_14| (store (select (store |v_#memory_$Pointer$.base_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.base_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0))) |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)))) (or (and (exists ((|v_#memory_int_43| (Array Int (Array Int Int))) (|v_#memory_int_67| (Array Int (Array Int Int)))) (and (= |v_#memory_int_43| (store |v_#memory_int_67| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_int_67| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 (select (select |v_#memory_int_43| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0)))) (= |v_#memory_int_71| (store |v_#memory_int_43| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_int_43| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 4 5))))) (exists ((|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_57| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 4))) |v_#memory_$Pointer$.offset_57|)) (exists ((|v_#memory_$Pointer$.offset_56| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_12| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| Int) (|v_#memory_int_70| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_12| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_59| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_56| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.offset_56| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.base_59| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.base_59| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_12| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_12|) (= |v_old(#memory_int)_AFTER_CALL_12| (store |v_#memory_int_70| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_int_70| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_12| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0)))))) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#length_21| (Array Int Int))) (= |#length| (store |v_#length_21| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 8))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 0)) (exists ((|v_#valid_33| (Array Int Int))) (and (= |#valid| (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 1)) (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0))) (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_14| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_56| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.base_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 4))) |v_#memory_$Pointer$.base_60|))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_13| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_56| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_13| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| Int) (|v_#memory_int_70| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_59| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_13| (store |v_#memory_int_70| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_int_70| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_13| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0)))) (= (select (select (store |v_#memory_$Pointer$.offset_56| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.offset_56| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_13| (store |v_#memory_$Pointer$.base_59| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.base_59| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_13| |ULTIMATE.start_main_~#s~0#1.base|) 0)))))) (exists ((|v_#memory_int_43| (Array Int (Array Int Int))) (|v_#memory_int_67| (Array Int (Array Int Int)))) (and (= |v_#memory_int_43| (store |v_#memory_int_67| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_int_67| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 (select (select |v_#memory_int_43| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0)))) (= |v_#memory_int_71| (store |v_#memory_int_43| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_int_43| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 4 5))))) (exists ((|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_57| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 4))) |v_#memory_$Pointer$.offset_57|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#length_21| (Array Int Int))) (= |#length| (store |v_#length_21| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 8))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 0)) (exists ((|v_#valid_33| (Array Int Int))) (and (= |#valid| (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 1)) (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0))) (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_14| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_56| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.base_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 4))) |v_#memory_$Pointer$.base_60|)))) (= (select (select |v_#memory_$Pointer$.offset_57| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 0) (= |v_#memory_int_26| (store |v_#memory_int_71| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_int_71| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 (select (select |v_#memory_int_26| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0)))) (= 0 (select (select |v_#memory_$Pointer$.base_60| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)))) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 02:42:45,258 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 02:42:45,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 02:42:45,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2024-11-14 02:42:45,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251295124] [2024-11-14 02:42:45,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 02:42:45,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 02:42:45,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:42:45,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 02:42:45,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1020, Unknown=15, NotChecked=0, Total=1122 [2024-11-14 02:42:45,264 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 16 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 02:42:45,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:42:45,956 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2024-11-14 02:42:45,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 02:42:45,957 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2024-11-14 02:42:45,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:42:45,958 INFO L225 Difference]: With dead ends: 40 [2024-11-14 02:42:45,958 INFO L226 Difference]: Without dead ends: 29 [2024-11-14 02:42:45,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 37.5s TimeCoverageRelationStatistics Valid=119, Invalid=1348, Unknown=15, NotChecked=0, Total=1482 [2024-11-14 02:42:45,960 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 02:42:45,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 199 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 02:42:45,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-14 02:42:45,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-11-14 02:42:45,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 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-14 02:42:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-14 02:42:45,966 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 25 [2024-11-14 02:42:45,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:42:45,968 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-14 02:42:45,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 02:42:45,968 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-14 02:42:45,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 02:42:45,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:42:45,970 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:42:45,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 02:42:46,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:42:46,172 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:42:46,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:42:46,173 INFO L85 PathProgramCache]: Analyzing trace with hash -545688008, now seen corresponding path program 1 times [2024-11-14 02:42:46,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:42:46,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587050236] [2024-11-14 02:42:46,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:42:46,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:42:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:42:47,586 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:42:47,587 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:42:47,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587050236] [2024-11-14 02:42:47,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587050236] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:42:47,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474651989] [2024-11-14 02:42:47,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:42:47,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:42:47,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:42:47,589 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:42:47,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 02:42:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:42:47,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-14 02:42:47,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:42:47,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 02:42:47,986 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 02:42:47,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 02:42:48,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 02:42:48,187 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-11-14 02:42:48,188 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 70 treesize of output 57 [2024-11-14 02:42:48,295 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-14 02:42:48,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 23 [2024-11-14 02:42:48,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 02:42:48,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:42:48,407 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 02:42:48,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 53 [2024-11-14 02:42:48,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:42:48,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2024-11-14 02:42:48,458 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-11-14 02:42:48,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-14 02:42:49,029 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 02:42:49,030 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 53 treesize of output 51 [2024-11-14 02:42:49,157 INFO L349 Elim1Store]: treesize reduction 116, result has 38.9 percent of original size [2024-11-14 02:42:49,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 88 treesize of output 115 [2024-11-14 02:42:49,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:42:49,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 51 [2024-11-14 02:42:49,258 INFO L349 Elim1Store]: treesize reduction 74, result has 21.3 percent of original size [2024-11-14 02:42:49,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 127 [2024-11-14 02:42:49,296 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-14 02:42:49,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-14 02:42:49,790 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 02:42:49,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 19 [2024-11-14 02:42:49,835 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:42:49,835 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:42:50,021 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_304 Int)) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_309))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_304)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2024-11-14 02:42:52,428 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16| Int) (|ULTIMATE.start_sll_circular_append_~head#1.offset| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int)) (let ((.cse0 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16|))) (or (< (select .cse0 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse1) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_304 Int)) (not (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16| (store .cse0 |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_309))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse2 .cse3) (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_304)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3)))))))) (< .cse1 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16|)))) is different from false [2024-11-14 02:42:52,787 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16| Int) (v_ArrVal_306 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (v_ArrVal_309 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_304 Int)) (let ((.cse0 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (< (select .cse0 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse1) (not (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16| (store .cse0 |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_309))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse2 .cse3) (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_304)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3)))) (< .cse1 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16|)))) is different from false [2024-11-14 02:42:53,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474651989] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:42:53,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1749896077] [2024-11-14 02:42:53,072 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-14 02:42:53,072 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:42:53,072 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:42:53,072 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:42:53,072 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:42:54,226 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2024-11-14 02:42:54,240 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 02:43:28,361 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '548#(and (exists ((|v_#memory_$Pointer$.offset_72| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_77| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_16| Int) (|v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16| Int) (|v_#memory_int_27| (Array Int (Array Int Int))) (|v_#memory_int_90| (Array Int (Array Int Int)))) (and (or (and (exists ((|v_#memory_int_86| (Array Int (Array Int Int))) (|v_#memory_int_43| (Array Int (Array Int Int)))) (and (= |v_#memory_int_43| (store |v_#memory_int_86| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16| (store (select |v_#memory_int_86| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16|) 0 (select (select |v_#memory_int_43| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16|) 0)))) (= (store |v_#memory_int_43| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16| (store (select |v_#memory_int_43| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16|) 4 5)) |v_#memory_int_90|))) (<= (+ |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16| (store (store (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16|) 0 0) 4 (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16|) 4))) |v_#memory_$Pointer$.base_77|)) (exists ((|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16| (store (store (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16|) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16|) 4))) |v_#memory_$Pointer$.offset_72|)) (exists ((|v_#valid_44| (Array Int Int))) (and (= |#valid| (store |v_#valid_44| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16| 1)) (= (select |v_#valid_44| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16|) 0))) (not (= |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16| 0)) (exists ((|v_old(#memory_int)_AFTER_CALL_26| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_76| (Array Int (Array Int Int))) (|v_#memory_int_89| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_26| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int) (|v_#memory_$Pointer$.offset_71| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_26| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_26|) (= (select (select (store |v_#memory_$Pointer$.offset_71| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_71| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_26| (store |v_#memory_int_89| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_89| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_26| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0)))))) (exists ((|v_#length_28| (Array Int Int))) (= (store |v_#length_28| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16| 8) |#length|)) (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_16| |ULTIMATE.start_main_~#s~0#1.base|)) (and (exists ((|v_#memory_int_86| (Array Int (Array Int Int))) (|v_#memory_int_43| (Array Int (Array Int Int)))) (and (= |v_#memory_int_43| (store |v_#memory_int_86| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16| (store (select |v_#memory_int_86| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16|) 0 (select (select |v_#memory_int_43| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16|) 0)))) (= (store |v_#memory_int_43| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16| (store (select |v_#memory_int_43| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16|) 4 5)) |v_#memory_int_90|))) (<= (+ |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16| (store (store (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16|) 0 0) 4 (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16|) 4))) |v_#memory_$Pointer$.base_77|)) (exists ((|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16| (store (store (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16|) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16|) 4))) |v_#memory_$Pointer$.offset_72|)) (exists ((|v_#memory_$Pointer$.base_76| (Array Int (Array Int Int))) (|v_#memory_int_89| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_25| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_42| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int) (|v_#memory_$Pointer$.offset_71| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_25| (store |v_#memory_$Pointer$.base_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_25| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= (select (select (store |v_#memory_$Pointer$.offset_71| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_71| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_int_89| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_89| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_#memory_int_BEFORE_CALL_42| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0))) |v_#memory_int_BEFORE_CALL_42|))) (exists ((|v_#valid_44| (Array Int Int))) (and (= |#valid| (store |v_#valid_44| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16| 1)) (= (select |v_#valid_44| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16|) 0))) (not (= |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16| 0)) (exists ((|v_#length_28| (Array Int Int))) (= (store |v_#length_28| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16| 8) |#length|)) (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_16| |ULTIMATE.start_main_~#s~0#1.base|))) (= (store |v_#memory_int_90| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_int_90| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (select (select |v_#memory_int_27| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)))) |v_#memory_int_27|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_72| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.offset_72| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 0)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16| (store (select (store |v_#memory_$Pointer$.offset_72| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.offset_72| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 0)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16|) 0 (select (select (store |v_#memory_$Pointer$.offset_72| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.offset_72| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)))) (= |#memory_int| (store |v_#memory_int_27| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16| (store (select |v_#memory_int_27| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16|) 0)))) (= (store (store |v_#memory_$Pointer$.base_77| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.base_77| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16|)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16| (store (select (store |v_#memory_$Pointer$.base_77| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.base_77| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16|)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16|) 0 (select (select (store |v_#memory_$Pointer$.base_77| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.base_77| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_16|)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0))) |#memory_$Pointer$.base|) (= (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (select (select |v_#memory_$Pointer$.base_77| (select (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) (select (select |v_#memory_$Pointer$.offset_72| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~last~2#1.offset|) (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (= |ULTIMATE.start_main_~last~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 02:43:28,361 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 02:43:28,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 02:43:28,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24] total 33 [2024-11-14 02:43:28,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265111778] [2024-11-14 02:43:28,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 02:43:28,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-14 02:43:28,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:43:28,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-14 02:43:28,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=3134, Unknown=11, NotChecked=342, Total=3660 [2024-11-14 02:43:28,365 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 33 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-14 02:43:29,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:43:29,904 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2024-11-14 02:43:29,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 02:43:29,906 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 28 [2024-11-14 02:43:29,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:43:29,907 INFO L225 Difference]: With dead ends: 52 [2024-11-14 02:43:29,908 INFO L226 Difference]: Without dead ends: 40 [2024-11-14 02:43:29,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 39.3s TimeCoverageRelationStatistics Valid=253, Invalid=3908, Unknown=11, NotChecked=384, Total=4556 [2024-11-14 02:43:29,910 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 57 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 02:43:29,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 316 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 02:43:29,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-14 02:43:29,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2024-11-14 02:43:29,918 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-14 02:43:29,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2024-11-14 02:43:29,919 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 28 [2024-11-14 02:43:29,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:43:29,919 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2024-11-14 02:43:29,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-14 02:43:29,920 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2024-11-14 02:43:29,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 02:43:29,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:43:29,921 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:43:29,939 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 02:43:30,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-14 02:43:30,122 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:43:30,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:43:30,123 INFO L85 PathProgramCache]: Analyzing trace with hash 270428339, now seen corresponding path program 1 times [2024-11-14 02:43:30,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:43:30,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717917605] [2024-11-14 02:43:30,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:43:30,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:43:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:43:32,263 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 02:43:32,263 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:43:32,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717917605] [2024-11-14 02:43:32,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717917605] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:43:32,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224070634] [2024-11-14 02:43:32,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:43:32,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:43:32,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:43:32,266 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:43:32,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 02:43:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:43:32,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 122 conjuncts are in the unsatisfiable core [2024-11-14 02:43:32,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:43:32,516 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-14 02:43:32,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 02:43:32,899 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-14 02:43:33,021 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 02:43:33,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 02:43:33,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 02:43:33,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 02:43:33,361 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-14 02:43:33,362 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 91 treesize of output 60 [2024-11-14 02:43:33,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-14 02:43:33,553 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-14 02:43:33,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 39 [2024-11-14 02:43:33,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 02:43:33,574 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-14 02:43:33,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 02:43:33,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:43:33,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 02:43:33,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:43:33,983 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 02:43:33,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 54 [2024-11-14 02:43:34,013 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-14 02:43:34,013 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-14 02:43:34,064 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-14 02:43:34,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-14 02:43:35,302 INFO L349 Elim1Store]: treesize reduction 63, result has 33.7 percent of original size [2024-11-14 02:43:35,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 64 [2024-11-14 02:43:35,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:43:35,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-11-14 02:43:35,573 INFO L349 Elim1Store]: treesize reduction 164, result has 32.0 percent of original size [2024-11-14 02:43:35,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 99 treesize of output 128 [2024-11-14 02:43:35,673 INFO L349 Elim1Store]: treesize reduction 104, result has 26.2 percent of original size [2024-11-14 02:43:35,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 150 treesize of output 159 [2024-11-14 02:43:35,735 INFO L349 Elim1Store]: treesize reduction 29, result has 44.2 percent of original size [2024-11-14 02:43:35,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2024-11-14 02:43:35,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-11-14 02:43:35,894 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-14 02:43:36,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:43:36,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 178 [2024-11-14 02:43:36,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:43:36,150 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 165 treesize of output 159 [2024-11-14 02:43:39,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:43:39,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 231 treesize of output 243 [2024-11-14 02:43:43,976 INFO L349 Elim1Store]: treesize reduction 123, result has 87.5 percent of original size [2024-11-14 02:43:43,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 15 select indices, 15 select index equivalence classes, 1 disjoint index pairs (out of 105 index pairs), introduced 18 new quantified variables, introduced 105 case distinctions, treesize of input 580 treesize of output 1062 [2024-11-14 02:44:12,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:44:12,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:44:12,694 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_456 (Array Int Int)) (v_ArrVal_455 (Array Int Int)) (v_ArrVal_457 Int)) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_458))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_457)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_455) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_453) .cse0) (+ .cse1 4))) (not (= v_ArrVal_455 (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_455 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (not (= .cse0 (select (select .cse2 .cse0) .cse1))))))) is different from false [2024-11-14 02:44:18,093 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_21| Int) (v_subst_2 Int) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_456 (Array Int Int)) (v_ArrVal_455 (Array Int Int)) (v_ArrVal_457 Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_21|))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_21| (store .cse1 v_subst_2 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_458)) (.cse5 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_21|))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_21| (store .cse5 v_subst_2 v_ArrVal_457)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (= .cse0 (select .cse1 v_subst_2))) (not (= v_ArrVal_455 (store (select |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_21|) v_subst_2 (select v_ArrVal_455 v_subst_2)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_21| v_ArrVal_455) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_453) .cse2) (+ 4 .cse3))) (not (= (select (select .cse4 .cse2) .cse3) .cse2)) (not (= (select .cse5 v_subst_2) .cse6)) (< (select (select |c_#memory_$Pointer$.base| .cse0) .cse6) |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_21|)))))) is different from false [2024-11-14 02:44:18,154 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_21| Int) (v_subst_2 Int) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_456 (Array Int Int)) (v_ArrVal_455 (Array Int Int)) (v_ArrVal_457 Int)) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_21|))) (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_21| (store .cse3 v_subst_2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_458)) (.cse4 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_21|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_21| (store .cse4 v_subst_2 v_ArrVal_457)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_21| v_ArrVal_455) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_453) .cse0) (+ .cse1 4))) (not (= .cse2 (select .cse3 v_subst_2))) (not (= v_ArrVal_455 (store (select |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_21|) v_subst_2 (select v_ArrVal_455 v_subst_2)))) (not (= (select .cse4 v_subst_2) .cse5)) (< (select (select |c_#memory_$Pointer$.base| .cse2) .cse5) |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_21|) (not (= (select (select .cse6 .cse0) .cse1) .cse0))))))) is different from false [2024-11-14 02:44:18,450 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_469 (Array Int Int)) (v_ArrVal_468 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_21| Int) (v_subst_2 Int) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_467 (Array Int Int)) (v_ArrVal_456 (Array Int Int)) (v_ArrVal_455 (Array Int Int)) (v_ArrVal_457 Int)) (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_467))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_469)) (.cse3 (select .cse5 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_21|))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_21| (store .cse3 v_subst_2 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_458)) (.cse7 (select .cse8 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_21|))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_21| (store .cse7 v_subst_2 v_ArrVal_457)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_456) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse6 (select (select .cse8 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_21| v_ArrVal_455) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_453) .cse0) (+ .cse1 4))) (not (= (select (select .cse2 .cse0) .cse1) .cse0)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24|) 0)) (not (= (select .cse3 v_subst_2) .cse4)) (not (= v_ArrVal_455 (store (select (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_468) |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_21|) v_subst_2 (select v_ArrVal_455 v_subst_2)))) (< (select (select .cse5 .cse4) .cse6) |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_21|) (not (= (select .cse7 v_subst_2) .cse6)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| 1)))))))) is different from false [2024-11-14 02:44:18,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224070634] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:44:18,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [537567727] [2024-11-14 02:44:18,458 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-14 02:44:18,458 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:44:18,459 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:44:18,459 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:44:18,459 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:44:19,131 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2024-11-14 02:44:19,140 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 02:44:34,531 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '885#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~last~2#1.offset|) (exists ((|v_#memory_int_119| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_87| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_94| (Array Int (Array Int Int))) (|v_#memory_int_27| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_28| Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_18| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25| Int) (|v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_20| Int)) (and (= (select (select |v_#memory_$Pointer$.base_94| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) (select (select |v_#memory_$Pointer$.base_94| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_28|)) (= |#memory_int| (store |v_#memory_int_27| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_20| (store (select |v_#memory_int_27| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_20|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_20|) 0)))) (= |v_#memory_int_27| (store |v_#memory_int_119| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25| (store (select |v_#memory_int_119| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_28| (select (select |v_#memory_int_27| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_28|)))) (= (select (select |v_#memory_$Pointer$.offset_87| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_28|) (select (select |v_#memory_$Pointer$.offset_87| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)) (<= 2 |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) (= (store (store |v_#memory_$Pointer$.base_94| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25| (store (select |v_#memory_$Pointer$.base_94| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_28| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_20|)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_20| (store (select (store |v_#memory_$Pointer$.base_94| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25| (store (select |v_#memory_$Pointer$.base_94| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_28| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_20|)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_20|) 0 (select (select (store |v_#memory_$Pointer$.base_94| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25| (store (select |v_#memory_$Pointer$.base_94| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_28| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_20|)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0))) |#memory_$Pointer$.base|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_87| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25| (store (select |v_#memory_$Pointer$.offset_87| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_28| 0)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_20| (store (select (store |v_#memory_$Pointer$.offset_87| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25| (store (select |v_#memory_$Pointer$.offset_87| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_28| 0)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_20|) 0 (select (select (store |v_#memory_$Pointer$.offset_87| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25| (store (select |v_#memory_$Pointer$.offset_87| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_25|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_28| 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)))))) (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (= |ULTIMATE.start_main_~last~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 02:44:34,532 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 02:44:34,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 02:44:34,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 43 [2024-11-14 02:44:34,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988974827] [2024-11-14 02:44:34,532 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 02:44:34,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-14 02:44:34,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:44:34,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-14 02:44:34,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=4746, Unknown=12, NotChecked=564, Total=5550 [2024-11-14 02:44:34,536 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 02:44:39,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:44:39,982 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2024-11-14 02:44:39,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 02:44:39,983 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 30 [2024-11-14 02:44:39,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:44:39,984 INFO L225 Difference]: With dead ends: 66 [2024-11-14 02:44:39,984 INFO L226 Difference]: Without dead ends: 58 [2024-11-14 02:44:39,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1677 ImplicationChecksByTransitivity, 30.0s TimeCoverageRelationStatistics Valid=428, Invalid=7408, Unknown=12, NotChecked=708, Total=8556 [2024-11-14 02:44:39,990 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 122 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-14 02:44:39,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 360 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-14 02:44:39,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-14 02:44:40,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2024-11-14 02:44:40,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 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-14 02:44:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2024-11-14 02:44:40,014 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 30 [2024-11-14 02:44:40,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:44:40,014 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2024-11-14 02:44:40,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 02:44:40,015 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2024-11-14 02:44:40,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 02:44:40,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:44:40,016 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:44:40,045 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-14 02:44:40,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:44:40,217 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:44:40,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:44:40,218 INFO L85 PathProgramCache]: Analyzing trace with hash -2064640690, now seen corresponding path program 1 times [2024-11-14 02:44:40,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:44:40,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759796484] [2024-11-14 02:44:40,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:44:40,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:44:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:44:44,317 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 02:44:44,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:44:44,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759796484] [2024-11-14 02:44:44,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759796484] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:44:44,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199054640] [2024-11-14 02:44:44,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:44:44,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:44:44,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:44:44,320 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:44:44,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 02:44:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:44:44,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 141 conjuncts are in the unsatisfiable core [2024-11-14 02:44:44,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:44:44,661 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-14 02:44:45,059 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-14 02:44:45,332 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 02:44:45,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 02:44:45,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 02:44:45,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 02:44:45,882 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 02:44:45,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 24 [2024-11-14 02:44:45,891 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-14 02:44:45,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 02:44:46,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:44:46,177 INFO L349 Elim1Store]: treesize reduction 75, result has 8.5 percent of original size [2024-11-14 02:44:46,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 41 [2024-11-14 02:44:46,227 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-14 02:44:46,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-14 02:44:46,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:44:46,332 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 16 treesize of output 11 [2024-11-14 02:44:49,084 INFO L349 Elim1Store]: treesize reduction 410, result has 8.3 percent of original size [2024-11-14 02:44:49,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 10 new quantified variables, introduced 14 case distinctions, treesize of input 905 treesize of output 360 [2024-11-14 02:44:49,182 INFO L349 Elim1Store]: treesize reduction 148, result has 11.4 percent of original size [2024-11-14 02:44:49,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 684 treesize of output 504 [2024-11-14 02:44:49,239 INFO L349 Elim1Store]: treesize reduction 84, result has 15.2 percent of original size [2024-11-14 02:44:49,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 629 treesize of output 523 [2024-11-14 02:45:02,947 INFO L349 Elim1Store]: treesize reduction 12, result has 98.2 percent of original size [2024-11-14 02:45:02,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 2644 treesize of output 2824 [2024-11-14 02:48:54,665 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-14 02:48:54,666 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2024-11-14 02:48:54,666 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2024-11-14 02:48:54,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [131349877] [2024-11-14 02:48:54,668 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-14 02:48:54,668 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:48:54,668 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:48:54,669 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:48:54,669 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:48:54,675 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) 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.SmtUtils.checkSatTerm(SmtUtils.java:326) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:220) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:447) at java.base/java.io.OutputStream.write(OutputStream.java:167) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:125) at java.base/java.io.BufferedOutputStream.implFlush(BufferedOutputStream.java:252) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:246) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:412) at java.base/sun.nio.cs.StreamEncoder.lockedFlush(StreamEncoder.java:214) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:201) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:262) at java.base/java.io.BufferedWriter.implFlush(BufferedWriter.java:372) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:359) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 44 more [2024-11-14 02:48:54,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-14 02:48:54,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2024-11-14 02:48:54,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183855959] [2024-11-14 02:48:54,679 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-14 02:48:54,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-14 02:48:54,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:48:54,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-14 02:48:54,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1767, Unknown=1, NotChecked=0, Total=1892 [2024-11-14 02:48:54,684 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 23 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 02:48:54,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=124, Invalid=1767, Unknown=1, NotChecked=0, Total=1892 [2024-11-14 02:48:54,687 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 02:48:54,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 02:48:54,707 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 02:48:54,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:48:54,888 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_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertCodeBlock(IncrementalHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:278) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1708) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:762) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:385) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) 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: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:447) at java.base/java.io.OutputStream.write(OutputStream.java:167) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:125) at java.base/java.io.BufferedOutputStream.implFlush(BufferedOutputStream.java:252) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:246) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:412) at java.base/sun.nio.cs.StreamEncoder.lockedFlush(StreamEncoder.java:214) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:201) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:262) at java.base/java.io.BufferedWriter.implFlush(BufferedWriter.java:372) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:359) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2024-11-14 02:48:54,891 INFO L158 Benchmark]: Toolchain (without parser) took 412458.20ms. Allocated memory was 117.4MB in the beginning and 654.3MB in the end (delta: 536.9MB). Free memory was 91.8MB in the beginning and 390.2MB in the end (delta: -298.3MB). Peak memory consumption was 236.1MB. Max. memory is 16.1GB. [2024-11-14 02:48:54,892 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 117.4MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 02:48:54,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 605.86ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 73.5MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 02:48:54,893 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.69ms. Allocated memory is still 117.4MB. Free memory was 73.5MB in the beginning and 71.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 02:48:54,893 INFO L158 Benchmark]: Boogie Preprocessor took 57.26ms. Allocated memory is still 117.4MB. Free memory was 71.6MB in the beginning and 70.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 02:48:54,894 INFO L158 Benchmark]: RCFGBuilder took 575.62ms. Allocated memory is still 117.4MB. Free memory was 70.2MB in the beginning and 50.3MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 02:48:54,894 INFO L158 Benchmark]: TraceAbstraction took 411151.56ms. Allocated memory was 117.4MB in the beginning and 654.3MB in the end (delta: 536.9MB). Free memory was 49.8MB in the beginning and 390.2MB in the end (delta: -340.4MB). Peak memory consumption was 194.2MB. Max. memory is 16.1GB. [2024-11-14 02:48:54,895 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41ms. Allocated memory is still 117.4MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 605.86ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 73.5MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.69ms. Allocated memory is still 117.4MB. Free memory was 73.5MB in the beginning and 71.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.26ms. Allocated memory is still 117.4MB. Free memory was 71.6MB in the beginning and 70.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 575.62ms. Allocated memory is still 117.4MB. Free memory was 70.2MB in the beginning and 50.3MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 411151.56ms. Allocated memory was 117.4MB in the beginning and 654.3MB in the end (delta: 536.9MB). Free memory was 49.8MB in the beginning and 390.2MB in the end (delta: -340.4MB). Peak memory consumption was 194.2MB. 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_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) 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_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 02:48:57,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 02:48:57,431 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-14 02:48:57,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 02:48:57,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 02:48:57,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 02:48:57,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 02:48:57,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 02:48:57,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 02:48:57,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 02:48:57,494 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 02:48:57,495 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 02:48:57,496 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 02:48:57,496 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 02:48:57,497 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 02:48:57,497 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 02:48:57,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 02:48:57,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 02:48:57,498 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 02:48:57,498 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 02:48:57,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 02:48:57,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 02:48:57,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 02:48:57,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 02:48:57,499 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 02:48:57,499 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 02:48:57,500 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 02:48:57,500 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 02:48:57,500 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 02:48:57,500 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 02:48:57,500 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 02:48:57,500 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 02:48:57,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 02:48:57,501 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 02:48:57,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 02:48:57,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 02:48:57,502 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 02:48:57,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 02:48:57,502 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 02:48:57,502 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 02:48:57,502 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 02:48:57,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 02:48:57,503 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 02:48:57,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E 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 -> Taipan 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 -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2024-11-14 02:48:57,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 02:48:57,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 02:48:57,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 02:48:57,817 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 02:48:57,817 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 02:48:57,818 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i Unable to find full path for "g++" [2024-11-14 02:48:59,834 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 02:49:00,100 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 02:49:00,101 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2024-11-14 02:49:00,116 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/data/b7c405e77/2beca631ebfc46e08a4fd3e0b1a318a7/FLAGce8d5fb54 [2024-11-14 02:49:00,402 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/data/b7c405e77/2beca631ebfc46e08a4fd3e0b1a318a7 [2024-11-14 02:49:00,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 02:49:00,408 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 02:49:00,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 02:49:00,411 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 02:49:00,416 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 02:49:00,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:49:00" (1/1) ... [2024-11-14 02:49:00,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a457d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:49:00, skipping insertion in model container [2024-11-14 02:49:00,420 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:49:00" (1/1) ... [2024-11-14 02:49:00,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 02:49:00,791 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_e07abd3f-8ce1-434c-b985-9cff1abfb155/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2024-11-14 02:49:00,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 02:49:00,807 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 02:49:00,855 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_e07abd3f-8ce1-434c-b985-9cff1abfb155/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2024-11-14 02:49:00,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 02:49:00,891 INFO L204 MainTranslator]: Completed translation [2024-11-14 02:49:00,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:49:00 WrapperNode [2024-11-14 02:49:00,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 02:49:00,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 02:49:00,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 02:49:00,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 02:49:00,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:49:00" (1/1) ... [2024-11-14 02:49:00,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:49:00" (1/1) ... [2024-11-14 02:49:00,961 INFO L138 Inliner]: procedures = 130, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 157 [2024-11-14 02:49:00,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 02:49:00,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 02:49:00,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 02:49:00,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 02:49:00,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:49:00" (1/1) ... [2024-11-14 02:49:00,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:49:00" (1/1) ... [2024-11-14 02:49:00,980 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:49:00" (1/1) ... [2024-11-14 02:49:00,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:49:00" (1/1) ... [2024-11-14 02:49:01,003 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:49:00" (1/1) ... [2024-11-14 02:49:01,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:49:00" (1/1) ... [2024-11-14 02:49:01,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:49:00" (1/1) ... [2024-11-14 02:49:01,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:49:00" (1/1) ... [2024-11-14 02:49:01,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 02:49:01,017 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 02:49:01,018 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 02:49:01,018 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 02:49:01,019 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:49:00" (1/1) ... [2024-11-14 02:49:01,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 02:49:01,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:49:01,056 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 02:49:01,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 02:49:01,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-14 02:49:01,098 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-14 02:49:01,098 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-14 02:49:01,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 02:49:01,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 02:49:01,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 02:49:01,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 02:49:01,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 02:49:01,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 02:49:01,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-14 02:49:01,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 02:49:01,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 02:49:01,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 02:49:01,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 02:49:01,286 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 02:49:01,288 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 02:49:01,715 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-14 02:49:01,715 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 02:49:01,725 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 02:49:01,725 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-14 02:49:01,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:49:01 BoogieIcfgContainer [2024-11-14 02:49:01,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 02:49:01,728 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 02:49:01,728 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 02:49:01,733 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 02:49:01,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 02:49:00" (1/3) ... [2024-11-14 02:49:01,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6718e7b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:49:01, skipping insertion in model container [2024-11-14 02:49:01,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:49:00" (2/3) ... [2024-11-14 02:49:01,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6718e7b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:49:01, skipping insertion in model container [2024-11-14 02:49:01,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:49:01" (3/3) ... [2024-11-14 02:49:01,736 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2024-11-14 02:49:01,752 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 02:49:01,754 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_append_unequal.i that has 2 procedures, 39 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2024-11-14 02:49:01,824 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 02:49:01,836 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=FINITE_AUTOMATA, 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;@692b6782, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 02:49:01,836 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 02:49:01,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 34 states have internal predecessors, (50), 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-14 02:49:01,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 02:49:01,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:49:01,850 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] [2024-11-14 02:49:01,851 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:49:01,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:49:01,857 INFO L85 PathProgramCache]: Analyzing trace with hash 269521456, now seen corresponding path program 1 times [2024-11-14 02:49:01,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 02:49:01,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784941122] [2024-11-14 02:49:01,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:49:01,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 02:49:01,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 02:49:01,882 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 02:49:01,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-14 02:49:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:49:02,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-14 02:49:02,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:49:02,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 02:49:02,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 02:49:02,201 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 02:49:02,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784941122] [2024-11-14 02:49:02,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784941122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:49:02,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:49:02,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 02:49:02,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426613520] [2024-11-14 02:49:02,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:49:02,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 02:49:02,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 02:49:02,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 02:49:02,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 02:49:02,240 INFO L87 Difference]: Start difference. First operand has 39 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 34 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-14 02:49:02,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:49:02,262 INFO L93 Difference]: Finished difference Result 71 states and 101 transitions. [2024-11-14 02:49:02,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 02:49:02,265 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 25 [2024-11-14 02:49:02,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:49:02,271 INFO L225 Difference]: With dead ends: 71 [2024-11-14 02:49:02,271 INFO L226 Difference]: Without dead ends: 31 [2024-11-14 02:49:02,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 02:49:02,280 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 02:49:02,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 02:49:02,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-14 02:49:02,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-14 02:49:02,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 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-14 02:49:02,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-11-14 02:49:02,324 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 25 [2024-11-14 02:49:02,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:49:02,327 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-14 02:49:02,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-14 02:49:02,328 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2024-11-14 02:49:02,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 02:49:02,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:49:02,332 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] [2024-11-14 02:49:02,337 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-14 02:49:02,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 02:49:02,540 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:49:02,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:49:02,541 INFO L85 PathProgramCache]: Analyzing trace with hash 228599896, now seen corresponding path program 1 times [2024-11-14 02:49:02,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 02:49:02,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637647394] [2024-11-14 02:49:02,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:49:02,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 02:49:02,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 02:49:02,546 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 02:49:02,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-14 02:49:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:49:02,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 02:49:02,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:49:02,871 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:49:02,872 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 02:49:02,872 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 02:49:02,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637647394] [2024-11-14 02:49:02,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637647394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:49:02,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:49:02,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 02:49:02,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139949505] [2024-11-14 02:49:02,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:49:02,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 02:49:02,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 02:49:02,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 02:49:02,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 02:49:02,877 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 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-14 02:49:02,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:49:02,910 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2024-11-14 02:49:02,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 02:49:02,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 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 26 [2024-11-14 02:49:02,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:49:02,914 INFO L225 Difference]: With dead ends: 58 [2024-11-14 02:49:02,914 INFO L226 Difference]: Without dead ends: 34 [2024-11-14 02:49:02,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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-14 02:49:02,915 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 69 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-14 02:49:02,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 69 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 02:49:02,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-14 02:49:02,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-14 02:49:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 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-14 02:49:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-11-14 02:49:02,928 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 26 [2024-11-14 02:49:02,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:49:02,929 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-11-14 02:49:02,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 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-14 02:49:02,929 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-11-14 02:49:02,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 02:49:02,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:49:02,931 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:49:02,936 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-14 02:49:03,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 02:49:03,132 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:49:03,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:49:03,134 INFO L85 PathProgramCache]: Analyzing trace with hash -885718992, now seen corresponding path program 1 times [2024-11-14 02:49:03,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 02:49:03,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990087319] [2024-11-14 02:49:03,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:49:03,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 02:49:03,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 02:49:03,138 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 02:49:03,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-14 02:49:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:49:03,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-14 02:49:03,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:49:03,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 02:49:03,840 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 8 treesize of output 4 [2024-11-14 02:49:04,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:49:04,072 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 17 treesize of output 12 [2024-11-14 02:49:04,157 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-14 02:49:04,184 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 02:49:04,184 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:49:04,363 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 02:49:04,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990087319] [2024-11-14 02:49:04,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [990087319] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:49:04,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1678245114] [2024-11-14 02:49:04,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:49:04,364 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 02:49:04,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 02:49:04,376 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 02:49:04,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-14 02:49:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:49:04,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-14 02:49:04,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:49:05,277 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 8 treesize of output 4 [2024-11-14 02:49:05,485 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 02:49:05,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2024-11-14 02:49:05,621 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-14 02:49:05,628 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 02:49:05,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:49:05,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1678245114] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:49:05,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291544564] [2024-11-14 02:49:05,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:49:05,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:49:05,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:49:05,775 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:49:05,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 02:49:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:49:06,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-14 02:49:06,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:49:06,169 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 8 treesize of output 4 [2024-11-14 02:49:06,296 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 02:49:06,297 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 17 treesize of output 16 [2024-11-14 02:49:06,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 02:49:06,436 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-14 02:49:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 02:49:06,443 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:49:06,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291544564] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:49:06,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:49:06,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2024-11-14 02:49:06,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68892539] [2024-11-14 02:49:06,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:49:06,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-14 02:49:06,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 02:49:06,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-14 02:49:06,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=508, Unknown=2, NotChecked=0, Total=600 [2024-11-14 02:49:06,599 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 23 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 17 states have internal predecessors, (39), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-14 02:49:08,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:49:08,388 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2024-11-14 02:49:08,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 02:49:08,389 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 17 states have internal predecessors, (39), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) Word has length 34 [2024-11-14 02:49:08,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:49:08,390 INFO L225 Difference]: With dead ends: 45 [2024-11-14 02:49:08,390 INFO L226 Difference]: Without dead ends: 34 [2024-11-14 02:49:08,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=159, Invalid=831, Unknown=2, NotChecked=0, Total=992 [2024-11-14 02:49:08,391 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 59 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-14 02:49:08,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 254 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-14 02:49:08,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-14 02:49:08,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-14 02:49:08,399 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-14 02:49:08,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-11-14 02:49:08,400 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 34 [2024-11-14 02:49:08,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:49:08,401 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-11-14 02:49:08,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 17 states have internal predecessors, (39), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-14 02:49:08,401 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-11-14 02:49:08,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 02:49:08,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:49:08,402 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:49:08,408 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-14 02:49:08,609 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-14 02:49:08,819 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 02:49:09,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:49:09,006 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:49:09,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:49:09,007 INFO L85 PathProgramCache]: Analyzing trace with hash 558336735, now seen corresponding path program 1 times [2024-11-14 02:49:09,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 02:49:09,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372690253] [2024-11-14 02:49:09,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:49:09,008 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 02:49:09,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 02:49:09,011 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 02:49:09,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-14 02:49:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:49:09,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-14 02:49:09,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:49:09,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:49:09,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2024-11-14 02:49:09,630 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 02:49:09,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-14 02:49:09,994 INFO L349 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2024-11-14 02:49:09,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2024-11-14 02:49:10,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 02:49:10,361 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 02:49:10,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2024-11-14 02:49:10,662 INFO L349 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2024-11-14 02:49:10,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 43 [2024-11-14 02:49:10,677 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 13 treesize of output 9 [2024-11-14 02:49:10,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2024-11-14 02:49:11,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:49:11,183 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 02:49:11,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 66 [2024-11-14 02:49:11,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:49:11,206 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 64 treesize of output 55 [2024-11-14 02:49:11,277 INFO L349 Elim1Store]: treesize reduction 18, result has 61.7 percent of original size [2024-11-14 02:49:11,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 47 [2024-11-14 02:49:11,545 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 60 treesize of output 44 [2024-11-14 02:49:11,778 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-14 02:49:11,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 39 [2024-11-14 02:49:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 02:49:11,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:49:12,490 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 02:49:12,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [372690253] [2024-11-14 02:49:12,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [372690253] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:49:12,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1286952588] [2024-11-14 02:49:12,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:49:12,491 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 02:49:12,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 02:49:12,498 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 02:49:12,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-14 02:49:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:49:12,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-14 02:49:13,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:49:13,214 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-14 02:49:14,027 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-14 02:49:14,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-14 02:49:14,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:49:14,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 02:49:14,410 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-14 02:49:14,411 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-14 02:49:15,073 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-11-14 02:49:15,073 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-14 02:49:15,132 INFO L349 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2024-11-14 02:49:15,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 93 [2024-11-14 02:49:15,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:49:15,172 INFO L349 Elim1Store]: treesize reduction 57, result has 8.1 percent of original size [2024-11-14 02:49:15,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 67 [2024-11-14 02:49:15,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2024-11-14 02:49:15,612 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 02:49:15,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 20 [2024-11-14 02:49:15,776 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 02:49:15,776 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:49:16,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:49:16,380 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 802 treesize of output 710 [2024-11-14 02:49:16,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 344 treesize of output 342 [2024-11-14 02:49:16,401 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 342 treesize of output 338 [2024-11-14 02:49:24,933 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (.cse6 (not (bvult |c_ULTIMATE.start_main_~#s~0#1.base| |c_#StackHeapBarrier|)))) (let ((.cse0 (and (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_433 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_433))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_ArrVal_427 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse15 (store (store |c_#memory_$Pointer$.base| .cse16 (store (select .cse17 .cse16) v_arrayElimCell_47 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_427))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse14 (select (select .cse15 .cse14) v_arrayElimCell_46)))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse16))))) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (bvult |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| |c_#StackHeapBarrier|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24|))))) (or .cse5 (and (forall ((v_ArrVal_433 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_433) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_49 (_ BitVec 32)) (v_ArrVal_427 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse18 (select v_ArrVal_427 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse18 (select (select (store (store |c_#memory_$Pointer$.base| .cse19 (store v_ArrVal_433 v_arrayElimCell_47 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_427) .cse18) v_arrayElimCell_49))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse19))))) (forall ((v_ArrVal_433 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_433) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_49 (_ BitVec 32)) (v_ArrVal_427 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse21 (select v_ArrVal_427 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse20 (store (select |c_#memory_$Pointer$.base| .cse20) v_arrayElimCell_47 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_427) .cse21) v_arrayElimCell_49) .cse21)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse20))))) .cse6) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| (_ BitVec 32))) (or (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (bvult |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_433 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_433) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse22)) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_48 (_ BitVec 32)) (v_ArrVal_427 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse23 (store (store |c_#memory_$Pointer$.base| .cse22 (store (select |c_#memory_$Pointer$.base| .cse22) v_arrayElimCell_47 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_427))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse23 .cse24) v_arrayElimCell_48) .cse24)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24|)))))))) (and (or (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) .cse0) (or (and (forall ((v_ArrVal_433 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_433) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_49 (_ BitVec 32)) (v_ArrVal_427 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse2 (select v_ArrVal_427 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse1 (store v_ArrVal_433 v_arrayElimCell_46 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_427) .cse2) v_arrayElimCell_49) .cse2)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse1))))) (forall ((v_ArrVal_433 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_433) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_49 (_ BitVec 32)) (v_ArrVal_427 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse4 (select v_ArrVal_427 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) v_arrayElimCell_46 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_427) .cse4) v_arrayElimCell_49) .cse4)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse3))))) .cse5 .cse6) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| (_ BitVec 32))) (or (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_433 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_433) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse7)) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_48 (_ BitVec 32)) (v_ArrVal_427 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse9 (store (store |c_#memory_$Pointer$.base| .cse7 (store (select |c_#memory_$Pointer$.base| .cse7) v_arrayElimCell_46 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_427))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse8 (select (select .cse9 .cse8) v_arrayElimCell_48))))))))) (not (bvult |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| |c_#StackHeapBarrier|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24|))))) (or (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) .cse0) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| (_ BitVec 32))) (or (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (bvult |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_433 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_433))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse10) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_ArrVal_427 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse12 (store (store |c_#memory_$Pointer$.base| .cse10 (store (select .cse13 .cse10) v_arrayElimCell_46 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_427))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse11 (select (select .cse12 .cse11) v_arrayElimCell_46)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24|)))))))) is different from false [2024-11-14 02:49:25,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1286952588] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:49:25,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358718833] [2024-11-14 02:49:25,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:49:25,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:49:25,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:49:25,681 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:49:25,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07abd3f-8ce1-434c-b985-9cff1abfb155/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 02:49:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:49:25,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-14 02:49:25,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:49:25,974 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-14 02:49:30,534 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-14 02:49:30,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 29 [2024-11-14 02:49:30,580 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 02:49:30,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 02:49:32,679 INFO L349 Elim1Store]: treesize reduction 226, result has 14.7 percent of original size [2024-11-14 02:49:32,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 439 treesize of output 258 [2024-11-14 02:49:32,942 INFO L349 Elim1Store]: treesize reduction 175, result has 16.3 percent of original size [2024-11-14 02:49:32,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 407 treesize of output 305 [2024-11-14 02:49:45,378 WARN L286 SmtUtils]: Spent 10.67s on a formula simplification. DAG size of input: 203 DAG size of output: 115 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 02:49:45,378 INFO L349 Elim1Store]: treesize reduction 1055, result has 30.7 percent of original size [2024-11-14 02:49:45,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 948 treesize of output 1570 [2024-11-14 02:49:49,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 02:50:12,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:50:12,327 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 725 treesize of output 729 [2024-11-14 02:50:16,360 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 02:50:16,361 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 710 treesize of output 702 [2024-11-14 02:50:54,163 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-14 02:50:58,468 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-14 02:50:58,698 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-14 02:51:06,757 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 02:51:06,757 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 699 treesize of output 691 [2024-11-14 02:51:07,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:51:07,538 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 714 treesize of output 718 [2024-11-14 02:51:10,209 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 02:51:10,209 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 693 treesize of output 679 [2024-11-14 02:51:10,455 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 02:51:10,455 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 708 treesize of output 694 [2024-11-14 02:51:11,178 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 02:51:11,178 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 693 treesize of output 685 [2024-11-14 02:51:11,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:51:11,927 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 708 treesize of output 712 [2024-11-14 02:51:14,491 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 02:51:14,492 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 723 treesize of output 709 [2024-11-14 02:51:14,742 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 02:51:14,742 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 708 treesize of output 694 [2024-11-14 02:51:15,743 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 02:51:34,017 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-14 02:51:34,279 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-14 02:51:34,618 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-14 02:52:14,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 02:52:15,065 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-14 02:52:19,438 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-14 02:52:19,541 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-14 02:52:25,477 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 02:52:25,478 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 693 treesize of output 679 [2024-11-14 02:52:25,724 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 02:52:25,725 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 708 treesize of output 694 [2024-11-14 02:52:26,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:52:26,266 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 723 treesize of output 721 [2024-11-14 02:52:26,835 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 02:52:26,835 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 708 treesize of output 694 [2024-11-14 02:54:26,485 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 02:54:26,576 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 02:54:28,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:54:28,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:54:28,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:54:28,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:54:43,117 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 02:54:43,186 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 02:54:43,399 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 02:54:44,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:54:44,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:54:44,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:54:45,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:54:45,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:54:50,460 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 02:54:50,460 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 460 treesize of output 452 [2024-11-14 02:54:50,618 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 02:54:50,619 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 460 treesize of output 452 [2024-11-14 02:54:51,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:54:51,026 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 475 treesize of output 479 [2024-11-14 02:54:51,429 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 02:54:51,429 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 475 treesize of output 467 [2024-11-14 02:55:42,615 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 02:55:42,704 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 02:55:42,867 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 02:55:42,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:55:43,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:55:43,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:55:43,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:55:43,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:55:48,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:55:49,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:55:49,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:55:49,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:55:49,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:55:50,815 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 02:55:50,908 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 02:56:00,150 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 02:56:00,237 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 02:56:00,404 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 02:56:01,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:56:01,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:56:01,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:56:01,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:56:01,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:56:03,620 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 02:56:03,620 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 460 treesize of output 452 [2024-11-14 02:56:03,771 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 02:56:03,771 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 460 treesize of output 452 [2024-11-14 02:56:03,969 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 02:56:03,970 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 475 treesize of output 467 [2024-11-14 02:56:04,124 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 02:56:04,124 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 475 treesize of output 467 [2024-11-14 02:56:10,100 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 02:56:10,136 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 02:56:10,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:56:10,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:56:10,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 02:56:12,231 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 02:56:12,260 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 02:56:12,300 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 02:56:12,335 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 02:56:20,497 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 02:56:20,532 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 02:56:20,596 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 02:56:20,674 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 02:56:20,707 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 02:56:20,770 WARN L214 Elim1Store]: Array PQE input equivalent to false