./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/ms4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-fpi/ms4.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 83260f11871b199c66fbefacd24c95d84ae219136106a5a3246a879f7c60a3e2 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:26:04,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:26:04,984 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 05:26:04,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:26:04,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:26:05,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:26:05,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:26:05,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:26:05,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:26:05,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:26:05,035 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:26:05,036 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:26:05,036 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:26:05,036 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:26:05,036 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:26:05,036 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:26:05,036 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:26:05,036 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:26:05,036 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:26:05,037 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:26:05,037 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:26:05,037 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:26:05,039 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:26:05,039 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 05:26:05,039 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:26:05,039 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:26:05,039 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:26:05,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:26:05,039 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 05:26:05,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:26:05,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 05:26:05,040 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:26:05,040 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:26:05,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 05:26:05,040 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:26:05,040 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:26:05,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:26:05,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:26:05,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:26:05,040 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:26:05,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:26:05,040 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 05:26:05,041 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:26:05,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:26:05,041 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:26:05,041 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:26:05,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:26:05,041 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 83260f11871b199c66fbefacd24c95d84ae219136106a5a3246a879f7c60a3e2 [2024-11-14 05:26:05,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:26:05,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:26:05,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:26:05,363 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:26:05,364 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:26:05,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/array-fpi/ms4.c Unable to find full path for "g++" [2024-11-14 05:26:07,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:26:07,578 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:26:07,579 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/sv-benchmarks/c/array-fpi/ms4.c [2024-11-14 05:26:07,599 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/data/6cbf02ca4/fcde511fc36644f7b5b0007b42fbbbc5/FLAG2941217e9 [2024-11-14 05:26:07,619 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/data/6cbf02ca4/fcde511fc36644f7b5b0007b42fbbbc5 [2024-11-14 05:26:07,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:26:07,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:26:07,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:26:07,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:26:07,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:26:07,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:26:07" (1/1) ... [2024-11-14 05:26:07,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4935d946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:26:07, skipping insertion in model container [2024-11-14 05:26:07,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:26:07" (1/1) ... [2024-11-14 05:26:07,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:26:07,855 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/sv-benchmarks/c/array-fpi/ms4.c[586,599] [2024-11-14 05:26:07,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:26:07,892 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:26:07,903 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_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/sv-benchmarks/c/array-fpi/ms4.c[586,599] [2024-11-14 05:26:07,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:26:07,924 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:26:07,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:26:07 WrapperNode [2024-11-14 05:26:07,925 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:26:07,926 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:26:07,926 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:26:07,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:26:07,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:26:07" (1/1) ... [2024-11-14 05:26:07,940 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:26:07" (1/1) ... [2024-11-14 05:26:07,960 INFO L138 Inliner]: procedures = 17, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2024-11-14 05:26:07,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:26:07,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:26:07,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:26:07,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:26:07,973 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:26:07" (1/1) ... [2024-11-14 05:26:07,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:26:07" (1/1) ... [2024-11-14 05:26:07,976 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:26:07" (1/1) ... [2024-11-14 05:26:07,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:26:07" (1/1) ... [2024-11-14 05:26:07,985 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:26:07" (1/1) ... [2024-11-14 05:26:07,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:26:07" (1/1) ... [2024-11-14 05:26:07,997 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:26:07" (1/1) ... [2024-11-14 05:26:07,998 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:26:07" (1/1) ... [2024-11-14 05:26:07,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:26:08,000 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:26:08,004 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:26:08,004 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:26:08,005 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:26:07" (1/1) ... [2024-11-14 05:26:08,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:26:08,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:26:08,042 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:26:08,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:26:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:26:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:26:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 05:26:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 05:26:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:26:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:26:08,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:26:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 05:26:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 05:26:08,172 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:26:08,174 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:26:08,364 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-14 05:26:08,364 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:26:08,425 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:26:08,425 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-14 05:26:08,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:26:08 BoogieIcfgContainer [2024-11-14 05:26:08,426 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:26:08,428 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:26:08,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:26:08,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:26:08,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:26:07" (1/3) ... [2024-11-14 05:26:08,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499bffc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:26:08, skipping insertion in model container [2024-11-14 05:26:08,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:26:07" (2/3) ... [2024-11-14 05:26:08,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499bffc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:26:08, skipping insertion in model container [2024-11-14 05:26:08,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:26:08" (3/3) ... [2024-11-14 05:26:08,443 INFO L112 eAbstractionObserver]: Analyzing ICFG ms4.c [2024-11-14 05:26:08,464 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:26:08,468 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG ms4.c that has 1 procedures, 10 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-14 05:26:08,523 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:26:08,535 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;@56e12424, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:26:08,535 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 05:26:08,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 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-14 05:26:08,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 05:26:08,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:08,547 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 05:26:08,547 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:26:08,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:08,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1658067287, now seen corresponding path program 1 times [2024-11-14 05:26:08,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:08,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376726266] [2024-11-14 05:26:08,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:08,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:08,911 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-14 05:26:08,911 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:08,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376726266] [2024-11-14 05:26:08,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376726266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:26:08,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:26:08,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:26:08,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780953403] [2024-11-14 05:26:08,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:26:08,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:26:08,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:08,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:26:08,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:26:08,945 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 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 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-14 05:26:09,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:09,005 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-14 05:26:09,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:26:09,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-14 05:26:09,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:09,016 INFO L225 Difference]: With dead ends: 18 [2024-11-14 05:26:09,016 INFO L226 Difference]: Without dead ends: 8 [2024-11-14 05:26:09,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:26:09,024 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:09,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:26:09,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-11-14 05:26:09,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-11-14 05:26:09,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 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-14 05:26:09,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2024-11-14 05:26:09,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2024-11-14 05:26:09,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:09,061 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2024-11-14 05:26:09,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-14 05:26:09,061 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2024-11-14 05:26:09,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 05:26:09,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:09,062 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:09,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:26:09,062 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:26:09,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:09,065 INFO L85 PathProgramCache]: Analyzing trace with hash 97001237, now seen corresponding path program 1 times [2024-11-14 05:26:09,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:09,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475873083] [2024-11-14 05:26:09,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:09,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:09,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:26:09,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:09,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475873083] [2024-11-14 05:26:09,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475873083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:26:09,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:26:09,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:26:09,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425000994] [2024-11-14 05:26:09,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:26:09,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:26:09,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:09,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:26:09,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:26:09,275 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-14 05:26:09,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:09,314 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2024-11-14 05:26:09,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:26:09,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-14 05:26:09,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:09,315 INFO L225 Difference]: With dead ends: 12 [2024-11-14 05:26:09,316 INFO L226 Difference]: Without dead ends: 9 [2024-11-14 05:26:09,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:26:09,317 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 5 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:09,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:26:09,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-14 05:26:09,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-14 05:26:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:09,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2024-11-14 05:26:09,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2024-11-14 05:26:09,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:09,324 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-14 05:26:09,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-14 05:26:09,324 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2024-11-14 05:26:09,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 05:26:09,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:09,325 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:09,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 05:26:09,325 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:26:09,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:09,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1288026983, now seen corresponding path program 1 times [2024-11-14 05:26:09,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:09,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061317168] [2024-11-14 05:26:09,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:09,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:09,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:26:09,730 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:09,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061317168] [2024-11-14 05:26:09,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061317168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:26:09,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102795536] [2024-11-14 05:26:09,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:09,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:09,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:26:09,733 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:26:09,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:26:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:09,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 05:26:09,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:26:09,931 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-14 05:26:09,984 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 37 treesize of output 25 [2024-11-14 05:26:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:26:10,018 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:26:10,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:26:10,102 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 37 treesize of output 51 [2024-11-14 05:26:10,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-14 05:26:10,199 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 42 treesize of output 30 [2024-11-14 05:26:10,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 05:26:10,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-14 05:26:10,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:26:10,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102795536] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:26:10,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1972729839] [2024-11-14 05:26:10,303 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2024-11-14 05:26:10,303 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:26:10,305 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:26:10,308 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:26:10,309 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:26:11,220 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:26:11,513 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '137#(exists ((|v_ULTIMATE.start_main_~#sum~0#1.offset_25| Int)) (<= (+ (* 3 ~N~0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |v_ULTIMATE.start_main_~#sum~0#1.offset_25|)))' at error location [2024-11-14 05:26:11,513 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:26:11,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:26:11,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-14 05:26:11,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772353785] [2024-11-14 05:26:11,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:26:11,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 05:26:11,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:11,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 05:26:11,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-14 05:26:11,516 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 11 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-14 05:26:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:11,605 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2024-11-14 05:26:11,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:26:11,607 INFO L78 Accepts]: Start accepts. Automaton has has 11 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) Word has length 8 [2024-11-14 05:26:11,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:11,607 INFO L225 Difference]: With dead ends: 13 [2024-11-14 05:26:11,607 INFO L226 Difference]: Without dead ends: 10 [2024-11-14 05:26:11,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-14 05:26:11,609 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 12 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:11,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 12 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:26:11,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-14 05:26:11,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-14 05:26:11,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-14 05:26:11,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2024-11-14 05:26:11,614 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2024-11-14 05:26:11,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:11,615 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-11-14 05:26:11,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 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-14 05:26:11,615 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2024-11-14 05:26:11,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 05:26:11,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:11,617 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:11,637 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-14 05:26:11,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-14 05:26:11,821 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:26:11,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:11,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1274228843, now seen corresponding path program 2 times [2024-11-14 05:26:11,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:11,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404797244] [2024-11-14 05:26:11,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:11,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:26:11,987 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:11,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404797244] [2024-11-14 05:26:11,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404797244] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:26:11,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754433747] [2024-11-14 05:26:11,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:26:11,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:11,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:26:11,989 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:26:11,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 05:26:12,069 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 05:26:12,069 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:26:12,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:26:12,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:26:12,125 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-14 05:26:12,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:26:12,163 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-14 05:26:12,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754433747] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:26:12,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [346130184] [2024-11-14 05:26:12,166 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2024-11-14 05:26:12,166 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:26:12,166 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:26:12,167 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:26:12,167 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:26:12,672 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:26:12,910 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '235#(exists ((|v_ULTIMATE.start_main_~#sum~0#1.offset_27| Int)) (<= (+ (* 3 ~N~0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |v_ULTIMATE.start_main_~#sum~0#1.offset_27|)))' at error location [2024-11-14 05:26:12,911 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:26:12,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:26:12,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-14 05:26:12,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612853109] [2024-11-14 05:26:12,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:26:12,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 05:26:12,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:12,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 05:26:12,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-11-14 05:26:12,914 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 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-14 05:26:12,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:12,967 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2024-11-14 05:26:12,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:26:12,967 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 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) Word has length 9 [2024-11-14 05:26:12,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:12,968 INFO L225 Difference]: With dead ends: 17 [2024-11-14 05:26:12,968 INFO L226 Difference]: Without dead ends: 11 [2024-11-14 05:26:12,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-11-14 05:26:12,969 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:12,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:26:12,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-14 05:26:12,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-11-14 05:26:12,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-14 05:26:12,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2024-11-14 05:26:12,975 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2024-11-14 05:26:12,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:12,975 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-11-14 05:26:12,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 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-14 05:26:12,975 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2024-11-14 05:26:12,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 05:26:12,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:12,976 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:12,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-14 05:26:13,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:13,181 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:26:13,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:13,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1335275433, now seen corresponding path program 3 times [2024-11-14 05:26:13,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:13,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827840825] [2024-11-14 05:26:13,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:13,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:13,843 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-14 05:26:13,844 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:13,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827840825] [2024-11-14 05:26:13,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827840825] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:26:13,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340251346] [2024-11-14 05:26:13,844 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:26:13,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:13,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:26:13,846 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:26:13,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 05:26:13,908 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:26:13,908 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:26:13,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 05:26:13,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:26:13,930 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 68 treesize of output 55 [2024-11-14 05:26:13,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 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 55 treesize of output 76 [2024-11-14 05:26:13,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 5 [2024-11-14 05:26:14,573 INFO L349 Elim1Store]: treesize reduction 71, result has 49.6 percent of original size [2024-11-14 05:26:14,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 132 [2024-11-14 05:26:15,166 INFO L349 Elim1Store]: treesize reduction 63, result has 55.3 percent of original size [2024-11-14 05:26:15,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 128 treesize of output 140 [2024-11-14 05:26:16,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:26:16,781 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 103 treesize of output 139 [2024-11-14 05:26:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:26:16,930 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:26:17,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 05:26:17,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:26:17,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340251346] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:26:17,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1558761527] [2024-11-14 05:26:17,352 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2024-11-14 05:26:17,352 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:26:17,353 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:26:17,353 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:26:17,353 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:26:17,619 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:26:18,038 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '356#(exists ((|v_ULTIMATE.start_main_~i~0#1_80| Int) (|v_ULTIMATE.start_main_~#sum~0#1.offset_29| Int)) (and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (* 3 ~N~0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) 0)) (<= ~N~0 |v_ULTIMATE.start_main_~i~0#1_80|) (= |v_ULTIMATE.start_main_~#sum~0#1.offset_29| 0) (<= 0 |v_ULTIMATE.start_main_~i~0#1_80|)))' at error location [2024-11-14 05:26:18,039 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:26:18,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:26:18,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2024-11-14 05:26:18,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76201916] [2024-11-14 05:26:18,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:26:18,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-14 05:26:18,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:18,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-14 05:26:18,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-11-14 05:26:18,041 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:20,612 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 [0] [2024-11-14 05:26:28,740 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-14 05:26:29,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:29,193 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2024-11-14 05:26:29,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:26:29,194 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-14 05:26:29,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:29,194 INFO L225 Difference]: With dead ends: 15 [2024-11-14 05:26:29,195 INFO L226 Difference]: Without dead ends: 12 [2024-11-14 05:26:29,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=105, Invalid=648, Unknown=3, NotChecked=0, Total=756 [2024-11-14 05:26:29,197 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:29,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 16 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 88 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2024-11-14 05:26:29,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-14 05:26:29,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-14 05:26:29,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-14 05:26:29,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-11-14 05:26:29,210 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2024-11-14 05:26:29,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:29,210 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-11-14 05:26:29,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:26:29,210 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2024-11-14 05:26:29,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 05:26:29,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:29,211 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:29,231 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 05:26:29,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:29,412 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:26:29,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:29,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1556232571, now seen corresponding path program 4 times [2024-11-14 05:26:29,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:29,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673333611] [2024-11-14 05:26:29,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:29,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:29,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:26:29,567 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:29,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673333611] [2024-11-14 05:26:29,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673333611] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:26:29,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831868035] [2024-11-14 05:26:29,568 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:26:29,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:29,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:26:29,570 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:26:29,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 05:26:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:29,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 05:26:29,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:26:29,702 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:26:29,702 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:26:29,747 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:26:29,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831868035] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:26:29,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [81832523] [2024-11-14 05:26:29,749 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2024-11-14 05:26:29,750 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:26:29,750 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:26:29,751 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:26:29,751 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:26:29,991 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:26:30,149 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '487#(exists ((|v_ULTIMATE.start_main_~#sum~0#1.offset_31| Int)) (<= (+ (* 3 ~N~0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |v_ULTIMATE.start_main_~#sum~0#1.offset_31|)))' at error location [2024-11-14 05:26:30,149 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:26:30,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:26:30,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-11-14 05:26:30,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116649647] [2024-11-14 05:26:30,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:26:30,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 05:26:30,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:30,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 05:26:30,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2024-11-14 05:26:30,150 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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-14 05:26:30,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:30,217 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2024-11-14 05:26:30,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:26:30,217 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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) Word has length 11 [2024-11-14 05:26:30,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:30,219 INFO L225 Difference]: With dead ends: 20 [2024-11-14 05:26:30,219 INFO L226 Difference]: Without dead ends: 13 [2024-11-14 05:26:30,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2024-11-14 05:26:30,221 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:30,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:26:30,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-14 05:26:30,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-14 05:26:30,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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-14 05:26:30,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-11-14 05:26:30,233 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2024-11-14 05:26:30,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:30,233 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-14 05:26:30,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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-14 05:26:30,237 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-11-14 05:26:30,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 05:26:30,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:30,237 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:30,259 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 05:26:30,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-14 05:26:30,438 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:26:30,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:30,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2083524199, now seen corresponding path program 5 times [2024-11-14 05:26:30,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:30,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045296816] [2024-11-14 05:26:30,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:30,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:31,525 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:26:31,525 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:31,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045296816] [2024-11-14 05:26:31,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045296816] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:26:31,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046815166] [2024-11-14 05:26:31,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:26:31,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:31,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:26:31,528 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:26:31,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 05:26:31,609 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:26:31,609 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:26:31,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-14 05:26:31,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:26:31,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-14 05:26:31,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:26:31,720 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 19 treesize of output 18 [2024-11-14 05:26:31,821 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-14 05:26:31,884 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 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-14 05:26:31,939 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 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-14 05:26:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:26:32,028 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:26:32,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 05:26:35,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:26:35,283 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 573 treesize of output 569 [2024-11-14 05:26:35,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:26:35,340 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 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-14 05:26:35,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:26:35,387 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 1 case distinctions, treesize of input 15 treesize of output 14 [2024-11-14 05:26:36,119 INFO L349 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2024-11-14 05:26:36,120 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 2145 treesize of output 1988 [2024-11-14 05:26:36,483 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:26:36,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046815166] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:26:36,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [5964415] [2024-11-14 05:26:36,485 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2024-11-14 05:26:36,485 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:26:36,485 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:26:36,485 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:26:36,485 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:26:36,695 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:26:37,077 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '642#(exists ((|v_ULTIMATE.start_main_~#sum~0#1.offset_34| Int)) (<= (+ (* 3 ~N~0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |v_ULTIMATE.start_main_~#sum~0#1.offset_34|)))' at error location [2024-11-14 05:26:37,078 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:26:37,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:26:37,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2024-11-14 05:26:37,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989087203] [2024-11-14 05:26:37,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:26:37,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-14 05:26:37,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:37,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-14 05:26:37,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=822, Unknown=6, NotChecked=0, Total=992 [2024-11-14 05:26:37,082 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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-14 05:26:40,570 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-14 05:26:42,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:42,410 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2024-11-14 05:26:42,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-14 05:26:42,411 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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 12 [2024-11-14 05:26:42,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:42,411 INFO L225 Difference]: With dead ends: 43 [2024-11-14 05:26:42,411 INFO L226 Difference]: Without dead ends: 38 [2024-11-14 05:26:42,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=381, Invalid=1851, Unknown=24, NotChecked=0, Total=2256 [2024-11-14 05:26:42,413 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 66 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:42,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 29 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 153 Invalid, 7 Unknown, 0 Unchecked, 2.9s Time] [2024-11-14 05:26:42,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-14 05:26:42,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 21. [2024-11-14 05:26:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 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-14 05:26:42,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2024-11-14 05:26:42,433 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 12 [2024-11-14 05:26:42,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:42,433 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2024-11-14 05:26:42,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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-14 05:26:42,433 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2024-11-14 05:26:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-14 05:26:42,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:42,434 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:42,452 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 05:26:42,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-14 05:26:42,634 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:26:42,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:42,635 INFO L85 PathProgramCache]: Analyzing trace with hash -815132391, now seen corresponding path program 6 times [2024-11-14 05:26:42,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:42,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735054281] [2024-11-14 05:26:42,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:42,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:26:43,000 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:43,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735054281] [2024-11-14 05:26:43,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735054281] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:26:43,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812954790] [2024-11-14 05:26:43,000 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:26:43,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:43,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:26:43,003 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:26:43,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 05:26:43,169 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:26:43,169 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:26:43,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 05:26:43,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:26:43,407 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:26:43,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:26:43,548 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:26:43,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812954790] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:26:43,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1457449385] [2024-11-14 05:26:43,550 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2024-11-14 05:26:43,550 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:26:43,551 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:26:43,551 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:26:43,551 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:26:43,924 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:26:44,368 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '884#(exists ((|v_ULTIMATE.start_main_~#sum~0#1.offset_36| Int)) (<= (+ (* 3 ~N~0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |v_ULTIMATE.start_main_~#sum~0#1.offset_36|)))' at error location [2024-11-14 05:26:44,368 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:26:44,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:26:44,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 17 [2024-11-14 05:26:44,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834103686] [2024-11-14 05:26:44,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:26:44,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-14 05:26:44,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:44,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-14 05:26:44,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2024-11-14 05:26:44,370 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 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-14 05:26:44,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:44,593 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2024-11-14 05:26:44,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:26:44,594 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-14 05:26:44,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:44,595 INFO L225 Difference]: With dead ends: 33 [2024-11-14 05:26:44,595 INFO L226 Difference]: Without dead ends: 24 [2024-11-14 05:26:44,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2024-11-14 05:26:44,597 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:44,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:26:44,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-14 05:26:44,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2024-11-14 05:26:44,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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-14 05:26:44,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-11-14 05:26:44,620 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 14 [2024-11-14 05:26:44,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:44,620 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-14 05:26:44,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 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-14 05:26:44,621 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2024-11-14 05:26:44,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-14 05:26:44,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:44,621 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:44,637 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 05:26:44,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-14 05:26:44,825 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:26:44,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:44,826 INFO L85 PathProgramCache]: Analyzing trace with hash -85952343, now seen corresponding path program 7 times [2024-11-14 05:26:44,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:44,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530907069] [2024-11-14 05:26:44,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:44,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:26:46,343 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:46,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530907069] [2024-11-14 05:26:46,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530907069] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:26:46,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245498436] [2024-11-14 05:26:46,344 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:26:46,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:46,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:26:46,346 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:26:46,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 05:26:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:46,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-14 05:26:46,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:26:46,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-14 05:26:46,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:26:46,526 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 19 treesize of output 18 [2024-11-14 05:26:46,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-14 05:26:46,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-11-14 05:26:46,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2024-11-14 05:26:46,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2024-11-14 05:26:47,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2024-11-14 05:26:47,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2024-11-14 05:26:47,187 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:26:47,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:26:47,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 05:26:48,237 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (+ (* c_~N~0 3) 1)) (.cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (= |c_ULTIMATE.start_main_~i~0#1| 0))) (and (or .cse0 (let ((.cse4 (= (+ |c_ULTIMATE.start_main_~i~0#1| 1) 0))) (and (or (and (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_321 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_325 Int)) (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (or (< (+ v_ArrVal_325 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_DerPreprocessor_10 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_325)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse2) (< (+ (select v_DerPreprocessor_10 |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) v_ArrVal_321) (< (+ v_ArrVal_321 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_DerPreprocessor_10 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_321)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_325)))) (not (= (+ 3 |c_ULTIMATE.start_main_~i~0#1|) 0)) (or (not (= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 0)) (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int))) (< (+ (select v_DerPreprocessor_8 |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) .cse2)))) .cse4) (or (not .cse4) (forall ((v_DerPreprocessor_9 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_prenex_31 Int)) (or (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (select v_DerPreprocessor_9 |ULTIMATE.start_main_~#sum~0#1.offset|)) v_prenex_31) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_DerPreprocessor_9 |ULTIMATE.start_main_~#sum~0#1.offset| v_prenex_31)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) v_prenex_31) .cse2))))))) (or (forall ((v_ArrVal_321 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_317 Int) (v_ArrVal_325 Int)) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< 0 v_ArrVal_317) (< (+ v_ArrVal_317 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_317)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) v_ArrVal_321) (< (+ v_ArrVal_325 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_325)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse2) (< (+ v_ArrVal_321 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_321)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) v_ArrVal_325)))) (not .cse0)))) is different from false [2024-11-14 05:27:02,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:27:02,844 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 1970 treesize of output 1950 [2024-11-14 05:27:02,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:27:02,984 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 1 case distinctions, treesize of input 15 treesize of output 14 [2024-11-14 05:27:03,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:27:03,089 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 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-14 05:27:10,272 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-11-14 05:27:10,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 133665 treesize of output 124908 [2024-11-14 05:27:14,792 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 15 refuted. 1 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-14 05:27:14,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245498436] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:27:14,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [716191311] [2024-11-14 05:27:14,794 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2024-11-14 05:27:14,794 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:27:14,795 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:27:14,795 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:27:14,795 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:27:15,016 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:27:16,177 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1098#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (* 3 ~N~0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) 0)))' at error location [2024-11-14 05:27:16,177 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:27:16,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:27:16,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2024-11-14 05:27:16,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197304949] [2024-11-14 05:27:16,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:27:16,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-14 05:27:16,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:27:16,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-14 05:27:16,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1107, Unknown=7, NotChecked=68, Total=1332 [2024-11-14 05:27:16,179 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 32 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-14 05:27:24,192 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, 1] [2024-11-14 05:27:26,205 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 [0, 1] [2024-11-14 05:27:28,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:27:28,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:27:28,685 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2024-11-14 05:27:28,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 05:27:28,685 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 32 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 14 [2024-11-14 05:27:28,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:27:28,686 INFO L225 Difference]: With dead ends: 29 [2024-11-14 05:27:28,686 INFO L226 Difference]: Without dead ends: 25 [2024-11-14 05:27:28,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=216, Invalid=1502, Unknown=8, NotChecked=80, Total=1806 [2024-11-14 05:27:28,687 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 14 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:27:28,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 27 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 180 Invalid, 3 Unknown, 17 Unchecked, 6.9s Time] [2024-11-14 05:27:28,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-14 05:27:28,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2024-11-14 05:27:28,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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-14 05:27:28,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-11-14 05:27:28,704 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2024-11-14 05:27:28,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:27:28,704 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-11-14 05:27:28,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 32 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-14 05:27:28,704 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-11-14 05:27:28,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 05:27:28,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:27:28,705 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2024-11-14 05:27:28,717 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-14 05:27:28,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-14 05:27:28,905 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:27:28,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:27:28,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1630346629, now seen corresponding path program 8 times [2024-11-14 05:27:28,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:27:28,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284421649] [2024-11-14 05:27:28,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:27:28,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:27:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:27:29,188 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:27:29,188 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:27:29,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284421649] [2024-11-14 05:27:29,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284421649] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:27:29,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268622847] [2024-11-14 05:27:29,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:27:29,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:27:29,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:27:29,190 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:27:29,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 05:27:29,310 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-14 05:27:29,310 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:27:29,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 05:27:29,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:27:29,553 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:27:29,554 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:27:29,735 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:27:29,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268622847] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:27:29,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2011297283] [2024-11-14 05:27:29,737 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2024-11-14 05:27:29,737 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:27:29,737 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:27:29,737 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:27:29,737 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:27:29,901 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:27:30,184 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1295#(exists ((|v_ULTIMATE.start_main_~#sum~0#1.offset_41| Int)) (<= (+ (* 3 ~N~0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |v_ULTIMATE.start_main_~#sum~0#1.offset_41|)))' at error location [2024-11-14 05:27:30,184 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:27:30,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:27:30,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2024-11-14 05:27:30,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604425421] [2024-11-14 05:27:30,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:27:30,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 05:27:30,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:27:30,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 05:27:30,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2024-11-14 05:27:30,186 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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-14 05:27:30,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:27:30,360 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2024-11-14 05:27:30,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 05:27:30,360 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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-14 05:27:30,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:27:30,361 INFO L225 Difference]: With dead ends: 26 [2024-11-14 05:27:30,361 INFO L226 Difference]: Without dead ends: 17 [2024-11-14 05:27:30,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=161, Invalid=595, Unknown=0, NotChecked=0, Total=756 [2024-11-14 05:27:30,362 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:27:30,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:27:30,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-14 05:27:30,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-14 05:27:30,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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-14 05:27:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-11-14 05:27:30,380 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2024-11-14 05:27:30,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:27:30,380 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-11-14 05:27:30,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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-14 05:27:30,380 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-11-14 05:27:30,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 05:27:30,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:27:30,381 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1] [2024-11-14 05:27:30,393 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 05:27:30,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-14 05:27:30,582 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:27:30,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:27:30,582 INFO L85 PathProgramCache]: Analyzing trace with hash 130784921, now seen corresponding path program 9 times [2024-11-14 05:27:30,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:27:30,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309589080] [2024-11-14 05:27:30,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:27:30,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:27:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:27:32,566 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:27:32,566 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:27:32,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309589080] [2024-11-14 05:27:32,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309589080] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:27:32,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434089342] [2024-11-14 05:27:32,567 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:27:32,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:27:32,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:27:32,568 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:27:32,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 05:27:32,658 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:27:32,658 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:27:32,660 WARN L253 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-14 05:27:32,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:27:32,672 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 74 treesize of output 61 [2024-11-14 05:27:32,681 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 17 treesize of output 16 [2024-11-14 05:27:32,698 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 19 treesize of output 18 [2024-11-14 05:27:32,764 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 133 treesize of output 117 [2024-11-14 05:27:32,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 117 treesize of output 145 [2024-11-14 05:27:32,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:32,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 52 treesize of output 20 [2024-11-14 05:27:33,028 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 224 treesize of output 200 [2024-11-14 05:27:33,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:27:33,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 200 treesize of output 220 [2024-11-14 05:27:33,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 141 treesize of output 101 [2024-11-14 05:27:33,552 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 335 treesize of output 299 [2024-11-14 05:27:33,602 INFO L349 Elim1Store]: treesize reduction 72, result has 15.3 percent of original size [2024-11-14 05:27:33,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 299 treesize of output 311 [2024-11-14 05:27:33,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:33,861 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 05:27:33,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 377 treesize of output 299 [2024-11-14 05:27:52,456 WARN L286 SmtUtils]: Spent 11.33s on a formula simplification. DAG size of input: 699 DAG size of output: 321 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 05:27:52,456 INFO L349 Elim1Store]: treesize reduction 2459, result has 30.3 percent of original size [2024-11-14 05:27:52,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 25 select indices, 25 select index equivalence classes, 0 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 325 case distinctions, treesize of input 1331 treesize of output 1588 [2024-11-14 05:31:18,225 WARN L286 SmtUtils]: Spent 5.14s on a formula simplification. DAG size of input: 362 DAG size of output: 330 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:31:23,545 INFO L349 Elim1Store]: treesize reduction 747, result has 44.2 percent of original size [2024-11-14 05:31:23,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 104 case distinctions, treesize of input 4742 treesize of output 2444 [2024-11-14 05:34:36,500 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2024-11-14 05:34:36,500 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-14 05:34:36,501 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2024-11-14 05:34:36,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [196596246] [2024-11-14 05:34:36,502 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2024-11-14 05:34:36,502 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:34:36,503 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:34:36,503 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:34:36,503 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:34:36,506 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:326) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:220) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:447) at java.base/java.io.OutputStream.write(OutputStream.java:167) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:125) at java.base/java.io.BufferedOutputStream.implFlush(BufferedOutputStream.java:252) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:246) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:412) at java.base/sun.nio.cs.StreamEncoder.lockedFlush(StreamEncoder.java:214) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:201) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:262) at java.base/java.io.BufferedWriter.implFlush(BufferedWriter.java:372) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:359) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 44 more [2024-11-14 05:34:36,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:34:36,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2024-11-14 05:34:36,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076397148] [2024-11-14 05:34:36,515 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-14 05:34:36,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 05:34:36,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:34:36,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 05:34:36,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=354, Unknown=1, NotChecked=0, Total=420 [2024-11-14 05:34:36,516 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 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-14 05:34:36,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=65, Invalid=354, Unknown=1, NotChecked=0, Total=420 [2024-11-14 05:34:36,517 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:34:36,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:34:36,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 05:34:36,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-14 05:34:36,718 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_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertCodeBlock(IncrementalHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:278) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1708) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:762) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:385) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:447) at java.base/java.io.OutputStream.write(OutputStream.java:167) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:125) at java.base/java.io.BufferedOutputStream.implFlush(BufferedOutputStream.java:252) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:246) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:412) at java.base/sun.nio.cs.StreamEncoder.lockedFlush(StreamEncoder.java:214) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:201) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:262) at java.base/java.io.BufferedWriter.implFlush(BufferedWriter.java:372) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:359) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2024-11-14 05:34:36,721 INFO L158 Benchmark]: Toolchain (without parser) took 509098.94ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 119.3MB in the beginning and 687.4MB in the end (delta: -568.1MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2024-11-14 05:34:36,721 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 142.6MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:34:36,721 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.34ms. Allocated memory is still 142.6MB. Free memory was 119.3MB in the beginning and 108.1MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 05:34:36,722 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.94ms. Allocated memory is still 142.6MB. Free memory was 107.8MB in the beginning and 106.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:34:36,722 INFO L158 Benchmark]: Boogie Preprocessor took 35.86ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 105.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:34:36,722 INFO L158 Benchmark]: RCFGBuilder took 425.94ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 92.0MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 05:34:36,722 INFO L158 Benchmark]: TraceAbstraction took 508291.99ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 91.5MB in the beginning and 687.4MB in the end (delta: -595.9MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-11-14 05:34:36,724 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 142.6MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.34ms. Allocated memory is still 142.6MB. Free memory was 119.3MB in the beginning and 108.1MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.94ms. Allocated memory is still 142.6MB. Free memory was 107.8MB in the beginning and 106.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.86ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 105.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 425.94ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 92.0MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 508291.99ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 91.5MB in the beginning and 687.4MB in the end (delta: -595.9MB). Peak memory consumption was 12.8MB. 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_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-fpi/ms4.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 83260f11871b199c66fbefacd24c95d84ae219136106a5a3246a879f7c60a3e2 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:34:39,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:34:39,368 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-14 05:34:39,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:34:39,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:34:39,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:34:39,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:34:39,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:34:39,413 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:34:39,413 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:34:39,414 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:34:39,414 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:34:39,414 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:34:39,414 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:34:39,414 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:34:39,414 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:34:39,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:34:39,415 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 05:34:39,415 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:34:39,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:34:39,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:34:39,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 05:34:39,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:34:39,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 05:34:39,416 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 05:34:39,416 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 05:34:39,417 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:34:39,417 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 05:34:39,417 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:34:39,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 05:34:39,417 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:34:39,417 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:34:39,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 05:34:39,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:34:39,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:34:39,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:34:39,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:34:39,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:34:39,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 05:34:39,419 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 05:34:39,419 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 05:34:39,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:34:39,419 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:34:39,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 83260f11871b199c66fbefacd24c95d84ae219136106a5a3246a879f7c60a3e2 [2024-11-14 05:34:39,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:34:39,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:34:39,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:34:39,874 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:34:39,874 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:34:39,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/array-fpi/ms4.c Unable to find full path for "g++" [2024-11-14 05:34:41,865 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:34:42,128 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:34:42,132 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/sv-benchmarks/c/array-fpi/ms4.c [2024-11-14 05:34:42,143 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/data/f59226b54/694636c809804ea8bcfa285b50367f77/FLAGf3e8d7b03 [2024-11-14 05:34:42,166 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/data/f59226b54/694636c809804ea8bcfa285b50367f77 [2024-11-14 05:34:42,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:34:42,170 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:34:42,172 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:34:42,173 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:34:42,177 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:34:42,178 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:34:42" (1/1) ... [2024-11-14 05:34:42,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eac9618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:42, skipping insertion in model container [2024-11-14 05:34:42,181 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:34:42" (1/1) ... [2024-11-14 05:34:42,195 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:34:42,365 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_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/sv-benchmarks/c/array-fpi/ms4.c[586,599] [2024-11-14 05:34:42,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:34:42,416 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:34:42,431 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_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/sv-benchmarks/c/array-fpi/ms4.c[586,599] [2024-11-14 05:34:42,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:34:42,471 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:34:42,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:42 WrapperNode [2024-11-14 05:34:42,472 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:34:42,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:34:42,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:34:42,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:34:42,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:42" (1/1) ... [2024-11-14 05:34:42,491 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:42" (1/1) ... [2024-11-14 05:34:42,515 INFO L138 Inliner]: procedures = 21, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2024-11-14 05:34:42,517 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:34:42,518 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:34:42,518 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:34:42,519 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:34:42,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:42" (1/1) ... [2024-11-14 05:34:42,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:42" (1/1) ... [2024-11-14 05:34:42,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:42" (1/1) ... [2024-11-14 05:34:42,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:42" (1/1) ... [2024-11-14 05:34:42,544 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:42" (1/1) ... [2024-11-14 05:34:42,547 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:42" (1/1) ... [2024-11-14 05:34:42,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:42" (1/1) ... [2024-11-14 05:34:42,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:42" (1/1) ... [2024-11-14 05:34:42,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:34:42,559 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:34:42,559 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:34:42,559 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:34:42,560 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:42" (1/1) ... [2024-11-14 05:34:42,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:34:42,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:34:42,595 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:34:42,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:34:42,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:34:42,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 05:34:42,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 05:34:42,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2024-11-14 05:34:42,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:34:42,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-14 05:34:42,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:34:42,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:34:42,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2024-11-14 05:34:42,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 05:34:42,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-14 05:34:42,733 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:34:42,735 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:34:42,968 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-14 05:34:42,968 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:34:42,979 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:34:42,979 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-14 05:34:42,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:34:42 BoogieIcfgContainer [2024-11-14 05:34:42,980 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:34:42,983 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:34:42,983 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:34:42,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:34:42,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:34:42" (1/3) ... [2024-11-14 05:34:42,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bac35ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:34:42, skipping insertion in model container [2024-11-14 05:34:42,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:42" (2/3) ... [2024-11-14 05:34:42,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bac35ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:34:42, skipping insertion in model container [2024-11-14 05:34:42,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:34:42" (3/3) ... [2024-11-14 05:34:42,993 INFO L112 eAbstractionObserver]: Analyzing ICFG ms4.c [2024-11-14 05:34:43,011 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:34:43,014 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG ms4.c that has 1 procedures, 18 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-14 05:34:43,081 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:34:43,097 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;@276868d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:34:43,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 05:34:43,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 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-14 05:34:43,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 05:34:43,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:34:43,111 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:34:43,111 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:34:43,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:34:43,118 INFO L85 PathProgramCache]: Analyzing trace with hash 354752829, now seen corresponding path program 1 times [2024-11-14 05:34:43,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:34:43,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725593677] [2024-11-14 05:34:43,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:34:43,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:34:43,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:34:43,134 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:34:43,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-14 05:34:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:34:43,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-14 05:34:43,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:34:43,296 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-14 05:34:43,297 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:34:43,298 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:34:43,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725593677] [2024-11-14 05:34:43,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1725593677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:34:43,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:34:43,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:34:43,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617814889] [2024-11-14 05:34:43,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:34:43,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 05:34:43,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:34:43,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 05:34:43,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 05:34:43,364 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 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 5.5) internal successors, (11), 2 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-14 05:34:43,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:34:43,380 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2024-11-14 05:34:43,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 05:34:43,383 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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-14 05:34:43,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:34:43,389 INFO L225 Difference]: With dead ends: 32 [2024-11-14 05:34:43,389 INFO L226 Difference]: Without dead ends: 14 [2024-11-14 05:34:43,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 05:34:43,398 INFO L432 NwaCegarLoop]: 21 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, 21 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:34:43,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:34:43,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-14 05:34:43,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-14 05:34:43,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 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-14 05:34:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2024-11-14 05:34:43,433 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2024-11-14 05:34:43,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:34:43,434 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-14 05:34:43,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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-14 05:34:43,434 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2024-11-14 05:34:43,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 05:34:43,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:34:43,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:34:43,440 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-14 05:34:43,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:34:43,638 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:34:43,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:34:43,638 INFO L85 PathProgramCache]: Analyzing trace with hash -454593797, now seen corresponding path program 1 times [2024-11-14 05:34:43,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:34:43,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841039628] [2024-11-14 05:34:43,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:34:43,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:34:43,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:34:43,642 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:34:43,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-14 05:34:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:34:43,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:34:43,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:34:43,945 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-14 05:34:43,946 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:34:43,947 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:34:43,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841039628] [2024-11-14 05:34:43,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1841039628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:34:43,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:34:43,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:34:43,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551697127] [2024-11-14 05:34:43,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:34:43,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:34:43,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:34:43,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:34:43,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:34:43,952 INFO L87 Difference]: Start difference. First operand 14 states and 16 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-14 05:34:44,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:34:44,074 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2024-11-14 05:34:44,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:34:44,076 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-14 05:34:44,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:34:44,077 INFO L225 Difference]: With dead ends: 26 [2024-11-14 05:34:44,077 INFO L226 Difference]: Without dead ends: 18 [2024-11-14 05:34:44,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:34:44,078 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 17 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:34:44,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 13 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:34:44,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-14 05:34:44,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-11-14 05:34:44,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 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-14 05:34:44,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-14 05:34:44,089 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2024-11-14 05:34:44,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:34:44,090 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-14 05:34:44,090 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-14 05:34:44,091 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-14 05:34:44,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 05:34:44,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:34:44,092 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:34:44,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-14 05:34:44,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:34:44,293 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:34:44,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:34:44,293 INFO L85 PathProgramCache]: Analyzing trace with hash 340215071, now seen corresponding path program 1 times [2024-11-14 05:34:44,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:34:44,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32656771] [2024-11-14 05:34:44,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:34:44,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:34:44,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:34:44,298 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:34:44,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-14 05:34:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:34:44,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 05:34:44,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:34:44,550 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:34:44,558 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 18 treesize of output 19 [2024-11-14 05:34:44,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:34:44,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 35 [2024-11-14 05:34:44,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:34:44,818 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:34:44,818 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:34:44,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32656771] [2024-11-14 05:34:44,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32656771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:34:44,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:34:44,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:34:44,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16186058] [2024-11-14 05:34:44,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:34:44,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:34:44,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:34:44,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:34:44,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:34:44,822 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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-14 05:34:44,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:34:44,981 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2024-11-14 05:34:44,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:34:44,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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 15 [2024-11-14 05:34:44,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:34:44,983 INFO L225 Difference]: With dead ends: 24 [2024-11-14 05:34:44,983 INFO L226 Difference]: Without dead ends: 20 [2024-11-14 05:34:44,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:34:44,984 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:34:44,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 24 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:34:44,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-14 05:34:44,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2024-11-14 05:34:44,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 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-14 05:34:44,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-14 05:34:44,992 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2024-11-14 05:34:44,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:34:44,993 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-14 05:34:44,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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-14 05:34:44,994 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-14 05:34:44,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 05:34:44,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:34:44,995 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:34:44,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-14 05:34:45,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:34:45,196 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:34:45,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:34:45,196 INFO L85 PathProgramCache]: Analyzing trace with hash 820637955, now seen corresponding path program 1 times [2024-11-14 05:34:45,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:34:45,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099035775] [2024-11-14 05:34:45,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:34:45,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:34:45,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:34:45,203 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:34:45,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-14 05:34:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:34:45,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 05:34:45,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:34:45,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:34:45,557 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:34:45,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:34:45,751 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:34:45,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099035775] [2024-11-14 05:34:45,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099035775] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:34:45,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1910695617] [2024-11-14 05:34:45,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:34:45,751 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:34:45,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:34:45,761 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:34:45,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-14 05:34:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:34:45,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 05:34:45,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:34:46,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:34:46,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:34:46,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:34:46,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1910695617] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:34:46,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032234626] [2024-11-14 05:34:46,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:34:46,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:34:46,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:34:46,085 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:34:46,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 05:34:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:34:46,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 05:34:46,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:34:46,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:34:46,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:34:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:34:46,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032234626] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:34:46,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 05:34:46,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8, 7, 9, 7] total 17 [2024-11-14 05:34:46,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938268594] [2024-11-14 05:34:46,355 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 05:34:46,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-14 05:34:46,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:34:46,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-14 05:34:46,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-14 05:34:46,362 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:34:46,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:34:46,651 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2024-11-14 05:34:46,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 05:34:46,652 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-14 05:34:46,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:34:46,652 INFO L225 Difference]: With dead ends: 36 [2024-11-14 05:34:46,653 INFO L226 Difference]: Without dead ends: 22 [2024-11-14 05:34:46,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2024-11-14 05:34:46,654 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 21 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:34:46,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 27 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:34:46,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-14 05:34:46,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-11-14 05:34:46,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:34:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-11-14 05:34:46,658 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 18 [2024-11-14 05:34:46,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:34:46,659 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-11-14 05:34:46,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:34:46,659 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-11-14 05:34:46,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 05:34:46,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:34:46,660 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:34:46,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-14 05:34:46,865 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-14 05:34:47,065 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-14 05:34:47,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:34:47,264 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:34:47,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:34:47,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1848314183, now seen corresponding path program 2 times [2024-11-14 05:34:47,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:34:47,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534907631] [2024-11-14 05:34:47,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 05:34:47,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:34:47,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:34:47,268 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:34:47,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-14 05:34:47,375 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 05:34:47,375 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:34:47,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-14 05:34:47,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:34:47,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-14 05:34:47,597 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 13 treesize of output 9 [2024-11-14 05:34:47,841 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:34:47,842 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 28 treesize of output 31 [2024-11-14 05:34:48,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:34:48,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 49 [2024-11-14 05:34:48,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:34:48,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 52 [2024-11-14 05:34:48,448 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:34:48,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:34:49,478 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 350 treesize of output 338 [2024-11-14 05:34:50,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-14 05:34:50,600 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:34:50,600 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:34:50,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534907631] [2024-11-14 05:34:50,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [534907631] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:34:50,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1861735563] [2024-11-14 05:34:50,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 05:34:50,601 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:34:50,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:34:50,603 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:34:50,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-14 05:34:50,768 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 05:34:50,768 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:34:50,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-14 05:34:50,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:34:51,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:34:51,588 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:34:51,613 INFO L349 Elim1Store]: treesize reduction 14, result has 44.0 percent of original size [2024-11-14 05:34:51,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2024-11-14 05:34:52,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:34:52,177 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 0 case distinctions, treesize of input 66 treesize of output 45 [2024-11-14 05:34:52,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:34:52,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 80 treesize of output 52 [2024-11-14 05:34:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:34:52,545 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:34:53,081 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 350 treesize of output 338 [2024-11-14 05:34:53,979 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:34:53,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1861735563] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:34:53,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019548257] [2024-11-14 05:34:53,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 05:34:53,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:34:53,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:34:53,983 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:34:53,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 05:34:54,071 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 05:34:54,071 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:34:54,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-14 05:34:54,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:34:54,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-14 05:34:54,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:34:54,660 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:34:54,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2024-11-14 05:34:55,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:34:55,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 47 [2024-11-14 05:34:55,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:34:55,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 52 [2024-11-14 05:34:55,561 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:34:55,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:34:57,017 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 350 treesize of output 338 [2024-11-14 05:34:57,903 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:34:57,906 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 05:34:57,907 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:34:57,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019548257] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:34:57,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 05:34:57,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12, 10, 14, 12] total 52 [2024-11-14 05:34:57,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76850989] [2024-11-14 05:34:57,908 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 05:34:57,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-14 05:34:57,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:34:57,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-14 05:34:57,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=2203, Unknown=0, NotChecked=0, Total=2652 [2024-11-14 05:34:57,911 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 52 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 52 states have internal predecessors, (82), 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-14 05:35:11,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:35:11,771 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2024-11-14 05:35:11,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-14 05:35:11,773 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 52 states have internal predecessors, (82), 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-14 05:35:11,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:35:11,774 INFO L225 Difference]: With dead ends: 73 [2024-11-14 05:35:11,774 INFO L226 Difference]: Without dead ends: 50 [2024-11-14 05:35:11,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1934 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=1095, Invalid=4911, Unknown=0, NotChecked=0, Total=6006 [2024-11-14 05:35:11,782 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 149 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:35:11,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 51 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-14 05:35:11,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-14 05:35:11,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2024-11-14 05:35:11,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 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-14 05:35:11,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-11-14 05:35:11,805 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 19 [2024-11-14 05:35:11,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:35:11,805 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-11-14 05:35:11,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 52 states have internal predecessors, (82), 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-14 05:35:11,805 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-11-14 05:35:11,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 05:35:11,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:35:11,806 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:35:11,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 05:35:12,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-14 05:35:12,209 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-14 05:35:12,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:35:12,408 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:35:12,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:35:12,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1088281567, now seen corresponding path program 3 times [2024-11-14 05:35:12,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:35:12,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107081743] [2024-11-14 05:35:12,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:35:12,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:35:12,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:35:12,412 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:35:12,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-14 05:35:12,565 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-14 05:35:12,565 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:35:12,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-14 05:35:12,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:35:12,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-14 05:35:12,761 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 13 treesize of output 9 [2024-11-14 05:35:12,823 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 22 [2024-11-14 05:35:13,035 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:35:13,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:35:13,041 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 1 case distinctions, treesize of input 37 treesize of output 43 [2024-11-14 05:35:13,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:35:13,322 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 61 [2024-11-14 05:35:13,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:35:13,638 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 75 [2024-11-14 05:35:13,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:35:13,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 83 [2024-11-14 05:35:13,933 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:35:13,933 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:35:21,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:35:21,216 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 4546690 treesize of output 3972226 [2024-11-14 05:36:45,293 WARN L286 SmtUtils]: Spent 13.65s on a formula simplification that was a NOOP. DAG size: 347 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:36:59,758 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse343 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|)) (.cse342 (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|))) (or (let ((.cse341 ((_ extract 63 32) (_ bv0 64))) (.cse283 ((_ extract 31 0) (_ bv0 64)))) (let ((.cse20 (concat .cse341 .cse283)) (.cse224 ((_ sign_extend 32) (bvsrem .cse343 (_ bv4 32))))) (let ((.cse339 (bvadd .cse20 .cse224))) (let ((.cse17 ((_ sign_extend 32) (bvsrem .cse342 (_ bv4 32)))) (.cse263 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|)) (.cse206 ((_ extract 31 0) .cse339))) (let ((.cse53 (let ((.cse340 (bvadd ((_ sign_extend 32) .cse341) .cse20))) (concat ((_ extract 63 32) .cse340) ((_ extract 31 0) .cse340)))) (.cse57 (concat ((_ extract 63 32) .cse339) .cse206)) (.cse13 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv3 32)))) (.cse8 (= (_ bv0 32) (bvadd .cse263 (_ bv4 32)))) (.cse338 (bvadd .cse17 .cse20))) (let ((.cse159 ((_ extract 63 32) .cse338)) (.cse165 ((_ extract 31 0) .cse338)) (.cse166 (not .cse8)) (.cse30 (= .cse263 (_ bv4 32))) (.cse214 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse334 ((_ sign_extend 32) v_arrayElimCell_46))) (or (bvsle (let ((.cse333 (bvadd .cse334 .cse53))) (concat ((_ extract 63 32) .cse333) ((_ extract 31 0) .cse333))) .cse13) (bvsle (let ((.cse335 (bvadd (let ((.cse336 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (concat ((_ extract 63 32) .cse336) ((_ extract 31 0) .cse336))) .cse334))) (concat ((_ extract 63 32) .cse335) ((_ extract 31 0) .cse335))) .cse13) (bvsle (let ((.cse337 (bvadd .cse57 .cse334))) (concat ((_ extract 63 32) .cse337) ((_ extract 31 0) .cse337))) .cse13))))) (.cse46 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse331 ((_ sign_extend 32) v_arrayElimCell_46))) (or (bvsle (let ((.cse330 (bvadd .cse331 .cse53))) (concat ((_ extract 63 32) .cse330) ((_ extract 31 0) .cse330))) .cse13) (bvsle (let ((.cse332 (bvadd .cse57 .cse331))) (concat ((_ extract 63 32) .cse332) ((_ extract 31 0) .cse332))) .cse13))))) (.cse45 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (bvsle (let ((.cse329 (bvadd .cse57 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse329) ((_ extract 31 0) .cse329))) .cse13)))) (let ((.cse67 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse328 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse325 ((_ extract 63 32) .cse328))) (let ((.cse324 (concat .cse325 ((_ extract 31 0) .cse328))) (.cse322 ((_ sign_extend 32) v_arrayElimCell_46))) (or (bvsle (let ((.cse321 (bvadd .cse322 .cse53))) (concat ((_ extract 63 32) .cse321) ((_ extract 31 0) .cse321))) .cse13) (bvsle (let ((.cse323 (bvadd .cse324 ((_ sign_extend 32) .cse325)))) (concat ((_ extract 63 32) .cse323) ((_ extract 31 0) .cse323))) .cse13) (bvsle (let ((.cse326 (bvadd .cse324 .cse322))) (concat ((_ extract 63 32) .cse326) ((_ extract 31 0) .cse326))) .cse13) (bvsle (let ((.cse327 (bvadd .cse57 .cse322))) (concat ((_ extract 63 32) .cse327) ((_ extract 31 0) .cse327))) .cse13))))))) (.cse167 (and .cse46 .cse45)) (.cse47 (or .cse30 .cse214)) (.cse59 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse315 ((_ sign_extend 32) v_arrayElimCell_46))) (or (bvsle (let ((.cse314 (bvadd .cse315 .cse53))) (concat ((_ extract 63 32) .cse314) ((_ extract 31 0) .cse314))) .cse13) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse317 (let ((.cse319 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (concat ((_ extract 63 32) .cse319) ((_ extract 31 0) .cse319))))) (or (bvsle (let ((.cse316 (bvadd .cse17 .cse317))) (concat ((_ extract 63 32) .cse316) ((_ extract 31 0) .cse316))) .cse13) (bvsle (let ((.cse318 (bvadd .cse317 .cse315))) (concat ((_ extract 63 32) .cse318) ((_ extract 31 0) .cse318))) .cse13)))) (bvsle (let ((.cse320 (bvadd .cse57 .cse315))) (concat ((_ extract 63 32) .cse320) ((_ extract 31 0) .cse320))) .cse13))))) (.cse60 (or .cse46 .cse166)) (.cse62 (and .cse30 (bvsle (let ((.cse313 (bvadd .cse17 .cse53))) (concat ((_ extract 63 32) .cse313) ((_ extract 31 0) .cse313))) .cse13))) (.cse5 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse312 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse310 ((_ extract 63 32) .cse312))) (let ((.cse309 (concat .cse310 ((_ extract 31 0) .cse312)))) (or (bvsle (let ((.cse308 (bvadd .cse309 ((_ sign_extend 32) .cse310)))) (concat ((_ extract 63 32) .cse308) ((_ extract 31 0) .cse308))) .cse13) (bvsle (let ((.cse311 (bvadd .cse309 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse311) ((_ extract 31 0) .cse311))) .cse13))))))) (.cse85 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse307 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse305 ((_ extract 63 32) .cse307))) (let ((.cse304 (concat .cse305 ((_ extract 31 0) .cse307)))) (or (bvsle (let ((.cse303 (bvadd .cse304 ((_ sign_extend 32) .cse305)))) (concat ((_ extract 63 32) .cse303) ((_ extract 31 0) .cse303))) .cse13) (bvsle (let ((.cse306 (bvadd .cse17 .cse304))) (concat ((_ extract 63 32) .cse306) ((_ extract 31 0) .cse306))) .cse13))))))) (.cse90 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse301 ((_ sign_extend 32) v_arrayElimCell_46))) (or (bvsle (let ((.cse299 (bvadd (let ((.cse300 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (concat ((_ extract 63 32) .cse300) ((_ extract 31 0) .cse300))) .cse301))) (concat ((_ extract 63 32) .cse299) ((_ extract 31 0) .cse299))) .cse13) (bvsle (let ((.cse302 (bvadd .cse57 .cse301))) (concat ((_ extract 63 32) .cse302) ((_ extract 31 0) .cse302))) .cse13))))) (.cse9 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse296 (let ((.cse298 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (concat ((_ extract 63 32) .cse298) ((_ extract 31 0) .cse298))))) (or (bvsle (let ((.cse295 (bvadd .cse17 .cse296))) (concat ((_ extract 63 32) .cse295) ((_ extract 31 0) .cse295))) .cse13) (bvsle (let ((.cse297 (bvadd .cse296 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse297) ((_ extract 31 0) .cse297))) .cse13))))) (.cse61 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (bvsle (let ((.cse293 (bvadd .cse17 (let ((.cse294 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (concat ((_ extract 63 32) .cse294) ((_ extract 31 0) .cse294)))))) (concat ((_ extract 63 32) .cse293) ((_ extract 31 0) .cse293))) .cse13))) (.cse2 (not .cse30)) (.cse35 (or (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (bvsle (let ((.cse291 (bvadd (let ((.cse292 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (concat ((_ extract 63 32) .cse292) ((_ extract 31 0) .cse292))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse291) ((_ extract 31 0) .cse291))) .cse13)) .cse30)) (.cse132 (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse150 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse290 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse286 ((_ extract 63 32) .cse290))) (let ((.cse285 (concat .cse286 ((_ extract 31 0) .cse290))) (.cse288 ((_ sign_extend 32) v_arrayElimCell_46))) (or (bvsle (let ((.cse284 (bvadd .cse285 ((_ sign_extend 32) .cse286)))) (concat ((_ extract 63 32) .cse284) ((_ extract 31 0) .cse284))) .cse13) (bvsle (let ((.cse287 (bvadd .cse285 .cse288))) (concat ((_ extract 63 32) .cse287) ((_ extract 31 0) .cse287))) .cse13) (bvsle (let ((.cse289 (bvadd .cse57 .cse288))) (concat ((_ extract 63 32) .cse289) ((_ extract 31 0) .cse289))) .cse13))))))) (.cse123 (bvsle (let ((.cse280 (let ((.cse282 (bvadd .cse20 ((_ sign_extend 32) .cse283)))) (let ((.cse281 ((_ extract 63 32) .cse282))) (bvadd ((_ sign_extend 32) .cse281) (concat .cse281 ((_ extract 31 0) .cse282))))))) (concat ((_ extract 63 32) .cse280) ((_ extract 31 0) .cse280))) .cse13)) (.cse43 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse279 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse274 ((_ extract 31 0) .cse279))) (let ((.cse273 (concat ((_ extract 63 32) .cse279) .cse274)) (.cse276 ((_ sign_extend 32) v_arrayElimCell_46))) (or (bvsle (let ((.cse272 (bvadd .cse273 ((_ sign_extend 32) .cse274)))) (concat ((_ extract 63 32) .cse272) ((_ extract 31 0) .cse272))) .cse13) (bvsle (let ((.cse275 (bvadd .cse276 .cse53))) (concat ((_ extract 63 32) .cse275) ((_ extract 31 0) .cse275))) .cse13) (bvsle (let ((.cse277 (bvadd .cse273 .cse276))) (concat ((_ extract 63 32) .cse277) ((_ extract 31 0) .cse277))) .cse13) (bvsle (let ((.cse278 (bvadd .cse57 .cse276))) (concat ((_ extract 63 32) .cse278) ((_ extract 31 0) .cse278))) .cse13))))))) (.cse125 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse269 ((_ sign_extend 32) v_arrayElimCell_46))) (or (bvsle (let ((.cse268 (bvadd .cse269 .cse53))) (concat ((_ extract 63 32) .cse268) ((_ extract 31 0) .cse268))) .cse13) (bvsle (let ((.cse270 (bvadd (let ((.cse271 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (concat ((_ extract 63 32) .cse271) ((_ extract 31 0) .cse271))) .cse269))) (concat ((_ extract 63 32) .cse270) ((_ extract 31 0) .cse270))) .cse13))))) (.cse160 (concat .cse159 .cse165)) (.cse64 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (bvsle (let ((.cse267 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse53))) (concat ((_ extract 63 32) .cse267) ((_ extract 31 0) .cse267))) .cse13))) (.cse1 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (bvsle (let ((.cse264 (let ((.cse266 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse265 ((_ extract 63 32) .cse266))) (bvadd (concat .cse265 ((_ extract 31 0) .cse266)) ((_ sign_extend 32) .cse265)))))) (concat ((_ extract 63 32) .cse264) ((_ extract 31 0) .cse264))) .cse13)))) (let ((.cse0 (or .cse64 .cse30 .cse1)) (.cse63 (or .cse64 .cse30)) (.cse124 (= .cse263 (_ bv0 32))) (.cse129 (bvsle (let ((.cse262 (bvadd .cse224 .cse160))) (concat ((_ extract 63 32) .cse262) ((_ extract 31 0) .cse262))) .cse13)) (.cse96 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse261 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse258 ((_ extract 63 32) .cse261))) (let ((.cse257 (concat .cse258 ((_ extract 31 0) .cse261))) (.cse255 ((_ sign_extend 32) v_arrayElimCell_46))) (or (bvsle (let ((.cse254 (bvadd .cse255 .cse53))) (concat ((_ extract 63 32) .cse254) ((_ extract 31 0) .cse254))) .cse13) (bvsle (let ((.cse256 (bvadd .cse257 ((_ sign_extend 32) .cse258)))) (concat ((_ extract 63 32) .cse256) ((_ extract 31 0) .cse256))) .cse13) (bvsle (let ((.cse259 (bvadd .cse17 .cse257))) (concat ((_ extract 63 32) .cse259) ((_ extract 31 0) .cse259))) .cse13) (bvsle (let ((.cse260 (bvadd .cse257 .cse255))) (concat ((_ extract 63 32) .cse260) ((_ extract 31 0) .cse260))) .cse13))))))) (.cse94 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse249 ((_ sign_extend 32) v_arrayElimCell_46))) (or (bvsle (let ((.cse248 (bvadd .cse249 .cse53))) (concat ((_ extract 63 32) .cse248) ((_ extract 31 0) .cse248))) .cse13) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse251 (let ((.cse253 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (concat ((_ extract 63 32) .cse253) ((_ extract 31 0) .cse253))))) (or (bvsle (let ((.cse250 (bvadd .cse17 .cse251))) (concat ((_ extract 63 32) .cse250) ((_ extract 31 0) .cse250))) .cse13) (bvsle (let ((.cse252 (bvadd .cse251 .cse249))) (concat ((_ extract 63 32) .cse252) ((_ extract 31 0) .cse252))) .cse13)))))))) (.cse95 (or .cse30 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse247 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse245 ((_ extract 63 32) .cse247))) (let ((.cse244 (concat .cse245 ((_ extract 31 0) .cse247))) (.cse242 ((_ sign_extend 32) v_arrayElimCell_46))) (or (bvsle (let ((.cse241 (bvadd .cse242 .cse53))) (concat ((_ extract 63 32) .cse241) ((_ extract 31 0) .cse241))) .cse13) (bvsle (let ((.cse243 (bvadd .cse244 ((_ sign_extend 32) .cse245)))) (concat ((_ extract 63 32) .cse243) ((_ extract 31 0) .cse243))) .cse13) (bvsle (let ((.cse246 (bvadd .cse244 .cse242))) (concat ((_ extract 63 32) .cse246) ((_ extract 31 0) .cse246))) .cse13)))))))) (.cse97 (or (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse240 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse236 ((_ extract 31 0) .cse240))) (let ((.cse235 (concat ((_ extract 63 32) .cse240) .cse236)) (.cse238 ((_ sign_extend 32) v_arrayElimCell_46))) (or (bvsle (let ((.cse234 (bvadd .cse235 ((_ sign_extend 32) .cse236)))) (concat ((_ extract 63 32) .cse234) ((_ extract 31 0) .cse234))) .cse13) (bvsle (let ((.cse237 (bvadd .cse238 .cse53))) (concat ((_ extract 63 32) .cse237) ((_ extract 31 0) .cse237))) .cse13) (bvsle (let ((.cse239 (bvadd .cse235 .cse238))) (concat ((_ extract 63 32) .cse239) ((_ extract 31 0) .cse239))) .cse13)))))) .cse30)) (.cse106 (or .cse125 .cse30)) (.cse93 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse233 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse231 ((_ extract 63 32) .cse233)) (.cse227 ((_ extract 31 0) .cse233))) (let ((.cse226 (concat .cse231 .cse227)) (.cse229 ((_ sign_extend 32) v_arrayElimCell_46))) (or (bvsle (let ((.cse225 (bvadd .cse226 ((_ sign_extend 32) .cse227)))) (concat ((_ extract 63 32) .cse225) ((_ extract 31 0) .cse225))) .cse13) (bvsle (let ((.cse228 (bvadd .cse229 .cse53))) (concat ((_ extract 63 32) .cse228) ((_ extract 31 0) .cse228))) .cse13) (bvsle (let ((.cse230 (bvadd .cse226 ((_ sign_extend 32) .cse231)))) (concat ((_ extract 63 32) .cse230) ((_ extract 31 0) .cse230))) .cse13) (bvsle (let ((.cse232 (bvadd .cse226 .cse229))) (concat ((_ extract 63 32) .cse232) ((_ extract 31 0) .cse232))) .cse13))))))) (.cse128 (bvsle (let ((.cse223 (bvadd .cse224 .cse53))) (concat ((_ extract 63 32) .cse223) ((_ extract 31 0) .cse223))) .cse13)) (.cse70 (or (and .cse43 .cse46 .cse214 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse216 ((_ sign_extend 32) v_arrayElimCell_46))) (or (bvsle (let ((.cse215 (bvadd .cse216 .cse53))) (concat ((_ extract 63 32) .cse215) ((_ extract 31 0) .cse215))) .cse13) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse221 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse219 ((_ extract 31 0) .cse221))) (let ((.cse218 (concat ((_ extract 63 32) .cse221) .cse219))) (or (bvsle (let ((.cse217 (bvadd .cse218 ((_ sign_extend 32) .cse219)))) (concat ((_ extract 63 32) .cse217) ((_ extract 31 0) .cse217))) .cse13) (bvsle (let ((.cse220 (bvadd .cse218 .cse216))) (concat ((_ extract 63 32) .cse220) ((_ extract 31 0) .cse220))) .cse13)))))) (bvsle (let ((.cse222 (bvadd .cse57 .cse216))) (concat ((_ extract 63 32) .cse222) ((_ extract 31 0) .cse222))) .cse13)))) .cse45) .cse166)) (.cse92 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse211 ((_ sign_extend 32) v_arrayElimCell_46))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse212 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse209 ((_ extract 63 32) .cse212))) (let ((.cse208 (concat .cse209 ((_ extract 31 0) .cse212)))) (or (bvsle (let ((.cse207 (bvadd .cse208 ((_ sign_extend 32) .cse209)))) (concat ((_ extract 63 32) .cse207) ((_ extract 31 0) .cse207))) .cse13) (bvsle (let ((.cse210 (bvadd .cse208 .cse211))) (concat ((_ extract 63 32) .cse210) ((_ extract 31 0) .cse210))) .cse13)))))) (bvsle (let ((.cse213 (bvadd .cse57 .cse211))) (concat ((_ extract 63 32) .cse213) ((_ extract 31 0) .cse213))) .cse13))))) (.cse89 (or .cse150 .cse123)) (.cse91 (bvsle (let ((.cse205 (bvadd .cse57 ((_ sign_extend 32) .cse206)))) (concat ((_ extract 63 32) .cse205) ((_ extract 31 0) .cse205))) .cse13)) (.cse42 (or (and (or .cse90 .cse30) (or (and .cse9 (or .cse61 .cse2) .cse35) .cse8)) .cse132)) (.cse21 (or (and .cse61 .cse85) .cse2)) (.cse3 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse204 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse202 ((_ extract 31 0) .cse204))) (let ((.cse201 (concat ((_ extract 63 32) .cse204) .cse202))) (or (bvsle (let ((.cse200 (bvadd .cse201 ((_ sign_extend 32) .cse202)))) (concat ((_ extract 63 32) .cse200) ((_ extract 31 0) .cse200))) .cse13) (bvsle (let ((.cse203 (bvadd .cse201 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse203) ((_ extract 31 0) .cse203))) .cse13))))))) (.cse32 (or .cse30 .cse5)) (.cse33 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse199 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse196 ((_ extract 63 32) .cse199))) (let ((.cse195 (concat .cse196 ((_ extract 31 0) .cse199)))) (or (bvsle (let ((.cse194 (bvadd .cse195 ((_ sign_extend 32) .cse196)))) (concat ((_ extract 63 32) .cse194) ((_ extract 31 0) .cse194))) .cse13) (bvsle (let ((.cse197 (bvadd .cse17 .cse195))) (concat ((_ extract 63 32) .cse197) ((_ extract 31 0) .cse197))) .cse13) (bvsle (let ((.cse198 (bvadd .cse195 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse198) ((_ extract 31 0) .cse198))) .cse13))))))) (.cse34 (or .cse61 .cse2 .cse132)) (.cse31 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse193 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse191 ((_ extract 63 32) .cse193)) (.cse189 ((_ extract 31 0) .cse193))) (let ((.cse188 (concat .cse191 .cse189))) (or (bvsle (let ((.cse187 (bvadd .cse188 ((_ sign_extend 32) .cse189)))) (concat ((_ extract 63 32) .cse187) ((_ extract 31 0) .cse187))) .cse13) (bvsle (let ((.cse190 (bvadd .cse188 ((_ sign_extend 32) .cse191)))) (concat ((_ extract 63 32) .cse190) ((_ extract 31 0) .cse190))) .cse13) (bvsle (let ((.cse192 (bvadd .cse188 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse192) ((_ extract 31 0) .cse192))) .cse13))))))) (.cse87 (or (and (or .cse61 .cse45 .cse2) (or .cse46 .cse61 .cse2) .cse47 .cse59 .cse60) .cse62 .cse132)) (.cse88 (or .cse167 .cse166)) (.cse66 (or .cse46 .cse166 .cse1)) (.cse68 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse186 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse183 ((_ extract 63 32) .cse186)) (.cse179 ((_ extract 31 0) .cse186))) (let ((.cse178 (concat .cse183 .cse179)) (.cse181 ((_ sign_extend 32) v_arrayElimCell_46))) (or (bvsle (let ((.cse177 (bvadd .cse178 ((_ sign_extend 32) .cse179)))) (concat ((_ extract 63 32) .cse177) ((_ extract 31 0) .cse177))) .cse13) (bvsle (let ((.cse180 (bvadd .cse181 .cse53))) (concat ((_ extract 63 32) .cse180) ((_ extract 31 0) .cse180))) .cse13) (bvsle (let ((.cse182 (bvadd .cse178 ((_ sign_extend 32) .cse183)))) (concat ((_ extract 63 32) .cse182) ((_ extract 31 0) .cse182))) .cse13) (bvsle (let ((.cse184 (bvadd .cse178 .cse181))) (concat ((_ extract 63 32) .cse184) ((_ extract 31 0) .cse184))) .cse13) (bvsle (let ((.cse185 (bvadd .cse57 .cse181))) (concat ((_ extract 63 32) .cse185) ((_ extract 31 0) .cse185))) .cse13))))))) (.cse72 (or .cse67 .cse30)) (.cse73 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse169 ((_ sign_extend 32) v_arrayElimCell_46))) (or (bvsle (let ((.cse168 (bvadd .cse169 .cse53))) (concat ((_ extract 63 32) .cse168) ((_ extract 31 0) .cse168))) .cse13) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse175 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse172 ((_ extract 63 32) .cse175))) (let ((.cse171 (concat .cse172 ((_ extract 31 0) .cse175)))) (or (bvsle (let ((.cse170 (bvadd .cse171 ((_ sign_extend 32) .cse172)))) (concat ((_ extract 63 32) .cse170) ((_ extract 31 0) .cse170))) .cse13) (bvsle (let ((.cse173 (bvadd .cse17 .cse171))) (concat ((_ extract 63 32) .cse173) ((_ extract 31 0) .cse173))) .cse13) (bvsle (let ((.cse174 (bvadd .cse171 .cse169))) (concat ((_ extract 63 32) .cse174) ((_ extract 31 0) .cse174))) .cse13)))))) (bvsle (let ((.cse176 (bvadd .cse57 .cse169))) (concat ((_ extract 63 32) .cse176) ((_ extract 31 0) .cse176))) .cse13))))) (.cse86 (or .cse167 .cse166 .cse1)) (.cse117 (or .cse166 .cse45)) (.cse6 (not .cse132)) (.cse7 (bvsle (let ((.cse164 (bvadd ((_ sign_extend 32) .cse165) .cse160))) (concat ((_ extract 63 32) .cse164) ((_ extract 31 0) .cse164))) .cse13)) (.cse4 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (bvsle (let ((.cse161 (let ((.cse162 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse163 ((_ extract 31 0) .cse162))) (bvadd (concat ((_ extract 63 32) .cse162) .cse163) ((_ sign_extend 32) .cse163)))))) (concat ((_ extract 63 32) .cse161) ((_ extract 31 0) .cse161))) .cse13)))) (and (or (and .cse0 (or .cse1 .cse2) .cse3 .cse4 .cse5) .cse6 .cse7) (or (let ((.cse65 (and .cse123 .cse8)) (.cse29 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse122 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse120 ((_ extract 31 0) .cse122))) (let ((.cse119 (concat ((_ extract 63 32) .cse122) .cse120))) (or (bvsle (let ((.cse118 (bvadd .cse119 ((_ sign_extend 32) .cse120)))) (concat ((_ extract 63 32) .cse118) ((_ extract 31 0) .cse118))) .cse13) (bvsle (let ((.cse121 (bvadd .cse17 .cse119))) (concat ((_ extract 63 32) .cse121) ((_ extract 31 0) .cse121))) .cse13)))))))) (and (or .cse8 (and .cse9 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse19 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse15 ((_ extract 63 32) .cse19)) (.cse12 ((_ extract 31 0) .cse19))) (let ((.cse11 (concat .cse15 .cse12))) (or (bvsle (let ((.cse10 (bvadd .cse11 ((_ sign_extend 32) .cse12)))) (concat ((_ extract 63 32) .cse10) ((_ extract 31 0) .cse10))) .cse13) (bvsle (let ((.cse14 (bvadd .cse11 ((_ sign_extend 32) .cse15)))) (concat ((_ extract 63 32) .cse14) ((_ extract 31 0) .cse14))) .cse13) (bvsle (let ((.cse16 (bvadd .cse17 .cse11))) (concat ((_ extract 63 32) .cse16) ((_ extract 31 0) .cse16))) .cse13) (bvsle (let ((.cse18 (bvadd .cse11 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse18) ((_ extract 31 0) .cse18))) .cse13)))))) .cse21 (or (and (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse28 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse26 ((_ extract 63 32) .cse28)) (.cse24 ((_ extract 31 0) .cse28))) (let ((.cse23 (concat .cse26 .cse24))) (or (bvsle (let ((.cse22 (bvadd .cse23 ((_ sign_extend 32) .cse24)))) (concat ((_ extract 63 32) .cse22) ((_ extract 31 0) .cse22))) .cse13) (bvsle (let ((.cse25 (bvadd .cse23 ((_ sign_extend 32) .cse26)))) (concat ((_ extract 63 32) .cse25) ((_ extract 31 0) .cse25))) .cse13) (bvsle (let ((.cse27 (bvadd .cse17 .cse23))) (concat ((_ extract 63 32) .cse27) ((_ extract 31 0) .cse27))) .cse13)))))) .cse29) .cse2) (or .cse30 .cse31) (or .cse6 .cse4) .cse32 (or .cse3 .cse30) .cse33 .cse34 .cse35 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse41 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse38 ((_ extract 31 0) .cse41))) (let ((.cse37 (concat ((_ extract 63 32) .cse41) .cse38))) (or (bvsle (let ((.cse36 (bvadd .cse37 ((_ sign_extend 32) .cse38)))) (concat ((_ extract 63 32) .cse36) ((_ extract 31 0) .cse36))) .cse13) (bvsle (let ((.cse39 (bvadd .cse17 .cse37))) (concat ((_ extract 63 32) .cse39) ((_ extract 31 0) .cse39))) .cse13) (bvsle (let ((.cse40 (bvadd .cse37 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse40) ((_ extract 31 0) .cse40))) .cse13)))))))) .cse42 (or (let ((.cse44 (and .cse29 .cse61))) (and (or .cse43 .cse30) (or .cse44 .cse45 .cse2) (or .cse46 .cse6 .cse8 .cse4) .cse47 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse58 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse50 ((_ extract 31 0) .cse58))) (let ((.cse49 (concat ((_ extract 63 32) .cse58) .cse50)) (.cse52 ((_ sign_extend 32) v_arrayElimCell_46))) (or (bvsle (let ((.cse48 (bvadd .cse49 ((_ sign_extend 32) .cse50)))) (concat ((_ extract 63 32) .cse48) ((_ extract 31 0) .cse48))) .cse13) (bvsle (let ((.cse51 (bvadd .cse52 .cse53))) (concat ((_ extract 63 32) .cse51) ((_ extract 31 0) .cse51))) .cse13) (bvsle (let ((.cse54 (bvadd .cse17 .cse49))) (concat ((_ extract 63 32) .cse54) ((_ extract 31 0) .cse54))) .cse13) (bvsle (let ((.cse55 (bvadd .cse49 .cse52))) (concat ((_ extract 63 32) .cse55) ((_ extract 31 0) .cse55))) .cse13) (bvsle (let ((.cse56 (bvadd .cse57 .cse52))) (concat ((_ extract 63 32) .cse56) ((_ extract 31 0) .cse56))) .cse13)))))) (or .cse44 .cse46 .cse2) .cse59 .cse60)) .cse62) (or (and .cse63 (or .cse64 .cse30 .cse8)) .cse6) (or .cse65 (let ((.cse69 (or .cse46 .cse1 .cse6))) (and (or (and .cse66 .cse67 .cse68 .cse69) .cse30) .cse70 (or (let ((.cse71 (and .cse29 .cse85))) (and .cse66 (or .cse71 .cse45 .cse2) (or .cse68 .cse30) (or .cse46 .cse71 .cse2) .cse72 .cse73 .cse69 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse84 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse80 ((_ extract 63 32) .cse84)) (.cse76 ((_ extract 31 0) .cse84))) (let ((.cse75 (concat .cse80 .cse76)) (.cse78 ((_ sign_extend 32) v_arrayElimCell_46))) (or (bvsle (let ((.cse74 (bvadd .cse75 ((_ sign_extend 32) .cse76)))) (concat ((_ extract 63 32) .cse74) ((_ extract 31 0) .cse74))) .cse13) (bvsle (let ((.cse77 (bvadd .cse78 .cse53))) (concat ((_ extract 63 32) .cse77) ((_ extract 31 0) .cse77))) .cse13) (bvsle (let ((.cse79 (bvadd .cse75 ((_ sign_extend 32) .cse80)))) (concat ((_ extract 63 32) .cse79) ((_ extract 31 0) .cse79))) .cse13) (bvsle (let ((.cse81 (bvadd .cse17 .cse75))) (concat ((_ extract 63 32) .cse81) ((_ extract 31 0) .cse81))) .cse13) (bvsle (let ((.cse82 (bvadd .cse75 .cse78))) (concat ((_ extract 63 32) .cse82) ((_ extract 31 0) .cse82))) .cse13) (bvsle (let ((.cse83 (bvadd .cse57 .cse78))) (concat ((_ extract 63 32) .cse83) ((_ extract 31 0) .cse83))) .cse13)))))))) .cse62) .cse86))) .cse87 .cse88 (or .cse30 (and .cse89 .cse90 (or .cse91 .cse92) (or .cse92 .cse65))) (or (and (or .cse30 .cse93) .cse94 .cse95 .cse96 .cse97 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse99 ((_ sign_extend 32) v_arrayElimCell_46))) (or (bvsle (let ((.cse98 (bvadd .cse99 .cse53))) (concat ((_ extract 63 32) .cse98) ((_ extract 31 0) .cse98))) .cse13) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse105 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse102 ((_ extract 31 0) .cse105))) (let ((.cse101 (concat ((_ extract 63 32) .cse105) .cse102))) (or (bvsle (let ((.cse100 (bvadd .cse101 ((_ sign_extend 32) .cse102)))) (concat ((_ extract 63 32) .cse100) ((_ extract 31 0) .cse100))) .cse13) (bvsle (let ((.cse103 (bvadd .cse17 .cse101))) (concat ((_ extract 63 32) .cse103) ((_ extract 31 0) .cse103))) .cse13) (bvsle (let ((.cse104 (bvadd .cse101 .cse99))) (concat ((_ extract 63 32) .cse104) ((_ extract 31 0) .cse104))) .cse13))))))))) (or .cse2 (and .cse29 .cse61 .cse85)) (or .cse64 .cse6 .cse4) .cse106 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse116 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse113 ((_ extract 63 32) .cse116)) (.cse109 ((_ extract 31 0) .cse116))) (let ((.cse108 (concat .cse113 .cse109)) (.cse111 ((_ sign_extend 32) v_arrayElimCell_46))) (or (bvsle (let ((.cse107 (bvadd .cse108 ((_ sign_extend 32) .cse109)))) (concat ((_ extract 63 32) .cse107) ((_ extract 31 0) .cse107))) .cse13) (bvsle (let ((.cse110 (bvadd .cse111 .cse53))) (concat ((_ extract 63 32) .cse110) ((_ extract 31 0) .cse110))) .cse13) (bvsle (let ((.cse112 (bvadd .cse108 ((_ sign_extend 32) .cse113)))) (concat ((_ extract 63 32) .cse112) ((_ extract 31 0) .cse112))) .cse13) (bvsle (let ((.cse114 (bvadd .cse17 .cse108))) (concat ((_ extract 63 32) .cse114) ((_ extract 31 0) .cse114))) .cse13) (bvsle (let ((.cse115 (bvadd .cse108 .cse111))) (concat ((_ extract 63 32) .cse115) ((_ extract 31 0) .cse115))) .cse13))))))) .cse8 .cse62) .cse117)) .cse124) (or .cse6 (let ((.cse126 (or .cse64 .cse4)) (.cse127 (or .cse64 .cse61))) (and .cse0 .cse63 (or (and .cse125 .cse126 (or .cse64 .cse1) .cse127) .cse30) (or .cse30 (and .cse125 .cse126 .cse127)))) .cse128) (or (not .cse124) .cse129) (or .cse6 .cse123) (or .cse129 (let ((.cse148 (or .cse64 .cse6 .cse7 .cse4)) (.cse131 (bvsle (let ((.cse158 (bvadd ((_ sign_extend 32) .cse159) .cse160))) (concat ((_ extract 63 32) .cse158) ((_ extract 31 0) .cse158))) .cse13)) (.cse130 (or .cse64 .cse1 .cse6 .cse7))) (and (or (and .cse66 .cse67 .cse130 .cse68) .cse30) (or .cse8 (and (or .cse131 .cse96) (or .cse96 .cse132) (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse134 ((_ sign_extend 32) v_arrayElimCell_46))) (or (bvsle (let ((.cse133 (bvadd .cse134 .cse53))) (concat ((_ extract 63 32) .cse133) ((_ extract 31 0) .cse133))) .cse13) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse140 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse137 ((_ extract 63 32) .cse140))) (let ((.cse136 (concat .cse137 ((_ extract 31 0) .cse140)))) (or (bvsle (let ((.cse135 (bvadd .cse136 ((_ sign_extend 32) .cse137)))) (concat ((_ extract 63 32) .cse135) ((_ extract 31 0) .cse135))) .cse13) (bvsle (let ((.cse138 (bvadd .cse17 .cse136))) (concat ((_ extract 63 32) .cse138) ((_ extract 31 0) .cse138))) .cse13) (bvsle (let ((.cse139 (bvadd .cse136 .cse134))) (concat ((_ extract 63 32) .cse139) ((_ extract 31 0) .cse139))) .cse13))))))))) (or (and .cse61 .cse4 .cse85) .cse2) .cse94 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse142 ((_ sign_extend 32) v_arrayElimCell_46))) (or (bvsle (let ((.cse141 (bvadd .cse142 .cse53))) (concat ((_ extract 63 32) .cse141) ((_ extract 31 0) .cse141))) .cse13) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse147 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse145 ((_ extract 31 0) .cse147))) (let ((.cse144 (concat ((_ extract 63 32) .cse147) .cse145))) (or (bvsle (let ((.cse143 (bvadd .cse144 ((_ sign_extend 32) .cse145)))) (concat ((_ extract 63 32) .cse143) ((_ extract 31 0) .cse143))) .cse13) (bvsle (let ((.cse146 (bvadd .cse144 .cse142))) (concat ((_ extract 63 32) .cse146) ((_ extract 31 0) .cse146))) .cse13))))))))) .cse95 .cse97 .cse106 .cse148 .cse93) .cse62) (or .cse62 (let ((.cse149 (and .cse61 .cse4))) (and .cse43 (or .cse46 .cse149 .cse2) .cse47 .cse148 (or .cse149 .cse45 .cse2) .cse59 .cse60))) (or .cse64 .cse30 .cse6 .cse128) .cse70 (or .cse30 (and .cse90 .cse92 (or .cse131 (and .cse89 (or .cse91 .cse150))))) .cse42 (or .cse8 (and .cse9 .cse21 .cse3 .cse32 .cse33 .cse34 .cse31 (or (and (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse156 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_47)))) (let ((.cse155 ((_ extract 63 32) .cse156)) (.cse153 ((_ extract 31 0) .cse156))) (let ((.cse152 (concat .cse155 .cse153))) (or (bvsle (let ((.cse151 (bvadd .cse152 ((_ sign_extend 32) .cse153)))) (concat ((_ extract 63 32) .cse151) ((_ extract 31 0) .cse151))) .cse13) (bvsle (let ((.cse154 (bvadd .cse152 ((_ sign_extend 32) .cse155)))) (concat ((_ extract 63 32) .cse154) ((_ extract 31 0) .cse154))) .cse13)))))) .cse4) .cse2) .cse35 (or .cse6 .cse7 .cse4))) .cse87 .cse88 (or .cse62 (let ((.cse157 (and .cse4 .cse85))) (and (or .cse157 .cse45 .cse2) .cse66 (or .cse157 .cse46 .cse2) .cse130 .cse68 .cse72 .cse73))) .cse86 .cse117)))))))))))) (not (bvslt .cse343 c_~N~0)) (not (bvslt .cse342 c_~N~0)))) is different from false [2024-11-14 05:37:00,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-14 05:37:04,636 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-14 05:37:04,636 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:37:04,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107081743] [2024-11-14 05:37:04,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [107081743] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:37:04,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1864958962] [2024-11-14 05:37:04,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:37:04,637 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:37:04,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:37:04,640 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:37:04,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-14 05:37:04,799 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-14 05:37:04,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739688439] [2024-11-14 05:37:04,799 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:37:04,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:37:04,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:37:04,801 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 1 [2024-11-14 05:37:04,803 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:37:04,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-14 05:37:04,925 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-14 05:37:04,925 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:37:04,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-14 05:37:04,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:37:04,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-14 05:37:05,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:37:05,956 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 19 treesize of output 18 [2024-11-14 05:37:07,402 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:37:07,404 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 33 treesize of output 39 [2024-11-14 05:37:08,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:37:08,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 57 [2024-11-14 05:37:09,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:37:09,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 71 [2024-11-14 05:37:11,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:37:11,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 83 [2024-11-14 05:37:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:37:11,199 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:37:27,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:37:27,720 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 4546690 treesize of output 1 [2024-11-14 05:37:27,721 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:37:27,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739688439] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:37:27,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 4 imperfect interpolant sequences. [2024-11-14 05:37:27,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 18, 15] total 52 [2024-11-14 05:37:27,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179300595] [2024-11-14 05:37:27,722 INFO L85 oduleStraightlineAll]: Using 4 imperfect interpolants to construct interpolant automaton [2024-11-14 05:37:27,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-14 05:37:27,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:37:27,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-14 05:37:27,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=2094, Unknown=10, NotChecked=98, Total=2652 [2024-11-14 05:37:27,725 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 52 states, 52 states have (on average 1.5) internal successors, (78), 52 states have internal predecessors, (78), 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-14 05:38:42,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:38:44,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:38:47,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:38:48,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:38:50,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:38:52,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:38:54,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:38:56,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:38:57,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:38:59,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:39:01,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:39:04,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:39:15,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:39:16,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:39:27,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:39:38,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:39:39,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:39:41,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:39:45,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:39:51,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:39:54,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:39:56,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:39:58,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:40:02,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:40:14,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:40:26,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:40:33,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:40:33,185 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2024-11-14 05:40:33,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-11-14 05:40:33,186 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.5) internal successors, (78), 52 states have internal predecessors, (78), 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 23 [2024-11-14 05:40:33,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:40:33,189 INFO L225 Difference]: With dead ends: 105 [2024-11-14 05:40:33,189 INFO L226 Difference]: Without dead ends: 67 [2024-11-14 05:40:33,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2295 ImplicationChecksByTransitivity, 190.7s TimeCoverageRelationStatistics Valid=1275, Invalid=5849, Unknown=20, NotChecked=166, Total=7310 [2024-11-14 05:40:33,194 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 168 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 101 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 67.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 68.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:40:33,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 54 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 539 Invalid, 19 Unknown, 90 Unchecked, 68.5s Time] [2024-11-14 05:40:33,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-14 05:40:33,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 46. [2024-11-14 05:40:33,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 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-14 05:40:33,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-11-14 05:40:33,217 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 23 [2024-11-14 05:40:33,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:40:33,217 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-11-14 05:40:33,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.5) internal successors, (78), 52 states have internal predecessors, (78), 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-14 05:40:33,218 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-11-14 05:40:33,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 05:40:33,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:40:33,219 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:40:33,224 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-14 05:40:33,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-14 05:40:33,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:40:33,620 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:40:33,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:40:33,620 INFO L85 PathProgramCache]: Analyzing trace with hash -36187655, now seen corresponding path program 4 times [2024-11-14 05:40:33,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:40:33,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729052617] [2024-11-14 05:40:33,621 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:40:33,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:40:33,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:40:33,623 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:40:33,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b78f4d7f-bf13-4c69-84b5-3fb8f20ca129/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-14 05:40:33,837 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:40:33,837 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:40:33,851 WARN L253 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-14 05:40:33,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:40:33,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-14 05:40:34,148 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 13 treesize of output 9 [2024-11-14 05:40:34,358 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 22 [2024-11-14 05:40:34,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:40:34,539 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 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-14 05:40:35,359 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:40:35,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:40:35,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 55 [2024-11-14 05:40:36,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:40:36,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 94 treesize of output 73 [2024-11-14 05:40:37,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:40:37,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 108 treesize of output 87 [2024-11-14 05:40:38,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:40:38,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 115 [2024-11-14 05:40:38,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:40:38,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 190 treesize of output 142 [2024-11-14 05:40:39,150 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:40:39,150 INFO L311 TraceCheckSpWp]: Computing backward predicates...