./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-data/running_example.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-data/running_example.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje --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 318c7aa22aeecc0174739978e9fb15d261281003454726c8705d95a97106063f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:18:37,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:18:37,609 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 01:18:37,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:18:37,615 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:18:37,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:18:37,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:18:37,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:18:37,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:18:37,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:18:37,659 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 01:18:37,659 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 01:18:37,660 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 01:18:37,661 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 01:18:37,662 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 01:18:37,663 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 01:18:37,663 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 01:18:37,664 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 01:18:37,664 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 01:18:37,664 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 01:18:37,664 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 01:18:37,669 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 01:18:37,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:18:37,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:18:37,670 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:18:37,670 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:18:37,670 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:18:37,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:18:37,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:18:37,671 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:18:37,671 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:18:37,672 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:18:37,672 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:18:37,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:18:37,672 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:18:37,673 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:18:37,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:18:37,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:18:37,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:18:37,674 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:18:37,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:18:37,676 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:18:37,676 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 01:18:37,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:18:37,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:18:37,677 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 01:18:37,678 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:18:37,678 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje 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 -> 318c7aa22aeecc0174739978e9fb15d261281003454726c8705d95a97106063f [2024-11-09 01:18:37,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:18:38,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:18:38,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:18:38,030 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:18:38,031 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:18:38,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/heap-data/running_example.i Unable to find full path for "g++" [2024-11-09 01:18:40,067 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:18:40,334 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:18:40,335 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/sv-benchmarks/c/heap-data/running_example.i [2024-11-09 01:18:40,346 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/data/737690317/c39f96dc9f7747ba8b3edba842f8692c/FLAGb3a00aead [2024-11-09 01:18:40,366 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/data/737690317/c39f96dc9f7747ba8b3edba842f8692c [2024-11-09 01:18:40,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:18:40,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:18:40,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:18:40,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:18:40,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:18:40,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:18:40" (1/1) ... [2024-11-09 01:18:40,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e934f51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:40, skipping insertion in model container [2024-11-09 01:18:40,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:18:40" (1/1) ... [2024-11-09 01:18:40,423 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:18:40,820 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_ac16905e-b3aa-4151-86ab-f11c53aefac7/sv-benchmarks/c/heap-data/running_example.i[23610,23623] [2024-11-09 01:18:40,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:18:40,841 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:18:40,898 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_ac16905e-b3aa-4151-86ab-f11c53aefac7/sv-benchmarks/c/heap-data/running_example.i[23610,23623] [2024-11-09 01:18:40,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:18:40,931 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:18:40,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:40 WrapperNode [2024-11-09 01:18:40,932 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:18:40,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:18:40,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:18:40,934 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:18:40,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:40" (1/1) ... [2024-11-09 01:18:40,952 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:40" (1/1) ... [2024-11-09 01:18:40,972 INFO L138 Inliner]: procedures = 121, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 69 [2024-11-09 01:18:40,972 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:18:40,973 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:18:40,973 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:18:40,974 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:18:40,984 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:40" (1/1) ... [2024-11-09 01:18:40,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:40" (1/1) ... [2024-11-09 01:18:40,990 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:40" (1/1) ... [2024-11-09 01:18:40,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:40" (1/1) ... [2024-11-09 01:18:41,004 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:40" (1/1) ... [2024-11-09 01:18:41,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:40" (1/1) ... [2024-11-09 01:18:41,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:40" (1/1) ... [2024-11-09 01:18:41,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:40" (1/1) ... [2024-11-09 01:18:41,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:18:41,024 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:18:41,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:18:41,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:18:41,026 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:40" (1/1) ... [2024-11-09 01:18:41,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:18:41,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:18:41,068 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 01:18:41,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 01:18:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 01:18:41,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 01:18:41,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 01:18:41,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:18:41,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 01:18:41,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 01:18:41,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 01:18:41,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:18:41,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:18:41,213 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:18:41,216 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:18:41,384 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-09 01:18:41,385 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:18:41,467 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:18:41,467 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 01:18:41,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:18:41 BoogieIcfgContainer [2024-11-09 01:18:41,468 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:18:41,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:18:41,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:18:41,473 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:18:41,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:18:40" (1/3) ... [2024-11-09 01:18:41,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cc2e8fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:18:41, skipping insertion in model container [2024-11-09 01:18:41,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:40" (2/3) ... [2024-11-09 01:18:41,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cc2e8fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:18:41, skipping insertion in model container [2024-11-09 01:18:41,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:18:41" (3/3) ... [2024-11-09 01:18:41,477 INFO L112 eAbstractionObserver]: Analyzing ICFG running_example.i [2024-11-09 01:18:41,495 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:18:41,496 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:18:41,551 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:18:41,558 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;@2210f4c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:18:41,559 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:18:41,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:41,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 01:18:41,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:18:41,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:18:41,572 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:18:41,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:18:41,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1645898869, now seen corresponding path program 1 times [2024-11-09 01:18:41,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:18:41,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158547687] [2024-11-09 01:18:41,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:18:41,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:18:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:18:41,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:18:41,827 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:18:41,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158547687] [2024-11-09 01:18:41,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158547687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:18:41,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:18:41,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:18:41,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229997604] [2024-11-09 01:18:41,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:18:41,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:18:41,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:18:41,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:18:41,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:18:41,872 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:41,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:18:41,914 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. [2024-11-09 01:18:41,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:18:41,921 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 01:18:41,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:18:41,931 INFO L225 Difference]: With dead ends: 20 [2024-11-09 01:18:41,931 INFO L226 Difference]: Without dead ends: 12 [2024-11-09 01:18:41,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:18:41,941 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:18:41,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:18:41,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-09 01:18:41,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-09 01:18:41,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:41,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2024-11-09 01:18:41,981 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 7 [2024-11-09 01:18:41,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:18:41,982 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2024-11-09 01:18:41,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:41,983 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2024-11-09 01:18:41,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 01:18:41,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:18:41,985 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:18:41,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:18:41,986 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:18:41,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:18:41,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1235137953, now seen corresponding path program 1 times [2024-11-09 01:18:41,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:18:41,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116891082] [2024-11-09 01:18:41,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:18:41,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:18:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:18:42,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:18:42,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:18:42,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116891082] [2024-11-09 01:18:42,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116891082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:18:42,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:18:42,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:18:42,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456621378] [2024-11-09 01:18:42,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:18:42,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:18:42,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:18:42,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:18:42,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:18:42,405 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:42,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:18:42,497 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2024-11-09 01:18:42,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:18:42,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 01:18:42,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:18:42,501 INFO L225 Difference]: With dead ends: 23 [2024-11-09 01:18:42,501 INFO L226 Difference]: Without dead ends: 21 [2024-11-09 01:18:42,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:18:42,503 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 10 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:18:42,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 32 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:18:42,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-09 01:18:42,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-11-09 01:18:42,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:42,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2024-11-09 01:18:42,515 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 9 [2024-11-09 01:18:42,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:18:42,516 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2024-11-09 01:18:42,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:42,516 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2024-11-09 01:18:42,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 01:18:42,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:18:42,517 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:18:42,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:18:42,518 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:18:42,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:18:42,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1104551905, now seen corresponding path program 1 times [2024-11-09 01:18:42,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:18:42,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75818222] [2024-11-09 01:18:42,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:18:42,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:18:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:18:43,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:18:43,102 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:18:43,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75818222] [2024-11-09 01:18:43,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75818222] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:18:43,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084909763] [2024-11-09 01:18:43,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:18:43,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:18:43,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:18:43,105 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:18:43,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:18:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:18:43,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 01:18:43,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:18:43,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-09 01:18:43,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:18:43,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-09 01:18:43,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 01:18:43,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:18:43,604 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:18:43,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:18:43,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084909763] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:18:43,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1295246892] [2024-11-09 01:18:43,984 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-09 01:18:43,988 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:18:43,992 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:18:43,999 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:18:43,999 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:18:44,650 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:18:47,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1295246892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:18:47,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:18:47,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 4, 4] total 13 [2024-11-09 01:18:47,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954145864] [2024-11-09 01:18:47,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:18:47,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:18:47,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:18:47,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:18:47,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:18:47,365 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:49,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:18:51,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:18:51,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:18:51,869 INFO L93 Difference]: Finished difference Result 35 states and 50 transitions. [2024-11-09 01:18:51,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:18:51,870 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 01:18:51,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:18:51,872 INFO L225 Difference]: With dead ends: 35 [2024-11-09 01:18:51,872 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 01:18:51,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:18:51,874 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:18:51,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 31 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 2 Unknown, 0 Unchecked, 4.5s Time] [2024-11-09 01:18:51,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 01:18:51,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-11-09 01:18:51,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:51,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2024-11-09 01:18:51,883 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 13 [2024-11-09 01:18:51,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:18:51,884 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-11-09 01:18:51,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:51,884 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2024-11-09 01:18:51,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 01:18:51,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:18:51,885 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:18:51,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:18:52,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:18:52,089 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:18:52,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:18:52,090 INFO L85 PathProgramCache]: Analyzing trace with hash -826361499, now seen corresponding path program 1 times [2024-11-09 01:18:52,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:18:52,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963068347] [2024-11-09 01:18:52,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:18:52,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:18:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:18:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:18:52,385 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:18:52,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963068347] [2024-11-09 01:18:52,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963068347] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:18:52,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054869223] [2024-11-09 01:18:52,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:18:52,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:18:52,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:18:52,388 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:18:52,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 01:18:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:18:52,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 01:18:52,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:18:52,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 01:18:52,518 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-09 01:18:52,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:18:52,661 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 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-09 01:18:52,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:18:52,679 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-09 01:18:52,700 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:18:52,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 01:18:52,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:18:52,822 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:18:53,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:18:53,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054869223] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:18:53,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1705750978] [2024-11-09 01:18:53,167 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-09 01:18:53,167 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:18:53,168 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:18:53,168 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:18:53,168 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:18:57,855 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:18:58,822 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '369#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= |ULTIMATE.start_main_~tail~0#1.offset| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_#t~short9#1_16| Bool) (|v_ULTIMATE.start_main_#t~mem8#1_13| Int)) (and (or (and (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) 0) |v_ULTIMATE.start_main_#t~mem8#1_13|) (<= |v_ULTIMATE.start_main_#t~mem8#1_13| 9)) (not |v_ULTIMATE.start_main_#t~short9#1_16|)) (or |v_ULTIMATE.start_main_#t~short9#1_16| (< 20 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) 0))))) (not (= 0 |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))' at error location [2024-11-09 01:18:58,823 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:18:58,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:18:58,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-09 01:18:58,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447515778] [2024-11-09 01:18:58,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:18:58,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:18:58,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:18:58,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:18:58,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2024-11-09 01:18:58,826 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:59,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:18:59,952 INFO L93 Difference]: Finished difference Result 66 states and 91 transitions. [2024-11-09 01:18:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 01:18:59,953 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 01:18:59,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:18:59,954 INFO L225 Difference]: With dead ends: 66 [2024-11-09 01:18:59,954 INFO L226 Difference]: Without dead ends: 64 [2024-11-09 01:18:59,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2024-11-09 01:18:59,956 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 95 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:18:59,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 69 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 5 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:18:59,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-09 01:18:59,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 42. [2024-11-09 01:18:59,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 41 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:59,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2024-11-09 01:18:59,969 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 13 [2024-11-09 01:18:59,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:18:59,970 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2024-11-09 01:18:59,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:18:59,970 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2024-11-09 01:18:59,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 01:18:59,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:18:59,971 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:18:59,993 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 01:19:00,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:19:00,176 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:19:00,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:00,177 INFO L85 PathProgramCache]: Analyzing trace with hash 2089573413, now seen corresponding path program 1 times [2024-11-09 01:19:00,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:19:00,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996000413] [2024-11-09 01:19:00,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:00,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:19:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:19:01,449 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:19:01,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996000413] [2024-11-09 01:19:01,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996000413] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:19:01,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230978810] [2024-11-09 01:19:01,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:01,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:19:01,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:19:01,453 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:19:01,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 01:19:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:01,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-09 01:19:01,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:19:01,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:19:01,580 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-09 01:19:01,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2024-11-09 01:19:01,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-09 01:19:01,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-09 01:19:01,746 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 01:19:01,747 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 88 treesize of output 77 [2024-11-09 01:19:01,770 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 01:19:01,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 15 treesize of output 15 [2024-11-09 01:19:01,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 01:19:01,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2024-11-09 01:19:01,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 01:19:02,081 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 26 [2024-11-09 01:19:02,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2024-11-09 01:19:02,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2024-11-09 01:19:02,121 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-09 01:19:02,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:19:02,162 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:19:02,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:19:02,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 307 treesize of output 296 [2024-11-09 01:19:02,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:19:02,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 289 treesize of output 260 [2024-11-09 01:19:02,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:19:02,765 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 630 treesize of output 455 [2024-11-09 01:19:02,782 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 437 treesize of output 421 [2024-11-09 01:19:02,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:19:02,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 421 treesize of output 352 [2024-11-09 01:19:02,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:19:02,867 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 624 treesize of output 581 [2024-11-09 01:19:02,889 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 285 treesize of output 269 [2024-11-09 01:19:05,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:19:05,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2024-11-09 01:19:05,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:19:05,134 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 16 treesize of output 18 [2024-11-09 01:19:05,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:19:05,630 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 16 treesize of output 18 [2024-11-09 01:19:05,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:19:05,653 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 16 treesize of output 18 [2024-11-09 01:19:09,725 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse6 (and (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimCell_18 Int)) (let ((.cse61 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse60 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_arrayElimCell_19 Int) (v_prenex_2 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse59 (store .cse60 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2))) (or (< (select (select .cse59 v_arrayElimCell_19) v_arrayElimCell_22) 21) (< (select (select .cse59 v_arrayElimCell_18) 0) 21)))) (< 19 (select (select .cse60 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (< 20 .cse61) (< .cse61 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_arrayElimCell_18 Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse62 (select v_arrayElimArr_6 0)) (.cse63 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 20 .cse62) (< (select (select (store .cse63 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14) v_arrayElimCell_18) 0) 21) (< .cse62 10) (< (select (select .cse63 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))))) (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimCell_18 Int)) (let ((.cse66 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse65 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_arrayElimCell_19 Int) (v_DerPreprocessor_14 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse64 (store .cse65 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14))) (or (< (select (select .cse64 v_arrayElimCell_18) 0) 21) (< (select (select .cse64 v_arrayElimCell_19) v_arrayElimCell_22) 21)))) (< (select (select .cse65 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (< 20 .cse66) (< .cse66 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_arrayElimCell_18 Int) (v_prenex_1 (Array Int Int))) (let ((.cse67 (select v_arrayElimArr_6 0)) (.cse68 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 20 .cse67) (< .cse67 10) (< 9 (select (select (store .cse68 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_1) v_arrayElimCell_18) 0)) (< (select (select .cse68 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))))) (forall ((v_arrayElimCell_17 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_arrayElimCell_18 Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse69 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6)) (.cse70 (select v_arrayElimArr_6 0))) (or (< 9 (select (select (store .cse69 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11) v_arrayElimCell_18) 0)) (< 19 (select (select .cse69 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (< 20 .cse70) (< .cse70 10)))))) (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimCell_18 Int)) (let ((.cse73 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse72 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_prenex_1 (Array Int Int))) (let ((.cse71 (store .cse72 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_1))) (or (forall ((v_arrayElimCell_19 Int) (v_arrayElimCell_22 Int)) (<= 10 (select (select .cse71 v_arrayElimCell_19) v_arrayElimCell_22))) (< 9 (select (select .cse71 v_arrayElimCell_18) 0))))) (< (select (select .cse72 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (< 20 .cse73) (< .cse73 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimCell_18 Int)) (let ((.cse76 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse75 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_arrayElimCell_19 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse74 (store .cse75 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11))) (or (< 9 (select (select .cse74 v_arrayElimCell_19) v_arrayElimCell_22)) (< 9 (select (select .cse74 v_arrayElimCell_18) 0))))) (< 19 (select (select .cse75 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (< 20 .cse76) (< .cse76 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_arrayElimCell_18 Int) (v_prenex_2 (Array Int Int))) (let ((.cse77 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6)) (.cse78 (select v_arrayElimArr_6 0))) (or (< (select (select (store .cse77 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2) v_arrayElimCell_18) 0) 21) (< 19 (select (select .cse77 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (< 20 .cse78) (< .cse78 10)))))))) (.cse4 (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse2 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 0))) (.cse5 (= |c_ULTIMATE.start_main_~tail~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse3 (and (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse21 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_arrayElimCell_19 Int) (v_prenex_2 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2))) (or (< (select (select .cse19 v_arrayElimCell_17) v_arrayElimCell_21) 21) (< (select (select .cse19 v_arrayElimCell_19) v_arrayElimCell_22) 21)))) (< 19 (select (select .cse20 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (< 20 .cse21) (< .cse21 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_arrayElimCell_18 Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse22 (select v_arrayElimArr_6 0)) (.cse23 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 20 .cse22) (< .cse22 10) (< (select (select .cse23 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20) (< (select (select (store .cse23 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14) v_arrayElimCell_18) v_arrayElimCell_21) 21)))))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse25 (select v_arrayElimArr_6 0)) (.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< (select (select (store .cse24 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14) v_arrayElimCell_17) v_arrayElimCell_21) 21) (< 20 .cse25) (< .cse25 10) (< (select (select .cse24 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_arrayElimCell_18 Int) (v_prenex_2 (Array Int Int))) (let ((.cse27 (select v_arrayElimArr_6 0)) (.cse26 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 19 (select (select .cse26 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (< 20 .cse27) (< .cse27 10) (< (select (select (store .cse26 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2) v_arrayElimCell_18) v_arrayElimCell_21) 21)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_prenex_1 (Array Int Int))) (let ((.cse29 (select v_arrayElimArr_6 0)) (.cse28 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 9 (select (select (store .cse28 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_1) v_arrayElimCell_17) v_arrayElimCell_21)) (< 20 .cse29) (< .cse29 10) (< (select (select .cse28 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6)) (.cse31 (select v_arrayElimArr_6 0))) (or (< 9 (select (select (store .cse30 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11) v_arrayElimCell_17) v_arrayElimCell_21)) (< 19 (select (select .cse30 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (< 20 .cse31) (< .cse31 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse32 (select v_arrayElimArr_6 0))) (or (< 20 .cse32) (< .cse32 10) (forall ((v_ArrVal_233 Int)) (let ((.cse33 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 19 (select (select .cse33 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (forall ((v_arrayElimCell_19 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse34 (store .cse33 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11))) (or (< 9 (select (select .cse34 v_arrayElimCell_17) v_arrayElimCell_21)) (< 9 (select (select .cse34 v_arrayElimCell_19) v_arrayElimCell_22))))))))))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse37 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse36 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_prenex_1 (Array Int Int))) (let ((.cse35 (store .cse36 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_1))) (or (forall ((v_arrayElimCell_19 Int) (v_arrayElimCell_22 Int)) (<= 10 (select (select .cse35 v_arrayElimCell_19) v_arrayElimCell_22))) (< 9 (select (select .cse35 v_arrayElimCell_17) v_arrayElimCell_21))))) (< (select (select .cse36 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (< 20 .cse37) (< .cse37 10)))))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimCell_18 Int)) (let ((.cse40 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse38 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 19 (select (select .cse38 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (forall ((v_arrayElimCell_19 Int) (v_prenex_2 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse39 (store .cse38 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2))) (or (< (select (select .cse39 v_arrayElimCell_19) v_arrayElimCell_22) 21) (< (select (select .cse39 v_arrayElimCell_18) v_arrayElimCell_21) 21))))))) (< 20 .cse40) (< .cse40 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimCell_18 Int)) (let ((.cse43 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse42 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_arrayElimCell_19 Int) (v_DerPreprocessor_14 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse41 (store .cse42 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14))) (or (< (select (select .cse41 v_arrayElimCell_19) v_arrayElimCell_22) 21) (< (select (select .cse41 v_arrayElimCell_18) v_arrayElimCell_21) 21)))) (< (select (select .cse42 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (< 20 .cse43) (< .cse43 10)))))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_prenex_2 (Array Int Int))) (let ((.cse44 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6)) (.cse45 (select v_arrayElimArr_6 0))) (or (< (select (select (store .cse44 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2) v_arrayElimCell_17) v_arrayElimCell_21) 21) (< 19 (select (select .cse44 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (< 20 .cse45) (< .cse45 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_arrayElimCell_18 Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse46 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6)) (.cse47 (select v_arrayElimArr_6 0))) (or (< 9 (select (select (store .cse46 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11) v_arrayElimCell_18) v_arrayElimCell_21)) (< 19 (select (select .cse46 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (< 20 .cse47) (< .cse47 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimCell_18 Int)) (let ((.cse48 (select v_arrayElimArr_6 0))) (or (< 20 .cse48) (< .cse48 10) (forall ((v_ArrVal_233 Int)) (let ((.cse49 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 19 (select (select .cse49 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (forall ((v_arrayElimCell_19 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse50 (store .cse49 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11))) (or (< 9 (select (select .cse50 v_arrayElimCell_18) v_arrayElimCell_21)) (< 9 (select (select .cse50 v_arrayElimCell_19) v_arrayElimCell_22))))))))))))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse53 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse52 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_arrayElimCell_19 Int) (v_DerPreprocessor_14 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse51 (store .cse52 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14))) (or (< (select (select .cse51 v_arrayElimCell_17) v_arrayElimCell_21) 21) (< (select (select .cse51 v_arrayElimCell_19) v_arrayElimCell_22) 21)))) (< (select (select .cse52 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (< 20 .cse53) (< .cse53 10)))))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimCell_18 Int)) (let ((.cse56 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse55 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_prenex_1 (Array Int Int))) (let ((.cse54 (store .cse55 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_1))) (or (forall ((v_arrayElimCell_19 Int) (v_arrayElimCell_22 Int)) (<= 10 (select (select .cse54 v_arrayElimCell_19) v_arrayElimCell_22))) (< 9 (select (select .cse54 v_arrayElimCell_18) v_arrayElimCell_21))))) (< (select (select .cse55 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (< 20 .cse56) (< .cse56 10)))))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_arrayElimCell_18 Int) (v_prenex_1 (Array Int Int))) (let ((.cse58 (select v_arrayElimArr_6 0)) (.cse57 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 9 (select (select (store .cse57 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_1) v_arrayElimCell_18) v_arrayElimCell_21)) (< 20 .cse58) (< .cse58 10) (< (select (select .cse57 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0))))))) (and (or (forall ((v_ArrVal_233 Int) (v_arrayElimCell_19 Int) (v_DerPreprocessor_14 (Array Int Int)) (v_arrayElimCell_22 Int)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14) v_arrayElimCell_19) v_arrayElimCell_22) 21)) .cse2) (or .cse3 .cse4) (or .cse2 (forall ((v_ArrVal_233 Int) (v_arrayElimCell_19 Int) (v_prenex_2 (Array Int Int)) (v_arrayElimCell_22 Int)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2) v_arrayElimCell_19) v_arrayElimCell_22) 21))) (or .cse5 .cse6) (or .cse6 .cse4) (forall ((v_arrayElimCell_17 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse9 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_arrayElimCell_19 Int) (v_DerPreprocessor_14 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse7 (store .cse8 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14))) (or (< (select (select .cse7 v_arrayElimCell_19) v_arrayElimCell_22) 21) (< (select (select .cse7 v_arrayElimCell_17) 0) 21)))) (< (select (select .cse8 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (< 20 .cse9) (< .cse9 10)))))) (or (forall ((v_ArrVal_233 Int) (v_arrayElimCell_19 Int) (v_prenex_1 (Array Int Int)) (v_arrayElimCell_22 Int)) (< 9 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_1) v_arrayElimCell_19) v_arrayElimCell_22))) .cse2) (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse12 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_arrayElimCell_19 Int) (v_prenex_2 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2))) (or (< (select (select .cse10 v_arrayElimCell_17) 0) 21) (< (select (select .cse10 v_arrayElimCell_19) v_arrayElimCell_22) 21)))) (< 19 (select (select .cse11 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (< 20 .cse12) (< .cse12 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (or (forall ((v_ArrVal_233 Int) (v_arrayElimCell_19 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_arrayElimCell_22 Int)) (< 9 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11) v_arrayElimCell_19) v_arrayElimCell_22))) .cse2) (or .cse5 .cse3) (forall ((v_arrayElimCell_17 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse15 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 19 (select (select .cse13 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (forall ((v_arrayElimCell_19 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse14 (store .cse13 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11))) (or (< 9 (select (select .cse14 v_arrayElimCell_19) v_arrayElimCell_22)) (< 9 (select (select .cse14 v_arrayElimCell_17) 0)))))))) (< 20 .cse15) (< .cse15 10)))))) (forall ((v_arrayElimCell_17 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse18 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_prenex_1 (Array Int Int))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_1))) (or (forall ((v_arrayElimCell_19 Int) (v_arrayElimCell_22 Int)) (<= 10 (select (select .cse16 v_arrayElimCell_19) v_arrayElimCell_22))) (< 9 (select (select .cse16 v_arrayElimCell_17) 0))))) (< (select (select .cse17 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (< 20 .cse18) (< .cse18 10))))))))) is different from true [2024-11-09 01:19:16,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-09 01:19:16,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230978810] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:19:16,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1891804883] [2024-11-09 01:19:16,542 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-09 01:19:16,542 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:19:16,542 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:19:16,543 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:19:16,543 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:19:21,185 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:19:22,142 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '647#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= |ULTIMATE.start_main_~tail~0#1.offset| 0))' at error location [2024-11-09 01:19:22,142 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:19:22,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:19:22,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-11-09 01:19:22,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485989275] [2024-11-09 01:19:22,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:19:22,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 01:19:22,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:19:22,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 01:19:22,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=293, Unknown=5, NotChecked=34, Total=380 [2024-11-09 01:19:22,145 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:24,219 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse7 (and (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimCell_18 Int)) (let ((.cse66 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse65 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_arrayElimCell_19 Int) (v_prenex_2 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse64 (store .cse65 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2))) (or (< (select (select .cse64 v_arrayElimCell_19) v_arrayElimCell_22) 21) (< (select (select .cse64 v_arrayElimCell_18) 0) 21)))) (< 19 (select (select .cse65 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (< 20 .cse66) (< .cse66 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_arrayElimCell_18 Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse67 (select v_arrayElimArr_6 0)) (.cse68 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 20 .cse67) (< (select (select (store .cse68 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14) v_arrayElimCell_18) 0) 21) (< .cse67 10) (< (select (select .cse68 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))))) (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimCell_18 Int)) (let ((.cse71 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse70 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_arrayElimCell_19 Int) (v_DerPreprocessor_14 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse69 (store .cse70 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14))) (or (< (select (select .cse69 v_arrayElimCell_18) 0) 21) (< (select (select .cse69 v_arrayElimCell_19) v_arrayElimCell_22) 21)))) (< (select (select .cse70 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (< 20 .cse71) (< .cse71 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_arrayElimCell_18 Int) (v_prenex_1 (Array Int Int))) (let ((.cse72 (select v_arrayElimArr_6 0)) (.cse73 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 20 .cse72) (< .cse72 10) (< 9 (select (select (store .cse73 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_1) v_arrayElimCell_18) 0)) (< (select (select .cse73 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))))) (forall ((v_arrayElimCell_17 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_arrayElimCell_18 Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse74 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6)) (.cse75 (select v_arrayElimArr_6 0))) (or (< 9 (select (select (store .cse74 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11) v_arrayElimCell_18) 0)) (< 19 (select (select .cse74 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (< 20 .cse75) (< .cse75 10)))))) (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimCell_18 Int)) (let ((.cse78 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse77 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_prenex_1 (Array Int Int))) (let ((.cse76 (store .cse77 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_1))) (or (forall ((v_arrayElimCell_19 Int) (v_arrayElimCell_22 Int)) (<= 10 (select (select .cse76 v_arrayElimCell_19) v_arrayElimCell_22))) (< 9 (select (select .cse76 v_arrayElimCell_18) 0))))) (< (select (select .cse77 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (< 20 .cse78) (< .cse78 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimCell_18 Int)) (let ((.cse81 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse80 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_arrayElimCell_19 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse79 (store .cse80 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11))) (or (< 9 (select (select .cse79 v_arrayElimCell_19) v_arrayElimCell_22)) (< 9 (select (select .cse79 v_arrayElimCell_18) 0))))) (< 19 (select (select .cse80 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (< 20 .cse81) (< .cse81 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_arrayElimCell_18 Int) (v_prenex_2 (Array Int Int))) (let ((.cse82 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6)) (.cse83 (select v_arrayElimArr_6 0))) (or (< (select (select (store .cse82 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2) v_arrayElimCell_18) 0) 21) (< 19 (select (select .cse82 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (< 20 .cse83) (< .cse83 10)))))))) (.cse4 (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse2 (not (= .cse5 0))) (.cse6 (= |c_ULTIMATE.start_main_~tail~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse3 (and (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse26 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse25 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_arrayElimCell_19 Int) (v_prenex_2 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse24 (store .cse25 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2))) (or (< (select (select .cse24 v_arrayElimCell_17) v_arrayElimCell_21) 21) (< (select (select .cse24 v_arrayElimCell_19) v_arrayElimCell_22) 21)))) (< 19 (select (select .cse25 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (< 20 .cse26) (< .cse26 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_arrayElimCell_18 Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse27 (select v_arrayElimArr_6 0)) (.cse28 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 20 .cse27) (< .cse27 10) (< (select (select .cse28 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20) (< (select (select (store .cse28 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14) v_arrayElimCell_18) v_arrayElimCell_21) 21)))))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse30 (select v_arrayElimArr_6 0)) (.cse29 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< (select (select (store .cse29 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14) v_arrayElimCell_17) v_arrayElimCell_21) 21) (< 20 .cse30) (< .cse30 10) (< (select (select .cse29 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_arrayElimCell_18 Int) (v_prenex_2 (Array Int Int))) (let ((.cse32 (select v_arrayElimArr_6 0)) (.cse31 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 19 (select (select .cse31 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (< 20 .cse32) (< .cse32 10) (< (select (select (store .cse31 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2) v_arrayElimCell_18) v_arrayElimCell_21) 21)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_prenex_1 (Array Int Int))) (let ((.cse34 (select v_arrayElimArr_6 0)) (.cse33 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 9 (select (select (store .cse33 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_1) v_arrayElimCell_17) v_arrayElimCell_21)) (< 20 .cse34) (< .cse34 10) (< (select (select .cse33 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse35 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6)) (.cse36 (select v_arrayElimArr_6 0))) (or (< 9 (select (select (store .cse35 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11) v_arrayElimCell_17) v_arrayElimCell_21)) (< 19 (select (select .cse35 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (< 20 .cse36) (< .cse36 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse37 (select v_arrayElimArr_6 0))) (or (< 20 .cse37) (< .cse37 10) (forall ((v_ArrVal_233 Int)) (let ((.cse38 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 19 (select (select .cse38 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (forall ((v_arrayElimCell_19 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse39 (store .cse38 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11))) (or (< 9 (select (select .cse39 v_arrayElimCell_17) v_arrayElimCell_21)) (< 9 (select (select .cse39 v_arrayElimCell_19) v_arrayElimCell_22))))))))))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse42 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse41 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_prenex_1 (Array Int Int))) (let ((.cse40 (store .cse41 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_1))) (or (forall ((v_arrayElimCell_19 Int) (v_arrayElimCell_22 Int)) (<= 10 (select (select .cse40 v_arrayElimCell_19) v_arrayElimCell_22))) (< 9 (select (select .cse40 v_arrayElimCell_17) v_arrayElimCell_21))))) (< (select (select .cse41 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (< 20 .cse42) (< .cse42 10)))))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimCell_18 Int)) (let ((.cse45 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse43 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 19 (select (select .cse43 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (forall ((v_arrayElimCell_19 Int) (v_prenex_2 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse44 (store .cse43 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2))) (or (< (select (select .cse44 v_arrayElimCell_19) v_arrayElimCell_22) 21) (< (select (select .cse44 v_arrayElimCell_18) v_arrayElimCell_21) 21))))))) (< 20 .cse45) (< .cse45 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimCell_18 Int)) (let ((.cse48 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse47 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_arrayElimCell_19 Int) (v_DerPreprocessor_14 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse46 (store .cse47 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14))) (or (< (select (select .cse46 v_arrayElimCell_19) v_arrayElimCell_22) 21) (< (select (select .cse46 v_arrayElimCell_18) v_arrayElimCell_21) 21)))) (< (select (select .cse47 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (< 20 .cse48) (< .cse48 10)))))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_prenex_2 (Array Int Int))) (let ((.cse49 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6)) (.cse50 (select v_arrayElimArr_6 0))) (or (< (select (select (store .cse49 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2) v_arrayElimCell_17) v_arrayElimCell_21) 21) (< 19 (select (select .cse49 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (< 20 .cse50) (< .cse50 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_arrayElimCell_18 Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse51 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6)) (.cse52 (select v_arrayElimArr_6 0))) (or (< 9 (select (select (store .cse51 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11) v_arrayElimCell_18) v_arrayElimCell_21)) (< 19 (select (select .cse51 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (< 20 .cse52) (< .cse52 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimCell_18 Int)) (let ((.cse53 (select v_arrayElimArr_6 0))) (or (< 20 .cse53) (< .cse53 10) (forall ((v_ArrVal_233 Int)) (let ((.cse54 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 19 (select (select .cse54 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (forall ((v_arrayElimCell_19 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse55 (store .cse54 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11))) (or (< 9 (select (select .cse55 v_arrayElimCell_18) v_arrayElimCell_21)) (< 9 (select (select .cse55 v_arrayElimCell_19) v_arrayElimCell_22))))))))))))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse58 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse57 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_arrayElimCell_19 Int) (v_DerPreprocessor_14 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse56 (store .cse57 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14))) (or (< (select (select .cse56 v_arrayElimCell_17) v_arrayElimCell_21) 21) (< (select (select .cse56 v_arrayElimCell_19) v_arrayElimCell_22) 21)))) (< (select (select .cse57 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (< 20 .cse58) (< .cse58 10)))))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimCell_18 Int)) (let ((.cse61 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse60 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_prenex_1 (Array Int Int))) (let ((.cse59 (store .cse60 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_1))) (or (forall ((v_arrayElimCell_19 Int) (v_arrayElimCell_22 Int)) (<= 10 (select (select .cse59 v_arrayElimCell_19) v_arrayElimCell_22))) (< 9 (select (select .cse59 v_arrayElimCell_18) v_arrayElimCell_21))))) (< (select (select .cse60 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (< 20 .cse61) (< .cse61 10)))))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_arrayElimCell_18 Int) (v_prenex_1 (Array Int Int))) (let ((.cse63 (select v_arrayElimArr_6 0)) (.cse62 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 9 (select (select (store .cse62 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_1) v_arrayElimCell_18) v_arrayElimCell_21)) (< 20 .cse63) (< .cse63 10) (< (select (select .cse62 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))))) (.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) 0)) (.cse9 (= |c_ULTIMATE.start_main_~tail~0#1.offset| 0))) (and (or (forall ((v_ArrVal_233 Int) (v_arrayElimCell_19 Int) (v_DerPreprocessor_14 (Array Int Int)) (v_arrayElimCell_22 Int)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14) v_arrayElimCell_19) v_arrayElimCell_22) 21)) .cse2) (or .cse3 .cse4) (= .cse5 1) (or .cse2 (forall ((v_ArrVal_233 Int) (v_arrayElimCell_19 Int) (v_prenex_2 (Array Int Int)) (v_arrayElimCell_22 Int)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2) v_arrayElimCell_19) v_arrayElimCell_22) 21))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (or .cse6 .cse7) (or .cse7 .cse4) (<= .cse8 10) (not (= .cse1 0)) .cse4 (or (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base|) 4) 0) .cse9) (forall ((v_arrayElimCell_17 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse12 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_arrayElimCell_19 Int) (v_DerPreprocessor_14 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14))) (or (< (select (select .cse10 v_arrayElimCell_19) v_arrayElimCell_22) 21) (< (select (select .cse10 v_arrayElimCell_17) 0) 21)))) (< (select (select .cse11 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (< 20 .cse12) (< .cse12 10)))))) (or (forall ((v_ArrVal_233 Int) (v_arrayElimCell_19 Int) (v_prenex_1 (Array Int Int)) (v_arrayElimCell_22 Int)) (< 9 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_1) v_arrayElimCell_19) v_arrayElimCell_22))) .cse2) (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse15 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_arrayElimCell_19 Int) (v_prenex_2 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2))) (or (< (select (select .cse13 v_arrayElimCell_17) 0) 21) (< (select (select .cse13 v_arrayElimCell_19) v_arrayElimCell_22) 21)))) (< 19 (select (select .cse14 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (< 20 .cse15) (< .cse15 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (or (forall ((v_ArrVal_233 Int) (v_arrayElimCell_19 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_arrayElimCell_22 Int)) (< 9 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11) v_arrayElimCell_19) v_arrayElimCell_22))) .cse2) (or .cse6 .cse3) .cse9 (= .cse8 10) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base|) 4) 0) .cse9) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) 4))) (or (= .cse16 0) (let ((.cse17 (select (select |c_#memory_int| .cse16) 0))) (and (<= .cse17 20) (<= 10 .cse17) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse16)))))) (= (select .cse0 0) 10) (forall ((v_arrayElimCell_17 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse20 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 19 (select (select .cse18 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (forall ((v_arrayElimCell_19 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse19 (store .cse18 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11))) (or (< 9 (select (select .cse19 v_arrayElimCell_19) v_arrayElimCell_22)) (< 9 (select (select .cse19 v_arrayElimCell_17) 0)))))))) (< 20 .cse20) (< .cse20 10)))))) (forall ((v_arrayElimCell_17 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse23 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse22 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_prenex_1 (Array Int Int))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_1))) (or (forall ((v_arrayElimCell_19 Int) (v_arrayElimCell_22 Int)) (<= 10 (select (select .cse21 v_arrayElimCell_19) v_arrayElimCell_22))) (< 9 (select (select .cse21 v_arrayElimCell_17) 0))))) (< (select (select .cse22 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (< 20 .cse23) (< .cse23 10))))))))) is different from true [2024-11-09 01:19:26,282 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse7 (and (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimCell_18 Int)) (let ((.cse63 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse62 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_arrayElimCell_19 Int) (v_prenex_2 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse61 (store .cse62 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2))) (or (< (select (select .cse61 v_arrayElimCell_19) v_arrayElimCell_22) 21) (< (select (select .cse61 v_arrayElimCell_18) 0) 21)))) (< 19 (select (select .cse62 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (< 20 .cse63) (< .cse63 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_arrayElimCell_18 Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse64 (select v_arrayElimArr_6 0)) (.cse65 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 20 .cse64) (< (select (select (store .cse65 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14) v_arrayElimCell_18) 0) 21) (< .cse64 10) (< (select (select .cse65 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))))) (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimCell_18 Int)) (let ((.cse68 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse67 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_arrayElimCell_19 Int) (v_DerPreprocessor_14 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse66 (store .cse67 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14))) (or (< (select (select .cse66 v_arrayElimCell_18) 0) 21) (< (select (select .cse66 v_arrayElimCell_19) v_arrayElimCell_22) 21)))) (< (select (select .cse67 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (< 20 .cse68) (< .cse68 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_arrayElimCell_18 Int) (v_prenex_1 (Array Int Int))) (let ((.cse69 (select v_arrayElimArr_6 0)) (.cse70 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 20 .cse69) (< .cse69 10) (< 9 (select (select (store .cse70 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_1) v_arrayElimCell_18) 0)) (< (select (select .cse70 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))))) (forall ((v_arrayElimCell_17 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_arrayElimCell_18 Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse71 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6)) (.cse72 (select v_arrayElimArr_6 0))) (or (< 9 (select (select (store .cse71 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11) v_arrayElimCell_18) 0)) (< 19 (select (select .cse71 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (< 20 .cse72) (< .cse72 10)))))) (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimCell_18 Int)) (let ((.cse75 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse74 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_prenex_1 (Array Int Int))) (let ((.cse73 (store .cse74 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_1))) (or (forall ((v_arrayElimCell_19 Int) (v_arrayElimCell_22 Int)) (<= 10 (select (select .cse73 v_arrayElimCell_19) v_arrayElimCell_22))) (< 9 (select (select .cse73 v_arrayElimCell_18) 0))))) (< (select (select .cse74 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (< 20 .cse75) (< .cse75 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimCell_18 Int)) (let ((.cse78 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse77 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_arrayElimCell_19 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse76 (store .cse77 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11))) (or (< 9 (select (select .cse76 v_arrayElimCell_19) v_arrayElimCell_22)) (< 9 (select (select .cse76 v_arrayElimCell_18) 0))))) (< 19 (select (select .cse77 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (< 20 .cse78) (< .cse78 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_arrayElimCell_18 Int) (v_prenex_2 (Array Int Int))) (let ((.cse79 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6)) (.cse80 (select v_arrayElimArr_6 0))) (or (< (select (select (store .cse79 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2) v_arrayElimCell_18) 0) 21) (< 19 (select (select .cse79 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (< 20 .cse80) (< .cse80 10)))))))) (.cse4 (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse2 (not (= .cse5 0))) (.cse6 (= |c_ULTIMATE.start_main_~tail~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse3 (and (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse23 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse22 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_arrayElimCell_19 Int) (v_prenex_2 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2))) (or (< (select (select .cse21 v_arrayElimCell_17) v_arrayElimCell_21) 21) (< (select (select .cse21 v_arrayElimCell_19) v_arrayElimCell_22) 21)))) (< 19 (select (select .cse22 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (< 20 .cse23) (< .cse23 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_arrayElimCell_18 Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse24 (select v_arrayElimArr_6 0)) (.cse25 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 20 .cse24) (< .cse24 10) (< (select (select .cse25 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20) (< (select (select (store .cse25 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14) v_arrayElimCell_18) v_arrayElimCell_21) 21)))))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse27 (select v_arrayElimArr_6 0)) (.cse26 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< (select (select (store .cse26 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14) v_arrayElimCell_17) v_arrayElimCell_21) 21) (< 20 .cse27) (< .cse27 10) (< (select (select .cse26 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_arrayElimCell_18 Int) (v_prenex_2 (Array Int Int))) (let ((.cse29 (select v_arrayElimArr_6 0)) (.cse28 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 19 (select (select .cse28 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (< 20 .cse29) (< .cse29 10) (< (select (select (store .cse28 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2) v_arrayElimCell_18) v_arrayElimCell_21) 21)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_prenex_1 (Array Int Int))) (let ((.cse31 (select v_arrayElimArr_6 0)) (.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 9 (select (select (store .cse30 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_1) v_arrayElimCell_17) v_arrayElimCell_21)) (< 20 .cse31) (< .cse31 10) (< (select (select .cse30 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse32 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6)) (.cse33 (select v_arrayElimArr_6 0))) (or (< 9 (select (select (store .cse32 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11) v_arrayElimCell_17) v_arrayElimCell_21)) (< 19 (select (select .cse32 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (< 20 .cse33) (< .cse33 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse34 (select v_arrayElimArr_6 0))) (or (< 20 .cse34) (< .cse34 10) (forall ((v_ArrVal_233 Int)) (let ((.cse35 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 19 (select (select .cse35 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (forall ((v_arrayElimCell_19 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse36 (store .cse35 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11))) (or (< 9 (select (select .cse36 v_arrayElimCell_17) v_arrayElimCell_21)) (< 9 (select (select .cse36 v_arrayElimCell_19) v_arrayElimCell_22))))))))))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse39 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse38 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_prenex_1 (Array Int Int))) (let ((.cse37 (store .cse38 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_1))) (or (forall ((v_arrayElimCell_19 Int) (v_arrayElimCell_22 Int)) (<= 10 (select (select .cse37 v_arrayElimCell_19) v_arrayElimCell_22))) (< 9 (select (select .cse37 v_arrayElimCell_17) v_arrayElimCell_21))))) (< (select (select .cse38 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (< 20 .cse39) (< .cse39 10)))))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimCell_18 Int)) (let ((.cse42 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse40 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 19 (select (select .cse40 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (forall ((v_arrayElimCell_19 Int) (v_prenex_2 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse41 (store .cse40 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2))) (or (< (select (select .cse41 v_arrayElimCell_19) v_arrayElimCell_22) 21) (< (select (select .cse41 v_arrayElimCell_18) v_arrayElimCell_21) 21))))))) (< 20 .cse42) (< .cse42 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimCell_18 Int)) (let ((.cse45 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse44 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_arrayElimCell_19 Int) (v_DerPreprocessor_14 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse43 (store .cse44 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14))) (or (< (select (select .cse43 v_arrayElimCell_19) v_arrayElimCell_22) 21) (< (select (select .cse43 v_arrayElimCell_18) v_arrayElimCell_21) 21)))) (< (select (select .cse44 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (< 20 .cse45) (< .cse45 10)))))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_prenex_2 (Array Int Int))) (let ((.cse46 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6)) (.cse47 (select v_arrayElimArr_6 0))) (or (< (select (select (store .cse46 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2) v_arrayElimCell_17) v_arrayElimCell_21) 21) (< 19 (select (select .cse46 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (< 20 .cse47) (< .cse47 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_arrayElimCell_18 Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse48 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6)) (.cse49 (select v_arrayElimArr_6 0))) (or (< 9 (select (select (store .cse48 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11) v_arrayElimCell_18) v_arrayElimCell_21)) (< 19 (select (select .cse48 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (< 20 .cse49) (< .cse49 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimCell_18 Int)) (let ((.cse50 (select v_arrayElimArr_6 0))) (or (< 20 .cse50) (< .cse50 10) (forall ((v_ArrVal_233 Int)) (let ((.cse51 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 19 (select (select .cse51 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (forall ((v_arrayElimCell_19 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse52 (store .cse51 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11))) (or (< 9 (select (select .cse52 v_arrayElimCell_18) v_arrayElimCell_21)) (< 9 (select (select .cse52 v_arrayElimCell_19) v_arrayElimCell_22))))))))))))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse55 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse54 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_arrayElimCell_19 Int) (v_DerPreprocessor_14 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse53 (store .cse54 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14))) (or (< (select (select .cse53 v_arrayElimCell_17) v_arrayElimCell_21) 21) (< (select (select .cse53 v_arrayElimCell_19) v_arrayElimCell_22) 21)))) (< (select (select .cse54 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (< 20 .cse55) (< .cse55 10)))))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimCell_18 Int)) (let ((.cse58 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse57 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_prenex_1 (Array Int Int))) (let ((.cse56 (store .cse57 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_1))) (or (forall ((v_arrayElimCell_19 Int) (v_arrayElimCell_22 Int)) (<= 10 (select (select .cse56 v_arrayElimCell_19) v_arrayElimCell_22))) (< 9 (select (select .cse56 v_arrayElimCell_18) v_arrayElimCell_21))))) (< (select (select .cse57 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (< 20 .cse58) (< .cse58 10)))))) (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_21 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_17) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_233 Int) (v_arrayElimCell_18 Int) (v_prenex_1 (Array Int Int))) (let ((.cse60 (select v_arrayElimArr_6 0)) (.cse59 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 9 (select (select (store .cse59 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_1) v_arrayElimCell_18) v_arrayElimCell_21)) (< 20 .cse60) (< .cse60 10) (< (select (select .cse59 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))))) (.cse8 (= |c_ULTIMATE.start_main_~tail~0#1.offset| 0))) (and (or (forall ((v_ArrVal_233 Int) (v_arrayElimCell_19 Int) (v_DerPreprocessor_14 (Array Int Int)) (v_arrayElimCell_22 Int)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14) v_arrayElimCell_19) v_arrayElimCell_22) 21)) .cse2) (or .cse3 .cse4) (= .cse5 1) (or .cse2 (forall ((v_ArrVal_233 Int) (v_arrayElimCell_19 Int) (v_prenex_2 (Array Int Int)) (v_arrayElimCell_22 Int)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2) v_arrayElimCell_19) v_arrayElimCell_22) 21))) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (or .cse6 .cse7) (or .cse7 .cse4) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) 0) 10) (not (= .cse1 0)) .cse4 (or (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base|) 4) 0) .cse8) (forall ((v_arrayElimCell_17 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_arrayElimCell_19 Int) (v_DerPreprocessor_14 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14))) (or (< (select (select .cse9 v_arrayElimCell_19) v_arrayElimCell_22) 21) (< (select (select .cse9 v_arrayElimCell_17) 0) 21)))) (< (select (select .cse10 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (< 20 .cse11) (< .cse11 10)))))) (or (forall ((v_ArrVal_233 Int) (v_arrayElimCell_19 Int) (v_prenex_1 (Array Int Int)) (v_arrayElimCell_22 Int)) (< 9 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_1) v_arrayElimCell_19) v_arrayElimCell_22))) .cse2) (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse14 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_arrayElimCell_19 Int) (v_prenex_2 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_2))) (or (< (select (select .cse12 v_arrayElimCell_17) 0) 21) (< (select (select .cse12 v_arrayElimCell_19) v_arrayElimCell_22) 21)))) (< 19 (select (select .cse13 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (< 20 .cse14) (< .cse14 10)))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)))) (or (forall ((v_ArrVal_233 Int) (v_arrayElimCell_19 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_arrayElimCell_22 Int)) (< 9 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11) v_arrayElimCell_19) v_arrayElimCell_22))) .cse2) (or .cse6 .cse3) .cse8 (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base|) 4) 0) .cse8) (= (select .cse0 0) 10) (forall ((v_arrayElimCell_17 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse17 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (< 19 (select (select .cse15 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (forall ((v_arrayElimCell_19 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse16 (store .cse15 |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11))) (or (< 9 (select (select .cse16 v_arrayElimCell_19) v_arrayElimCell_22)) (< 9 (select (select .cse16 v_arrayElimCell_17) 0)))))))) (< 20 .cse17) (< .cse17 10)))))) (forall ((v_arrayElimCell_17 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse20 (select v_arrayElimArr_6 0))) (or (forall ((v_ArrVal_233 Int)) (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse0 .cse1 v_ArrVal_233)) v_arrayElimCell_17 v_arrayElimArr_6))) (or (forall ((v_prenex_1 (Array Int Int))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_1))) (or (forall ((v_arrayElimCell_19 Int) (v_arrayElimCell_22 Int)) (<= 10 (select (select .cse18 v_arrayElimCell_19) v_arrayElimCell_22))) (< 9 (select (select .cse18 v_arrayElimCell_17) 0))))) (< (select (select .cse19 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 20)))) (< 20 .cse20) (< .cse20 10))))))))) is different from true [2024-11-09 01:19:27,061 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse7 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse6)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse6)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (or (and (forall ((v_DerPreprocessor_11 (Array Int Int))) (<= 10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11) .cse0) .cse1))) (forall ((v_DerPreprocessor_11 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11) .cse0) .cse1) 20))) (< 19 .cse2)) (or (and (forall ((v_DerPreprocessor_14 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14) .cse0) .cse1) 20)) (forall ((v_DerPreprocessor_14 (Array Int Int))) (<= 10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14) .cse0) .cse1)))) (< .cse2 20)) (or (and (forall ((v_DerPreprocessor_14 (Array Int Int))) (<= 10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_DerPreprocessor_14) .cse3) .cse4))) (forall ((v_DerPreprocessor_14 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_DerPreprocessor_14) .cse3) .cse4) 20))) (< .cse5 20)) (or (and (forall ((v_DerPreprocessor_11 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_DerPreprocessor_11) .cse3) .cse4) 20)) (forall ((v_DerPreprocessor_11 (Array Int Int))) (<= 10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_DerPreprocessor_11) .cse3) .cse4)))) (< 19 .cse5))))) is different from false [2024-11-09 01:19:27,095 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse4)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse4)) (.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) 0))) (and (<= 10 .cse0) |c_ULTIMATE.start_main_#t~short9#1| (or (and (forall ((v_DerPreprocessor_11 (Array Int Int))) (<= 10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11) .cse1) .cse2))) (forall ((v_DerPreprocessor_11 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11) .cse1) .cse2) 20))) (< 19 .cse3)) (or (and (forall ((v_DerPreprocessor_14 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14) .cse1) .cse2) 20)) (forall ((v_DerPreprocessor_14 (Array Int Int))) (<= 10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_14) .cse1) .cse2)))) (< .cse3 20)) (<= .cse0 20) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0)))) is different from false [2024-11-09 01:19:27,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:19:27,245 INFO L93 Difference]: Finished difference Result 77 states and 109 transitions. [2024-11-09 01:19:27,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 01:19:27,246 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 01:19:27,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:19:27,248 INFO L225 Difference]: With dead ends: 77 [2024-11-09 01:19:27,248 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 01:19:27,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=129, Invalid=580, Unknown=13, NotChecked=270, Total=992 [2024-11-09 01:19:27,253 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 27 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 3 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 158 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:19:27,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 136 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 184 Invalid, 10 Unknown, 158 Unchecked, 0.5s Time] [2024-11-09 01:19:27,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 01:19:27,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 61. [2024-11-09 01:19:27,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 60 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:27,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 89 transitions. [2024-11-09 01:19:27,288 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 89 transitions. Word has length 17 [2024-11-09 01:19:27,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:19:27,288 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 89 transitions. [2024-11-09 01:19:27,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 89 transitions. [2024-11-09 01:19:27,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 01:19:27,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:19:27,291 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:19:27,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 01:19:27,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:19:27,492 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:19:27,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:27,493 INFO L85 PathProgramCache]: Analyzing trace with hash -592060098, now seen corresponding path program 1 times [2024-11-09 01:19:27,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:19:27,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458545613] [2024-11-09 01:19:27,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:27,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:19:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:28,123 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:19:28,123 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:19:28,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458545613] [2024-11-09 01:19:28,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458545613] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:19:28,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295802304] [2024-11-09 01:19:28,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:28,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:19:28,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:19:28,126 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:19:28,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 01:19:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:28,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 01:19:28,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:19:28,248 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-09 01:19:28,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-09 01:19:28,346 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-09 01:19:28,359 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-09 01:19:28,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 01:19:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:19:28,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:19:28,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:19:28,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 85 [2024-11-09 01:19:28,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:19:28,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 79 [2024-11-09 01:19:28,773 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-09 01:19:28,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-11-09 01:19:28,787 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-09 01:19:28,787 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 24 treesize of output 12 [2024-11-09 01:19:28,826 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:19:28,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295802304] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:19:28,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1085836969] [2024-11-09 01:19:28,828 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-09 01:19:28,828 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:19:28,828 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:19:28,828 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:19:28,828 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:19:29,500 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:19:30,272 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '856#true' at error location [2024-11-09 01:19:30,272 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:19:30,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:19:30,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-09 01:19:30,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693010539] [2024-11-09 01:19:30,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:19:30,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 01:19:30,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:19:30,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 01:19:30,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2024-11-09 01:19:30,275 INFO L87 Difference]: Start difference. First operand 61 states and 89 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:30,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:19:30,718 INFO L93 Difference]: Finished difference Result 122 states and 177 transitions. [2024-11-09 01:19:30,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 01:19:30,719 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 01:19:30,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:19:30,720 INFO L225 Difference]: With dead ends: 122 [2024-11-09 01:19:30,720 INFO L226 Difference]: Without dead ends: 68 [2024-11-09 01:19:30,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2024-11-09 01:19:30,722 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:19:30,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 101 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:19:30,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-09 01:19:30,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2024-11-09 01:19:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 63 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:30,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2024-11-09 01:19:30,740 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 19 [2024-11-09 01:19:30,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:19:30,740 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2024-11-09 01:19:30,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:30,741 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2024-11-09 01:19:30,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 01:19:30,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:19:30,742 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:19:30,757 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 01:19:30,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:19:30,946 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:19:30,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:30,947 INFO L85 PathProgramCache]: Analyzing trace with hash 797711971, now seen corresponding path program 1 times [2024-11-09 01:19:30,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:19:30,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099402967] [2024-11-09 01:19:30,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:30,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:19:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:31,747 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 01:19:31,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:19:31,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099402967] [2024-11-09 01:19:31,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099402967] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:19:31,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225475173] [2024-11-09 01:19:31,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:31,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:19:31,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:19:31,751 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:19:31,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 01:19:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:31,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 01:19:31,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:19:31,875 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-09 01:19:31,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:19:32,018 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 26 [2024-11-09 01:19:32,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2024-11-09 01:19:32,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-09 01:19:32,056 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 01:19:32,056 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 100 treesize of output 87 [2024-11-09 01:19:32,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2024-11-09 01:19:32,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 01:19:32,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 01:19:32,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-09 01:19:32,327 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 26 [2024-11-09 01:19:32,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2024-11-09 01:19:32,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2024-11-09 01:19:32,352 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-09 01:19:32,407 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 01:19:32,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:19:32,734 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (or (< .cse0 20) (and (forall ((v_DerPreprocessor_27 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_27) .cse1) .cse2) 20)) (forall ((v_DerPreprocessor_27 (Array Int Int))) (<= 10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_27) .cse1) .cse2))))) (or (and (forall ((v_DerPreprocessor_24 (Array Int Int))) (<= 10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_24) .cse1) .cse2))) (forall ((v_DerPreprocessor_24 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_24) .cse1) .cse2) 20))) (< 19 .cse0))))) is different from false [2024-11-09 01:19:32,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:19:32,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 265 treesize of output 254 [2024-11-09 01:19:32,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:19:32,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 218 [2024-11-09 01:19:32,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:19:32,936 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 560 treesize of output 385 [2024-11-09 01:19:32,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 367 treesize of output 351 [2024-11-09 01:19:32,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:19:32,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 351 treesize of output 282 [2024-11-09 01:19:33,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:19:33,021 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 498 treesize of output 455 [2024-11-09 01:19:33,044 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 215 treesize of output 199 [2024-11-09 01:19:37,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:19:37,980 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 16 treesize of output 18 [2024-11-09 01:19:38,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:19:38,004 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 16 treesize of output 18 [2024-11-09 01:19:38,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:19:38,381 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 16 treesize of output 18 [2024-11-09 01:19:39,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:19:39,005 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 16 treesize of output 18 [2024-11-09 01:19:56,103 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 5 not checked. [2024-11-09 01:19:56,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225475173] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:19:56,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1316042594] [2024-11-09 01:19:56,105 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-09 01:19:56,106 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:19:56,106 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:19:56,106 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:19:56,106 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:19:56,573 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:19:58,714 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1372#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= |ULTIMATE.start_main_~tail~0#1.offset| 0))' at error location [2024-11-09 01:19:58,714 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:19:58,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:19:58,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-09 01:19:58,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149481540] [2024-11-09 01:19:58,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:19:58,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 01:19:58,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:19:58,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 01:19:58,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=4, NotChecked=30, Total=306 [2024-11-09 01:19:58,716 INFO L87 Difference]: Start difference. First operand 64 states and 89 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:19:59,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 01:20:04,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 01:20:04,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:20:04,082 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2024-11-09 01:20:04,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:20:04,083 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 01:20:04,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:20:04,086 INFO L225 Difference]: With dead ends: 75 [2024-11-09 01:20:04,086 INFO L226 Difference]: Without dead ends: 73 [2024-11-09 01:20:04,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=4, NotChecked=34, Total=380 [2024-11-09 01:20:04,087 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:20:04,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 106 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 1 Unknown, 22 Unchecked, 5.2s Time] [2024-11-09 01:20:04,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-09 01:20:04,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2024-11-09 01:20:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:20:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2024-11-09 01:20:04,103 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 20 [2024-11-09 01:20:04,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:20:04,103 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2024-11-09 01:20:04,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:20:04,104 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2024-11-09 01:20:04,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 01:20:04,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:20:04,104 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:20:04,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 01:20:04,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:20:04,305 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:20:04,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:20:04,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1900715749, now seen corresponding path program 2 times [2024-11-09 01:20:04,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:20:04,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724772309] [2024-11-09 01:20:04,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:20:04,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:20:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:20:05,251 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:20:05,252 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:20:05,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724772309] [2024-11-09 01:20:05,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724772309] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:20:05,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415812403] [2024-11-09 01:20:05,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 01:20:05,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:20:05,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:20:05,257 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:20:05,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 01:20:05,397 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 01:20:05,398 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:20:05,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 01:20:05,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:20:05,411 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-09 01:20:05,487 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-09 01:20:05,488 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 1 case distinctions, treesize of input 46 treesize of output 19 [2024-11-09 01:20:05,504 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-09 01:20:05,505 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 1 case distinctions, treesize of input 54 treesize of output 11 [2024-11-09 01:20:05,519 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 01:20:05,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-09 01:20:05,691 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 95 [2024-11-09 01:20:05,706 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 01:20:05,707 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 99 [2024-11-09 01:20:05,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 76 [2024-11-09 01:20:05,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2024-11-09 01:20:05,821 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 01:20:06,021 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 01:20:06,022 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 199 treesize of output 127 [2024-11-09 01:20:06,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 111 [2024-11-09 01:20:06,042 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 0 case distinctions, treesize of input 95 treesize of output 80 [2024-11-09 01:20:06,055 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 44 treesize of output 36 [2024-11-09 01:20:06,080 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:20:06,080 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:20:06,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:20:06,229 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 107 [2024-11-09 01:20:06,237 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 85 treesize of output 77 [2024-11-09 01:20:06,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:20:06,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 220 [2024-11-09 01:20:06,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:20:06,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 101578 treesize of output 96635 [2024-11-09 01:20:09,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:20:09,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 18634 treesize of output 18436 [2024-11-09 01:20:12,018 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 8 treesize of output 4 [2024-11-09 01:24:43,950 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 3 [2024-11-09 01:24:44,471 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 3 [2024-11-09 01:24:45,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 7 treesize of output 3 [2024-11-09 01:24:51,235 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 3 [2024-11-09 01:24:51,901 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 3 [2024-11-09 01:24:52,874 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 3 [2024-11-09 01:25:07,809 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 3 [2024-11-09 01:25:08,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 01:25:09,538 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 3 [2024-11-09 01:25:12,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:25:12,584 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 3628 treesize of output 3624 [2024-11-09 01:25:42,553 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 3 [2024-11-09 01:25:43,201 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 3 [2024-11-09 01:25:44,875 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 3 [2024-11-09 01:27:16,955 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-09 01:27:16,956 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2024-11-09 01:27:16,956 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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-09 01:27:16,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1721913376] [2024-11-09 01:27:16,959 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-09 01:27:16,959 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:27:16,959 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:27:16,959 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:27:16,959 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:27:16,962 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java: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:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 44 more [2024-11-09 01:27:16,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:27:16,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-11-09 01:27:16,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318051257] [2024-11-09 01:27:16,966 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 01:27:16,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:27:16,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:27:16,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:27:16,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:27:16,967 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:16,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:27:16,971 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-09 01:27:16,972 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-09 01:27:16,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 01:27:17,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:17,173 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_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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:1655) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:658) 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:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java: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:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2024-11-09 01:27:17,176 INFO L158 Benchmark]: Toolchain (without parser) took 516806.28ms. Allocated memory was 151.0MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 112.1MB in the beginning and 797.0MB in the end (delta: -685.0MB). Peak memory consumption was 882.7MB. Max. memory is 16.1GB. [2024-11-09 01:27:17,176 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 111.1MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:27:17,176 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.30ms. Allocated memory is still 151.0MB. Free memory was 111.4MB in the beginning and 92.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 01:27:17,176 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.31ms. Allocated memory is still 151.0MB. Free memory was 91.9MB in the beginning and 90.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:27:17,180 INFO L158 Benchmark]: Boogie Preprocessor took 46.39ms. Allocated memory is still 151.0MB. Free memory was 90.5MB in the beginning and 89.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:27:17,180 INFO L158 Benchmark]: RCFGBuilder took 443.66ms. Allocated memory is still 151.0MB. Free memory was 89.0MB in the beginning and 72.4MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 01:27:17,180 INFO L158 Benchmark]: TraceAbstraction took 515705.34ms. Allocated memory was 151.0MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 71.6MB in the beginning and 797.0MB in the end (delta: -725.4MB). Peak memory consumption was 840.7MB. Max. memory is 16.1GB. [2024-11-09 01:27:17,182 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.35ms. Allocated memory is still 111.1MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 561.30ms. Allocated memory is still 151.0MB. Free memory was 111.4MB in the beginning and 92.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.31ms. Allocated memory is still 151.0MB. Free memory was 91.9MB in the beginning and 90.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.39ms. Allocated memory is still 151.0MB. Free memory was 90.5MB in the beginning and 89.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 443.66ms. Allocated memory is still 151.0MB. Free memory was 89.0MB in the beginning and 72.4MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 515705.34ms. Allocated memory was 151.0MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 71.6MB in the beginning and 797.0MB in the end (delta: -725.4MB). Peak memory consumption was 840.7MB. 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_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-data/running_example.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje --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 318c7aa22aeecc0174739978e9fb15d261281003454726c8705d95a97106063f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:27:19,540 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:27:19,638 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 01:27:19,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:27:19,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:27:19,689 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:27:19,690 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:27:19,691 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:27:19,692 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:27:19,693 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:27:19,693 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 01:27:19,693 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 01:27:19,694 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 01:27:19,695 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 01:27:19,697 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 01:27:19,698 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 01:27:19,699 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:27:19,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:27:19,700 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:27:19,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:27:19,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:27:19,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:27:19,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:27:19,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:27:19,705 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:27:19,705 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:27:19,705 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:27:19,706 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:27:19,706 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:27:19,706 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:27:19,706 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:27:19,706 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:27:19,707 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:27:19,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:27:19,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:27:19,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:27:19,709 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:27:19,710 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:27:19,710 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:27:19,710 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 01:27:19,710 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:27:19,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:27:19,711 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 01:27:19,711 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje 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 -> 318c7aa22aeecc0174739978e9fb15d261281003454726c8705d95a97106063f [2024-11-09 01:27:20,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:27:20,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:27:20,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:27:20,177 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:27:20,178 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:27:20,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/heap-data/running_example.i Unable to find full path for "g++" [2024-11-09 01:27:22,309 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:27:22,700 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:27:22,701 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/sv-benchmarks/c/heap-data/running_example.i [2024-11-09 01:27:22,723 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/data/02d780fe6/c9c7b417bbe445dc81f80aae36d29b61/FLAGb4673bdc2 [2024-11-09 01:27:22,893 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/data/02d780fe6/c9c7b417bbe445dc81f80aae36d29b61 [2024-11-09 01:27:22,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:27:22,897 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:27:22,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:27:22,898 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:27:22,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:27:22,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:27:22" (1/1) ... [2024-11-09 01:27:22,905 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7235b0ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:22, skipping insertion in model container [2024-11-09 01:27:22,905 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:27:22" (1/1) ... [2024-11-09 01:27:22,952 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:27:23,414 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_ac16905e-b3aa-4151-86ab-f11c53aefac7/sv-benchmarks/c/heap-data/running_example.i[23610,23623] [2024-11-09 01:27:23,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:27:23,444 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:27:23,500 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_ac16905e-b3aa-4151-86ab-f11c53aefac7/sv-benchmarks/c/heap-data/running_example.i[23610,23623] [2024-11-09 01:27:23,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:27:23,551 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:27:23,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23 WrapperNode [2024-11-09 01:27:23,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:27:23,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:27:23,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:27:23,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:27:23,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23" (1/1) ... [2024-11-09 01:27:23,635 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23" (1/1) ... [2024-11-09 01:27:23,677 INFO L138 Inliner]: procedures = 124, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2024-11-09 01:27:23,679 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:27:23,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:27:23,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:27:23,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:27:23,693 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23" (1/1) ... [2024-11-09 01:27:23,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23" (1/1) ... [2024-11-09 01:27:23,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23" (1/1) ... [2024-11-09 01:27:23,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23" (1/1) ... [2024-11-09 01:27:23,718 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23" (1/1) ... [2024-11-09 01:27:23,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23" (1/1) ... [2024-11-09 01:27:23,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23" (1/1) ... [2024-11-09 01:27:23,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23" (1/1) ... [2024-11-09 01:27:23,737 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:27:23,742 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:27:23,742 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:27:23,743 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:27:23,743 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23" (1/1) ... [2024-11-09 01:27:23,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:27:23,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:27:23,781 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 01:27:23,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 01:27:23,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-09 01:27:23,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 01:27:23,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:27:23,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 01:27:23,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 01:27:23,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-09 01:27:23,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 01:27:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:27:23,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:27:23,976 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:27:23,979 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:27:24,399 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-09 01:27:24,400 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:27:24,411 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:27:24,411 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 01:27:24,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:27:24 BoogieIcfgContainer [2024-11-09 01:27:24,412 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:27:24,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:27:24,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:27:24,419 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:27:24,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:27:22" (1/3) ... [2024-11-09 01:27:24,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41fb4d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:27:24, skipping insertion in model container [2024-11-09 01:27:24,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:23" (2/3) ... [2024-11-09 01:27:24,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41fb4d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:27:24, skipping insertion in model container [2024-11-09 01:27:24,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:27:24" (3/3) ... [2024-11-09 01:27:24,423 INFO L112 eAbstractionObserver]: Analyzing ICFG running_example.i [2024-11-09 01:27:24,444 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:27:24,444 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:27:24,517 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:27:24,525 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;@69cbe98c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:27:24,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:27:24,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:24,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 01:27:24,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:24,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:24,538 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:24,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:24,545 INFO L85 PathProgramCache]: Analyzing trace with hash -520431752, now seen corresponding path program 1 times [2024-11-09 01:27:24,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:27:24,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511651410] [2024-11-09 01:27:24,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:24,558 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-09 01:27:24,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:27:24,561 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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-09 01:27:24,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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-09 01:27:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:24,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:27:24,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:24,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:27:24,728 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:27:24,730 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:27:24,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511651410] [2024-11-09 01:27:24,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511651410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:24,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:24,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:27:24,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047986843] [2024-11-09 01:27:24,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:24,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:27:24,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:27:24,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:27:24,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:27:24,766 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:24,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:24,785 INFO L93 Difference]: Finished difference Result 29 states and 45 transitions. [2024-11-09 01:27:24,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:27:24,787 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 01:27:24,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:24,795 INFO L225 Difference]: With dead ends: 29 [2024-11-09 01:27:24,795 INFO L226 Difference]: Without dead ends: 16 [2024-11-09 01:27:24,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-09 01:27:24,804 INFO L432 NwaCegarLoop]: 22 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, 22 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-09 01:27:24,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:27:24,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-09 01:27:24,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-09 01:27:24,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:24,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2024-11-09 01:27:24,841 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 9 [2024-11-09 01:27:24,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:24,842 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2024-11-09 01:27:24,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:24,842 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2024-11-09 01:27:24,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 01:27:24,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:24,846 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:24,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 01:27:25,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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-09 01:27:25,051 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:25,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:25,052 INFO L85 PathProgramCache]: Analyzing trace with hash -2116136178, now seen corresponding path program 1 times [2024-11-09 01:27:25,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:27:25,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088850487] [2024-11-09 01:27:25,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:25,053 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-09 01:27:25,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:27:25,058 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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-09 01:27:25,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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-09 01:27:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:25,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:27:25,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:25,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 01:27:25,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:27:25,385 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:27:25,386 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:27:25,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088850487] [2024-11-09 01:27:25,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088850487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:25,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:25,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:27:25,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98225871] [2024-11-09 01:27:25,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:25,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:27:25,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:27:25,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:27:25,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:27:25,395 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:25,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:25,899 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2024-11-09 01:27:25,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:27:25,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 01:27:25,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:25,902 INFO L225 Difference]: With dead ends: 37 [2024-11-09 01:27:25,902 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 01:27:25,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:27:25,904 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:25,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 41 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:27:25,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 01:27:25,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2024-11-09 01:27:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:25,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2024-11-09 01:27:25,919 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 11 [2024-11-09 01:27:25,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:25,920 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2024-11-09 01:27:25,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:25,921 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2024-11-09 01:27:25,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 01:27:25,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:25,922 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:25,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 01:27:26,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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-09 01:27:26,124 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:26,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:26,125 INFO L85 PathProgramCache]: Analyzing trace with hash 929942856, now seen corresponding path program 1 times [2024-11-09 01:27:26,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:27:26,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989639921] [2024-11-09 01:27:26,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:26,127 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-09 01:27:26,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:27:26,131 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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-09 01:27:26,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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-09 01:27:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:26,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 01:27:26,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:26,331 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-09 01:27:26,368 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-09 01:27:26,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2024-11-09 01:27:26,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2024-11-09 01:27:26,698 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 13 treesize of output 9 [2024-11-09 01:27:26,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:27:26,840 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:27,012 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_58 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_18| (_ BitVec 32)) (v_ArrVal_60 (Array (_ BitVec 32) (_ BitVec 32)))) (or (bvsge (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_58) |v_ULTIMATE.start_main_~p~0#1.base_18| v_ArrVal_60) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (_ bv10 32)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~p~0#1.base_18|))) (not (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~tail~0#1.offset|))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base|) .cse0 (select v_ArrVal_58 .cse0))) v_ArrVal_58)))) is different from false [2024-11-09 01:27:27,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-09 01:27:27,214 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:27:27,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989639921] [2024-11-09 01:27:27,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989639921] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:27:27,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1247355409] [2024-11-09 01:27:27,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:27,215 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:27:27,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 01:27:27,219 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:27:27,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-09 01:27:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:27,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 01:27:27,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:27,458 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-09 01:27:27,477 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-09 01:27:27,622 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 0 case distinctions, treesize of input 24 treesize of output 26 [2024-11-09 01:27:27,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:27:27,640 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-09 01:27:27,663 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 01:27:27,664 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-09 01:27:27,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:27:27,757 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:28,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:27:28,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1247355409] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:27:28,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592277283] [2024-11-09 01:27:28,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:28,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:28,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:27:28,084 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:27:28,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 01:27:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:28,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 01:27:28,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:28,230 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-09 01:27:28,246 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-09 01:27:28,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2024-11-09 01:27:28,434 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 13 treesize of output 9 [2024-11-09 01:27:28,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2024-11-09 01:27:28,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:27:28,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:28,586 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_26| (_ BitVec 32)) (v_ArrVal_130 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_130 (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~tail~0#1.offset|))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base|) .cse0 (select v_ArrVal_130 .cse0))))) (bvsge (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_130) |v_ULTIMATE.start_main_~p~0#1.base_26| v_ArrVal_131) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (_ bv10 32)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~p~0#1.base_26|))))) is different from false [2024-11-09 01:27:28,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-09 01:27:28,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592277283] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:27:28,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 01:27:28,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 11 [2024-11-09 01:27:28,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82623581] [2024-11-09 01:27:28,702 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 01:27:28,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:27:28,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:27:28,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:27:28,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=52, Unknown=4, NotChecked=30, Total=110 [2024-11-09 01:27:28,705 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:29,405 WARN L851 $PredicateComparison]: unable to prove that (and (= (_ bv10 32) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (_ bv0 32))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) (_ bv0 32)) (_ bv10 32)) (forall ((v_ArrVal_95 (_ BitVec 32)) (|v_ULTIMATE.start_main_~p~0#1.base_22| (_ BitVec 32)) (v_ArrVal_94 (Array (_ BitVec 32) (_ BitVec 32)))) (or (bvsge (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~tail~0#1.offset|) v_ArrVal_95)) |v_ULTIMATE.start_main_~p~0#1.base_22| v_ArrVal_94) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (_ bv10 32)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~p~0#1.base_22|))))) (= (_ bv0 32) |c_ULTIMATE.start_main_~list~0#1.offset|) (= (_ bv0 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) is different from false [2024-11-09 01:27:30,164 WARN L851 $PredicateComparison]: unable to prove that (and (bvsge (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (_ bv10 32)) (forall ((v_ArrVal_95 (_ BitVec 32)) (|v_ULTIMATE.start_main_~p~0#1.base_22| (_ BitVec 32)) (v_ArrVal_94 (Array (_ BitVec 32) (_ BitVec 32)))) (or (bvsge (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~tail~0#1.offset|) v_ArrVal_95)) |v_ULTIMATE.start_main_~p~0#1.base_22| v_ArrVal_94) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (_ bv10 32)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~p~0#1.base_22|))))) (bvsge (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) (_ bv10 32))) is different from false [2024-11-09 01:27:31,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:31,026 INFO L93 Difference]: Finished difference Result 64 states and 93 transitions. [2024-11-09 01:27:31,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 01:27:31,028 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 01:27:31,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:31,029 INFO L225 Difference]: With dead ends: 64 [2024-11-09 01:27:31,029 INFO L226 Difference]: Without dead ends: 54 [2024-11-09 01:27:31,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=140, Unknown=13, NotChecked=116, Total=342 [2024-11-09 01:27:31,031 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 53 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:31,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 114 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 118 Invalid, 3 Unknown, 140 Unchecked, 1.9s Time] [2024-11-09 01:27:31,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-09 01:27:31,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2024-11-09 01:27:31,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 39 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:31,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2024-11-09 01:27:31,052 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 15 [2024-11-09 01:27:31,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:31,055 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2024-11-09 01:27:31,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:31,055 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2024-11-09 01:27:31,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 01:27:31,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:31,056 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:31,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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-09 01:27:31,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-11-09 01:27:31,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 01:27:31,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:31,657 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:31,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:31,658 INFO L85 PathProgramCache]: Analyzing trace with hash 24366089, now seen corresponding path program 1 times [2024-11-09 01:27:31,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:27:31,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689310395] [2024-11-09 01:27:31,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:31,659 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-09 01:27:31,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:27:31,662 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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-09 01:27:31,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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-09 01:27:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:31,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:27:31,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 01:27:31,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:27:31,801 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:27:31,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689310395] [2024-11-09 01:27:31,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689310395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:31,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:31,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:27:31,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610928334] [2024-11-09 01:27:31,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:31,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:27:31,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:27:31,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:27:31,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:27:31,805 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:31,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:31,926 INFO L93 Difference]: Finished difference Result 68 states and 100 transitions. [2024-11-09 01:27:31,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:27:31,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 01:27:31,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:31,929 INFO L225 Difference]: With dead ends: 68 [2024-11-09 01:27:31,929 INFO L226 Difference]: Without dead ends: 49 [2024-11-09 01:27:31,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:27:31,932 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:31,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 29 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:27:31,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-09 01:27:31,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2024-11-09 01:27:31,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:31,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2024-11-09 01:27:31,947 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 17 [2024-11-09 01:27:31,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:31,947 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2024-11-09 01:27:31,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:31,949 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2024-11-09 01:27:31,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 01:27:31,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:31,955 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:31,961 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 01:27:32,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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-09 01:27:32,156 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:32,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:32,157 INFO L85 PathProgramCache]: Analyzing trace with hash -570048688, now seen corresponding path program 1 times [2024-11-09 01:27:32,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:27:32,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824259968] [2024-11-09 01:27:32,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:32,157 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-09 01:27:32,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:27:32,161 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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-09 01:27:32,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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 (8)] Waiting until timeout for monitored process [2024-11-09 01:27:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:32,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 01:27:32,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:32,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-09 01:27:32,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-09 01:27:32,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 01:27:32,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 01:27:32,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:27:32,530 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:32,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:27:32,742 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:27:32,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824259968] [2024-11-09 01:27:32,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824259968] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:27:32,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [554160165] [2024-11-09 01:27:32,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:32,743 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:27:32,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 01:27:32,746 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:27:32,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-09 01:27:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:32,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 01:27:32,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:32,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-09 01:27:32,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-09 01:27:33,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 01:27:33,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 01:27:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:27:33,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:27:33,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [554160165] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:27:33,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420771126] [2024-11-09 01:27:33,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:33,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:33,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:27:33,290 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:27:33,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 01:27:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:33,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 01:27:33,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:33,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-09 01:27:33,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-09 01:27:33,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 01:27:33,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 01:27:33,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:27:33,573 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:33,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:27:33,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420771126] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:27:33,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 01:27:33,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 7 [2024-11-09 01:27:33,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230420657] [2024-11-09 01:27:33,703 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 01:27:33,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:27:33,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:27:33,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:27:33,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:27:33,705 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:34,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:34,308 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2024-11-09 01:27:34,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:27:34,309 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 01:27:34,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:34,309 INFO L225 Difference]: With dead ends: 67 [2024-11-09 01:27:34,310 INFO L226 Difference]: Without dead ends: 55 [2024-11-09 01:27:34,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:27:34,311 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:34,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 80 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:27:34,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-09 01:27:34,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2024-11-09 01:27:34,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 52 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:34,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2024-11-09 01:27:34,323 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 18 [2024-11-09 01:27:34,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:34,323 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2024-11-09 01:27:34,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:34,323 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2024-11-09 01:27:34,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 01:27:34,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:34,324 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:34,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-09 01:27:34,528 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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 (8)] Forceful destruction successful, exit code 0 [2024-11-09 01:27:34,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 01:27:34,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:34,926 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:34,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:34,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1205969412, now seen corresponding path program 1 times [2024-11-09 01:27:34,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:27:34,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226657191] [2024-11-09 01:27:34,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:34,927 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-09 01:27:34,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:27:34,928 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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-09 01:27:34,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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 (11)] Waiting until timeout for monitored process [2024-11-09 01:27:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 01:27:35,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:35,089 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-09 01:27:35,105 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-09 01:27:35,218 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 0 case distinctions, treesize of input 24 treesize of output 26 [2024-11-09 01:27:35,250 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 01:27:35,251 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 16 treesize of output 15 [2024-11-09 01:27:35,285 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 01:27:35,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 01:27:35,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-09 01:27:35,389 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-09 01:27:35,463 INFO L349 Elim1Store]: treesize reduction 14, result has 39.1 percent of original size [2024-11-09 01:27:35,464 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 22 treesize of output 23 [2024-11-09 01:27:35,473 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 12 treesize of output 1 [2024-11-09 01:27:35,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2024-11-09 01:27:35,666 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:27:35,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:35,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:35,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2024-11-09 01:27:35,785 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_46| (_ BitVec 32)) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_4 (_ bv0 32)))) (or (bvsgt .cse0 (_ bv20 32)) (bvslt .cse0 (_ bv10 32)) (bvsle (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_293) |v_ULTIMATE.start_main_~p~0#1.base_46| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (_ bv20 32))))) is different from false [2024-11-09 01:27:35,901 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_46| (_ BitVec 32)) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_290 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tail~0#1.base_17| (_ BitVec 32))) (let ((.cse1 (select v_arrayElimArr_4 (_ bv0 32)))) (or (not (= v_ArrVal_290 (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~tail~0#1.offset|))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base|) .cse0 (select v_ArrVal_290 .cse0))))) (bvsgt .cse1 (_ bv20 32)) (bvsle (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_290) |v_ULTIMATE.start_main_~tail~0#1.base_17| v_ArrVal_293) |v_ULTIMATE.start_main_~p~0#1.base_46| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (_ bv20 32)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tail~0#1.base_17|))) (bvslt .cse1 (_ bv10 32))))) is different from false [2024-11-09 01:27:36,077 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-11-09 01:27:36,077 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:27:36,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226657191] [2024-11-09 01:27:36,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226657191] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:27:36,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [441431444] [2024-11-09 01:27:36,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:36,078 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:27:36,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 01:27:36,081 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:27:36,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-09 01:27:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:36,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 01:27:36,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:36,356 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-09 01:27:36,369 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-09 01:27:36,511 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 01:27:36,512 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-09 01:27:36,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2024-11-09 01:27:36,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2024-11-09 01:27:36,643 INFO L349 Elim1Store]: treesize reduction 14, result has 39.1 percent of original size [2024-11-09 01:27:36,643 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 22 treesize of output 23 [2024-11-09 01:27:36,653 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 12 treesize of output 1 [2024-11-09 01:27:36,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-09 01:27:36,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:27:36,701 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-09 01:27:36,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2024-11-09 01:27:36,792 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:27:36,793 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:36,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:36,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2024-11-09 01:27:36,861 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_52| (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_6 (_ bv0 32)))) (or (bvsgt .cse0 (_ bv20 32)) (bvslt .cse0 (_ bv10 32)) (bvsle (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_349) |v_ULTIMATE.start_main_~p~0#1.base_52| v_arrayElimArr_6) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (_ bv20 32))))) is different from false [2024-11-09 01:27:36,975 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tail~0#1.base_21| (_ BitVec 32)) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~p~0#1.base_52| (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_6 (_ bv0 32)))) (or (bvsle (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_347) |v_ULTIMATE.start_main_~tail~0#1.base_21| v_ArrVal_349) |v_ULTIMATE.start_main_~p~0#1.base_52| v_arrayElimArr_6) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (_ bv20 32)) (bvsgt .cse0 (_ bv20 32)) (bvslt .cse0 (_ bv10 32)) (not (= v_ArrVal_347 (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~tail~0#1.offset|))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 (select v_ArrVal_347 .cse1))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tail~0#1.base_21|)))))) is different from false [2024-11-09 01:27:37,159 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-11-09 01:27:37,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [441431444] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:27:37,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328236581] [2024-11-09 01:27:37,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:37,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:37,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:27:37,161 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:27:37,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 01:27:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:37,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 01:27:37,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:37,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 01:27:37,324 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-09 01:27:37,454 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 01:27:37,455 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-09 01:27:37,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2024-11-09 01:27:37,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2024-11-09 01:27:37,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:27:37,642 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 21 treesize of output 11 [2024-11-09 01:27:37,664 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 01:27:37,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2024-11-09 01:27:37,796 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:27:37,797 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:37,850 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_58| (_ BitVec 32)) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~p~0#1.base_58|))) (bvsle (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_407) |v_ULTIMATE.start_main_~p~0#1.base_58| v_ArrVal_408) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (_ bv20 32)))) is different from false [2024-11-09 01:27:38,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-09 01:27:38,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328236581] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:27:38,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 01:27:38,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7, 7] total 18 [2024-11-09 01:27:38,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754593378] [2024-11-09 01:27:38,168 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 01:27:38,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 01:27:38,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:27:38,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 01:27:38,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=120, Unknown=5, NotChecked=130, Total=306 [2024-11-09 01:27:38,170 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:41,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:41,620 INFO L93 Difference]: Finished difference Result 163 states and 218 transitions. [2024-11-09 01:27:41,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 01:27:41,621 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 01:27:41,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:41,622 INFO L225 Difference]: With dead ends: 163 [2024-11-09 01:27:41,623 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 01:27:41,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=186, Invalid=425, Unknown=9, NotChecked=250, Total=870 [2024-11-09 01:27:41,624 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 169 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 31 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 499 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:41,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 199 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 165 Invalid, 8 Unknown, 499 Unchecked, 2.5s Time] [2024-11-09 01:27:41,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 01:27:41,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 80. [2024-11-09 01:27:41,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 79 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:41,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 102 transitions. [2024-11-09 01:27:41,657 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 102 transitions. Word has length 19 [2024-11-09 01:27:41,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:41,658 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 102 transitions. [2024-11-09 01:27:41,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:41,658 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2024-11-09 01:27:41,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 01:27:41,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:41,659 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:41,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2024-11-09 01:27:41,873 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 01:27:42,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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 (11)] Forceful destruction successful, exit code 0 [2024-11-09 01:27:42,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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-09 01:27:42,260 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:42,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:42,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1973405165, now seen corresponding path program 1 times [2024-11-09 01:27:42,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:27:42,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481306535] [2024-11-09 01:27:42,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:42,261 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-09 01:27:42,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:27:42,262 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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-09 01:27:42,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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 (14)] Waiting until timeout for monitored process [2024-11-09 01:27:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:42,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:27:42,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:42,362 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-09 01:27:42,416 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:27:42,417 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:27:42,417 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:27:42,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481306535] [2024-11-09 01:27:42,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481306535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:42,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:42,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:27:42,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681458055] [2024-11-09 01:27:42,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:42,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:27:42,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:27:42,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:27:42,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:27:42,418 INFO L87 Difference]: Start difference. First operand 80 states and 102 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:43,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:43,085 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2024-11-09 01:27:43,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:27:43,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 01:27:43,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:43,087 INFO L225 Difference]: With dead ends: 100 [2024-11-09 01:27:43,087 INFO L226 Difference]: Without dead ends: 80 [2024-11-09 01:27:43,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:27:43,088 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 9 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:43,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 50 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:27:43,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-09 01:27:43,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-09 01:27:43,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 79 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:43,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2024-11-09 01:27:43,107 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 20 [2024-11-09 01:27:43,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:43,107 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2024-11-09 01:27:43,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:43,108 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2024-11-09 01:27:43,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 01:27:43,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:43,109 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:43,117 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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 (14)] Ended with exit code 0 [2024-11-09 01:27:43,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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-09 01:27:43,309 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:43,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:43,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1912418262, now seen corresponding path program 1 times [2024-11-09 01:27:43,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:27:43,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584701400] [2024-11-09 01:27:43,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:43,310 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-09 01:27:43,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:27:43,311 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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-09 01:27:43,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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 (15)] Waiting until timeout for monitored process [2024-11-09 01:27:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:43,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 01:27:43,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:43,470 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-09 01:27:43,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2024-11-09 01:27:43,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:27:43,560 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 64 treesize of output 53 [2024-11-09 01:27:43,569 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 27 treesize of output 1 [2024-11-09 01:27:43,595 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 01:27:43,595 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-09 01:27:43,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2024-11-09 01:27:43,627 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 01:27:43,627 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 71 treesize of output 68 [2024-11-09 01:27:43,843 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 66 treesize of output 42 [2024-11-09 01:27:43,856 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 49 treesize of output 36 [2024-11-09 01:27:43,862 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 56 treesize of output 38 [2024-11-09 01:27:43,883 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 36 [2024-11-09 01:27:43,889 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 38 treesize of output 20 [2024-11-09 01:27:43,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2024-11-09 01:27:43,962 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:27:43,962 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:44,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:44,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 57 [2024-11-09 01:27:44,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:44,312 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 154 treesize of output 105 [2024-11-09 01:27:44,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:44,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 78 [2024-11-09 01:27:44,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:44,384 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 154 treesize of output 129 [2024-11-09 01:27:44,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:44,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 46 [2024-11-09 01:27:44,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:44,511 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 88 treesize of output 113 [2024-11-09 01:27:44,528 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 73 treesize of output 57 [2024-11-09 01:27:44,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 45 [2024-11-09 01:27:44,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:44,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 46 treesize of output 50 [2024-11-09 01:27:45,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:27:45,017 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:27:45,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584701400] [2024-11-09 01:27:45,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584701400] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:27:45,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [469775228] [2024-11-09 01:27:45,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:45,018 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:27:45,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 01:27:45,020 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:27:45,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-11-09 01:27:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:45,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 01:27:45,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:45,289 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-09 01:27:45,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-09 01:27:45,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-09 01:27:45,470 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 01:27:45,470 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 93 treesize of output 80 [2024-11-09 01:27:45,498 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-09 01:27:45,498 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 24 treesize of output 19 [2024-11-09 01:27:45,516 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 27 treesize of output 1 [2024-11-09 01:27:45,543 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-09 01:27:45,543 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-09 01:27:45,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 01:27:45,893 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 48 treesize of output 28 [2024-11-09 01:27:45,898 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 33 treesize of output 22 [2024-11-09 01:27:45,932 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 40 treesize of output 24 [2024-11-09 01:27:45,943 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-09 01:27:46,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2024-11-09 01:27:46,024 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:27:46,024 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:46,059 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsge (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_518) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))) (_ bv10 32))) is different from false [2024-11-09 01:27:46,101 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsge (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_518) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))) (_ bv10 32))) is different from false [2024-11-09 01:27:46,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:46,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 57 [2024-11-09 01:27:46,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:46,208 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 154 treesize of output 105 [2024-11-09 01:27:46,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:46,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 78 [2024-11-09 01:27:46,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:46,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 60 [2024-11-09 01:27:46,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:46,286 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 108 treesize of output 101 [2024-11-09 01:27:46,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:46,378 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 88 treesize of output 113 [2024-11-09 01:27:46,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 73 treesize of output 57 [2024-11-09 01:27:46,404 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 57 treesize of output 45 [2024-11-09 01:27:46,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:46,438 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 46 treesize of output 50 [2024-11-09 01:27:46,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-09 01:27:46,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [469775228] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:27:46,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818251415] [2024-11-09 01:27:46,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:46,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:46,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:27:46,813 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:27:46,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-09 01:27:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:46,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 01:27:46,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:46,947 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-09 01:27:47,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-09 01:27:47,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:27:47,034 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 56 treesize of output 45 [2024-11-09 01:27:47,044 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 23 treesize of output 1 [2024-11-09 01:27:47,068 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 01:27:47,069 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-09 01:27:47,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-09 01:27:47,100 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 01:27:47,100 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 57 treesize of output 54 [2024-11-09 01:27:47,378 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 56 treesize of output 36 [2024-11-09 01:27:47,385 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 41 treesize of output 30 [2024-11-09 01:27:47,390 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 48 treesize of output 32 [2024-11-09 01:27:47,410 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 48 treesize of output 32 [2024-11-09 01:27:47,415 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 32 treesize of output 20 [2024-11-09 01:27:47,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2024-11-09 01:27:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:27:47,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:47,485 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_564 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsge (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_564) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))) (_ bv10 32))) is different from false [2024-11-09 01:27:47,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:47,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 57 [2024-11-09 01:27:47,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:47,715 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 154 treesize of output 105 [2024-11-09 01:27:47,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:47,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 78 [2024-11-09 01:27:47,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:47,789 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 154 treesize of output 129 [2024-11-09 01:27:47,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:47,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 46 [2024-11-09 01:27:47,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:47,893 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 88 treesize of output 113 [2024-11-09 01:27:47,906 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 73 treesize of output 61 [2024-11-09 01:27:47,919 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 61 treesize of output 45 [2024-11-09 01:27:47,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:47,953 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 46 treesize of output 50 [2024-11-09 01:27:50,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 01:27:50,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818251415] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:27:50,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 01:27:50,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7, 8, 7, 8] total 21 [2024-11-09 01:27:50,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960176614] [2024-11-09 01:27:50,334 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 01:27:50,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 01:27:50,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:27:50,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 01:27:50,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=250, Unknown=8, NotChecked=102, Total=420 [2024-11-09 01:27:50,336 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand has 21 states, 21 states have (on average 4.285714285714286) internal successors, (90), 21 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:53,697 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (_ bv0 32)))) (and (not (bvslt .cse0 (_ bv10 32))) |c_ULTIMATE.start_main_#t~short9#1| (not (bvsgt .cse0 (_ bv20 32))) (forall ((v_ArrVal_471 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsge (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_471) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (_ bv10 32))) (= (_ bv0 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2024-11-09 01:27:54,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:54,379 INFO L93 Difference]: Finished difference Result 154 states and 207 transitions. [2024-11-09 01:27:54,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 01:27:54,381 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.285714285714286) internal successors, (90), 21 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 01:27:54,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:54,382 INFO L225 Difference]: With dead ends: 154 [2024-11-09 01:27:54,382 INFO L226 Difference]: Without dead ends: 131 [2024-11-09 01:27:54,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 104 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=105, Invalid=435, Unknown=28, NotChecked=188, Total=756 [2024-11-09 01:27:54,383 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 55 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 8 mSolverCounterUnsat, 39 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 39 IncrementalHoareTripleChecker+Unknown, 269 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:54,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 260 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 325 Invalid, 39 Unknown, 269 Unchecked, 3.5s Time] [2024-11-09 01:27:54,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-09 01:27:54,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 113. [2024-11-09 01:27:54,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.3214285714285714) internal successors, (148), 112 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:54,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 148 transitions. [2024-11-09 01:27:54,414 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 148 transitions. Word has length 22 [2024-11-09 01:27:54,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:54,414 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 148 transitions. [2024-11-09 01:27:54,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.285714285714286) internal successors, (90), 21 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:54,415 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 148 transitions. [2024-11-09 01:27:54,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 01:27:54,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:54,416 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:54,421 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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 (15)] Ended with exit code 0 [2024-11-09 01:27:54,630 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-09 01:27:54,820 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2024-11-09 01:27:55,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 01:27:55,017 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:55,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:55,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1912420184, now seen corresponding path program 1 times [2024-11-09 01:27:55,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:27:55,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749456212] [2024-11-09 01:27:55,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:55,020 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-09 01:27:55,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:27:55,025 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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-09 01:27:55,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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 (18)] Waiting until timeout for monitored process [2024-11-09 01:27:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:55,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 01:27:55,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:55,189 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-09 01:27:55,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2024-11-09 01:27:55,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:27:55,269 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 64 treesize of output 53 [2024-11-09 01:27:55,276 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 27 treesize of output 1 [2024-11-09 01:27:55,296 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 01:27:55,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 01:27:55,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2024-11-09 01:27:55,322 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 01:27:55,323 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 71 treesize of output 68 [2024-11-09 01:27:55,565 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 66 treesize of output 42 [2024-11-09 01:27:55,581 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 49 treesize of output 36 [2024-11-09 01:27:55,589 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 56 treesize of output 38 [2024-11-09 01:27:55,610 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 36 [2024-11-09 01:27:55,616 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 38 treesize of output 20 [2024-11-09 01:27:55,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2024-11-09 01:27:55,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:27:55,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:55,775 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_611) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))) (_ bv20 32))) is different from false [2024-11-09 01:27:55,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:55,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 57 [2024-11-09 01:27:55,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:55,981 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 154 treesize of output 105 [2024-11-09 01:27:56,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:56,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 78 [2024-11-09 01:27:56,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:56,059 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 154 treesize of output 129 [2024-11-09 01:27:56,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:56,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 46 [2024-11-09 01:27:56,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:56,171 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 88 treesize of output 113 [2024-11-09 01:27:56,183 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 73 treesize of output 61 [2024-11-09 01:27:56,199 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 61 treesize of output 45 [2024-11-09 01:27:56,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:56,241 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 46 treesize of output 50 [2024-11-09 01:27:58,732 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-09 01:27:58,733 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:27:58,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749456212] [2024-11-09 01:27:58,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749456212] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:27:58,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1854148136] [2024-11-09 01:27:58,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:58,733 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:27:58,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 01:27:58,734 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:27:58,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-09 01:27:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:59,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 01:27:59,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:59,015 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-09 01:27:59,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-09 01:27:59,258 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 01:27:59,258 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 101 treesize of output 88 [2024-11-09 01:27:59,286 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-09 01:27:59,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-09 01:27:59,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2024-11-09 01:27:59,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 01:27:59,321 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 27 treesize of output 1 [2024-11-09 01:28:00,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 38 [2024-11-09 01:28:00,068 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 48 treesize of output 28 [2024-11-09 01:28:00,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 01:28:00,250 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 40 treesize of output 24 [2024-11-09 01:28:00,266 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-09 01:28:00,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2024-11-09 01:28:00,440 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:28:00,440 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:28:01,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:01,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 84 [2024-11-09 01:28:01,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:01,391 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 312 treesize of output 191 [2024-11-09 01:28:01,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:01,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 132 [2024-11-09 01:28:01,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:01,534 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 589 treesize of output 578 [2024-11-09 01:28:01,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:01,607 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 455 treesize of output 400 [2024-11-09 01:28:01,655 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 186 treesize of output 162 [2024-11-09 01:28:01,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:01,703 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 150 treesize of output 130 [2024-11-09 01:28:02,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:28:02,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1854148136] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:28:02,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640078246] [2024-11-09 01:28:02,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:02,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:02,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:28:02,604 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:28:02,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-09 01:28:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:02,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 01:28:02,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:02,732 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-09 01:28:02,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-09 01:28:02,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:28:02,821 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 56 treesize of output 45 [2024-11-09 01:28:02,828 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 23 treesize of output 1 [2024-11-09 01:28:02,851 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 01:28:02,851 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-09 01:28:02,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-09 01:28:02,876 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 01:28:02,876 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 57 treesize of output 54 [2024-11-09 01:28:03,174 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 56 treesize of output 36 [2024-11-09 01:28:03,181 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 41 treesize of output 30 [2024-11-09 01:28:03,189 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 48 treesize of output 32 [2024-11-09 01:28:03,205 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 48 treesize of output 32 [2024-11-09 01:28:03,209 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 32 treesize of output 20 [2024-11-09 01:28:03,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2024-11-09 01:28:03,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:28:03,239 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:28:03,382 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_706 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_706) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))) (_ bv20 32))) is different from false [2024-11-09 01:28:03,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:03,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 57 [2024-11-09 01:28:03,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:03,489 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 154 treesize of output 105 [2024-11-09 01:28:03,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:03,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 78 [2024-11-09 01:28:03,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:03,556 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 154 treesize of output 129 [2024-11-09 01:28:03,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:03,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 46 [2024-11-09 01:28:03,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:03,654 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 88 treesize of output 113 [2024-11-09 01:28:03,665 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 73 treesize of output 57 [2024-11-09 01:28:03,675 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 57 treesize of output 45 [2024-11-09 01:28:03,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:03,704 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 46 treesize of output 50 [2024-11-09 01:28:04,235 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-09 01:28:04,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640078246] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:28:04,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 01:28:04,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 12, 12, 7, 8] total 31 [2024-11-09 01:28:04,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496030692] [2024-11-09 01:28:04,236 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 01:28:04,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 01:28:04,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:28:04,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 01:28:04,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=641, Unknown=7, NotChecked=110, Total=930 [2024-11-09 01:28:04,238 INFO L87 Difference]: Start difference. First operand 113 states and 148 transitions. Second operand has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:28:08,816 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3))) (and (forall ((v_ArrVal_706 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_706) .cse0) .cse1) (_ bv20 32))) (forall ((v_ArrVal_611 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_611) .cse0) .cse1) (_ bv20 32))) (forall ((v_ArrVal_611 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_611) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))) (_ bv20 32)))))) is different from false [2024-11-09 01:28:09,050 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2))) (and (forall ((v_ArrVal_706 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_706) .cse0) .cse1) (_ bv20 32))) (forall ((v_ArrVal_611 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_611) .cse0) .cse1) (_ bv20 32)))))) is different from false [2024-11-09 01:28:11,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:11,946 INFO L93 Difference]: Finished difference Result 258 states and 361 transitions. [2024-11-09 01:28:11,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-09 01:28:11,947 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 01:28:11,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:11,948 INFO L225 Difference]: With dead ends: 258 [2024-11-09 01:28:11,948 INFO L226 Difference]: Without dead ends: 235 [2024-11-09 01:28:11,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 102 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=569, Invalid=2382, Unknown=35, NotChecked=436, Total=3422 [2024-11-09 01:28:11,950 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 174 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 24 mSolverCounterUnsat, 29 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 29 IncrementalHoareTripleChecker+Unknown, 514 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:11,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 247 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 512 Invalid, 29 Unknown, 514 Unchecked, 4.9s Time] [2024-11-09 01:28:11,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-09 01:28:11,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 165. [2024-11-09 01:28:11,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.3475609756097562) internal successors, (221), 164 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:28:11,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2024-11-09 01:28:11,983 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 22 [2024-11-09 01:28:11,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:11,983 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2024-11-09 01:28:11,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:28:11,983 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2024-11-09 01:28:11,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 01:28:11,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:11,985 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:11,994 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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 (18)] Ended with exit code 0 [2024-11-09 01:28:12,198 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-09 01:28:12,388 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2024-11-09 01:28:12,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 01:28:12,586 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:12,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:12,586 INFO L85 PathProgramCache]: Analyzing trace with hash -29515495, now seen corresponding path program 1 times [2024-11-09 01:28:12,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:28:12,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40018119] [2024-11-09 01:28:12,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:12,587 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-09 01:28:12,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:28:12,591 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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-09 01:28:12,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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 (21)] Waiting until timeout for monitored process [2024-11-09 01:28:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:12,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 01:28:12,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:12,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2024-11-09 01:28:13,185 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 31 treesize of output 19 [2024-11-09 01:28:13,226 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 01:28:13,226 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:28:13,648 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-09 01:28:13,648 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 49 treesize of output 33 [2024-11-09 01:28:13,673 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 01:28:13,673 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:28:13,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40018119] [2024-11-09 01:28:13,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40018119] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:28:13,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1213075108] [2024-11-09 01:28:13,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:13,674 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:28:13,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 01:28:13,677 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:28:13,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2024-11-09 01:28:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:13,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 01:28:13,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:14,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2024-11-09 01:28:14,926 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 31 treesize of output 19 [2024-11-09 01:28:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 01:28:14,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:28:15,043 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-09 01:28:15,044 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 49 treesize of output 33 [2024-11-09 01:28:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 01:28:15,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1213075108] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:28:15,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278360336] [2024-11-09 01:28:15,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:15,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:15,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:28:15,063 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:28:15,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-09 01:28:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:15,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 01:28:15,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:15,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2024-11-09 01:28:15,433 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 31 treesize of output 19 [2024-11-09 01:28:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 01:28:15,443 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:28:15,569 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-09 01:28:15,570 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 49 treesize of output 33 [2024-11-09 01:28:15,590 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 01:28:15,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278360336] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:28:15,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 01:28:15,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11, 9, 10, 9] total 23 [2024-11-09 01:28:15,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32738831] [2024-11-09 01:28:15,591 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 01:28:15,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 01:28:15,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:28:15,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 01:28:15,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2024-11-09 01:28:15,593 INFO L87 Difference]: Start difference. First operand 165 states and 221 transitions. Second operand has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:28:18,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:18,683 INFO L93 Difference]: Finished difference Result 378 states and 523 transitions. [2024-11-09 01:28:18,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 01:28:18,684 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-09 01:28:18,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:18,685 INFO L225 Difference]: With dead ends: 378 [2024-11-09 01:28:18,685 INFO L226 Difference]: Without dead ends: 280 [2024-11-09 01:28:18,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=365, Invalid=1041, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 01:28:18,687 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 125 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:18,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 141 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 01:28:18,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-09 01:28:18,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 194. [2024-11-09 01:28:18,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.3264248704663213) internal successors, (256), 193 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:28:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 256 transitions. [2024-11-09 01:28:18,721 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 256 transitions. Word has length 24 [2024-11-09 01:28:18,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:18,721 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 256 transitions. [2024-11-09 01:28:18,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:28:18,722 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 256 transitions. [2024-11-09 01:28:18,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 01:28:18,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:18,723 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:18,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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 (21)] Ended with exit code 0 [2024-11-09 01:28:18,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2024-11-09 01:28:19,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-11-09 01:28:19,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:19,324 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:19,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:19,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1679617372, now seen corresponding path program 2 times [2024-11-09 01:28:19,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:28:19,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1753947915] [2024-11-09 01:28:19,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 01:28:19,325 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-09 01:28:19,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:28:19,330 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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-09 01:28:19,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/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 (24)] Waiting until timeout for monitored process [2024-11-09 01:28:19,586 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 01:28:19,586 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:28:19,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 01:28:19,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:19,603 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-09 01:28:19,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:28:19,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2024-11-09 01:28:19,709 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 01:28:19,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2024-11-09 01:28:19,723 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 3 [2024-11-09 01:28:19,761 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 01:28:19,762 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-09 01:28:19,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2024-11-09 01:28:19,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 01:28:20,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:28:20,093 INFO L349 Elim1Store]: treesize reduction 48, result has 9.4 percent of original size [2024-11-09 01:28:20,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 140 treesize of output 109 [2024-11-09 01:28:20,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2024-11-09 01:28:20,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:28:20,132 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 35 treesize of output 13 [2024-11-09 01:28:20,167 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 01:28:20,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2024-11-09 01:28:20,179 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 37 treesize of output 24 [2024-11-09 01:28:20,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2024-11-09 01:28:20,524 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 37 treesize of output 24 [2024-11-09 01:28:20,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 01:28:20,569 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 48 treesize of output 24 [2024-11-09 01:28:20,586 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 9 treesize of output 3 [2024-11-09 01:28:20,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2024-11-09 01:28:20,689 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:28:20,689 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:28:20,868 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_890 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsge (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_890) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))) (_ bv10 32))) is different from false [2024-11-09 01:28:20,927 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_886 (_ BitVec 32)) (v_ArrVal_881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_885 (_ BitVec 32)) (v_ArrVal_888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_886))) (bvsge (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~tail~0#1.offset|) v_ArrVal_885)) v_ArrVal_886 v_ArrVal_889) |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_890) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_888) v_ArrVal_886 v_ArrVal_884) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_881) v_ArrVal_886 v_ArrVal_883) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))) (_ bv10 32)))) is different from false [2024-11-09 01:28:21,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:21,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 69 [2024-11-09 01:28:21,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:21,146 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 343 treesize of output 252 [2024-11-09 01:28:21,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:21,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 226 treesize of output 198 [2024-11-09 01:28:21,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:21,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 152 [2024-11-09 01:28:21,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:21,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 966 treesize of output 939 [2024-11-09 01:28:21,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:21,413 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 1272 treesize of output 1187 [2024-11-09 01:28:21,455 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 424 treesize of output 364 [2024-11-09 01:28:21,481 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 349 treesize of output 325 [2024-11-09 01:28:21,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 233 treesize of output 197 [2024-11-09 01:28:21,527 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 420 treesize of output 372 [2024-11-09 01:28:21,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:21,618 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 222 treesize of output 238 [2024-11-09 01:28:21,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:21,753 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 214 treesize of output 222 [2024-11-09 01:28:28,030 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-11-09 01:28:28,030 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:28:28,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1753947915] [2024-11-09 01:28:28,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1753947915] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:28:28,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1298116895] [2024-11-09 01:28:28,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 01:28:28,031 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:28:28,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 01:28:28,032 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:28:28,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac16905e-b3aa-4151-86ab-f11c53aefac7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-09 01:28:28,418 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 01:28:28,418 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:28:28,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-09 01:28:28,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:28,443 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-09 01:28:28,608 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 01:28:28,608 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-09 01:28:28,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-09 01:28:28,647 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-09 01:28:28,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:28:28,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-09 01:28:28,674 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-09 01:28:29,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:28:29,512 INFO L349 Elim1Store]: treesize reduction 81, result has 16.5 percent of original size [2024-11-09 01:28:29,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 208 treesize of output 201 [2024-11-09 01:28:29,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:28:29,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 80 [2024-11-09 01:28:29,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:28:29,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 34 [2024-11-09 01:28:29,634 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 114 treesize of output 45 [2024-11-09 01:28:29,652 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 45 treesize of output 26 [2024-11-09 01:28:29,703 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 01:28:29,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 18 [2024-11-09 01:28:29,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 01:28:29,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 01:28:32,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:28:32,492 INFO L349 Elim1Store]: treesize reduction 78, result has 27.1 percent of original size [2024-11-09 01:28:32,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 941 treesize of output 796 [2024-11-09 01:28:32,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:28:32,752 INFO L349 Elim1Store]: treesize reduction 30, result has 46.4 percent of original size [2024-11-09 01:28:32,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 84 [2024-11-09 01:28:32,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 01:28:33,121 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 45 treesize of output 32 [2024-11-09 01:28:33,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2024-11-09 01:28:33,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 01:28:33,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2024-11-09 01:28:33,835 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:28:33,835 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:28:57,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:57,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 447 treesize of output 408 [2024-11-09 01:29:05,420 WARN L286 SmtUtils]: Spent 7.86s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 01:29:05,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:29:05,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2092 treesize of output 1940 [2024-11-09 01:29:05,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:29:05,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1305 treesize of output 1136 [2024-11-09 01:29:06,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:29:06,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4196 treesize of output 4188 [2024-11-09 01:29:12,151 WARN L286 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 110 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 01:29:12,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:29:12,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 87531 treesize of output 84520 [2024-11-09 01:29:16,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:29:16,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 4583 treesize of output 4424 [2024-11-09 01:29:16,475 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 6394 treesize of output 6226 [2024-11-09 01:29:18,578 INFO L349 Elim1Store]: treesize reduction 34, result has 50.0 percent of original size [2024-11-09 01:29:18,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 5096 treesize of output 5041 [2024-11-09 01:29:19,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:29:19,466 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 5036 treesize of output 5006 [2024-11-09 01:29:20,048 INFO L224 Elim1Store]: Index analysis took 162 ms [2024-11-09 01:29:30,460 WARN L286 SmtUtils]: Spent 10.41s on a formula simplification. DAG size of input: 136 DAG size of output: 132 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 01:29:30,461 INFO L349 Elim1Store]: treesize reduction 8, result has 97.7 percent of original size [2024-11-09 01:29:30,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 27 case distinctions, treesize of input 5343 treesize of output 5394 [2024-11-09 01:29:32,157 INFO L349 Elim1Store]: treesize reduction 34, result has 50.0 percent of original size [2024-11-09 01:29:32,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 5136 treesize of output 5077 [2024-11-09 01:29:32,679 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 5080 treesize of output 5028 [2024-11-09 01:29:35,657 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 8 treesize of output 4