./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-36.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-36.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 78f51271513a16e7eca7d465f5387c94d8fad5b43cbf0af1b75f69199640eaee --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 07:18:09,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:18:10,013 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 07:18:10,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:18:10,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:18:10,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:18:10,075 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:18:10,076 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:18:10,077 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:18:10,078 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:18:10,079 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 07:18:10,080 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 07:18:10,080 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 07:18:10,081 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 07:18:10,081 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 07:18:10,084 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 07:18:10,085 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 07:18:10,085 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 07:18:10,085 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 07:18:10,086 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 07:18:10,086 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 07:18:10,087 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 07:18:10,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:18:10,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:18:10,093 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:18:10,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:18:10,094 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:18:10,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:18:10,095 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:18:10,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:18:10,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:18:10,096 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:18:10,096 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:18:10,096 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:18:10,100 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:18:10,100 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:18:10,101 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:18:10,101 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:18:10,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:18:10,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:18:10,102 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:18:10,104 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:18:10,104 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 07:18:10,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:18:10,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:18:10,106 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 07:18:10,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:18:10,106 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 78f51271513a16e7eca7d465f5387c94d8fad5b43cbf0af1b75f69199640eaee [2024-11-09 07:18:10,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:18:10,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:18:10,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:18:10,464 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:18:10,465 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:18:10,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-36.i Unable to find full path for "g++" [2024-11-09 07:18:13,092 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:18:13,421 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:18:13,422 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-36.i [2024-11-09 07:18:13,433 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/data/885fc0435/8ac3371b31494aa1a2c51736cb57388e/FLAG7dfcbb764 [2024-11-09 07:18:13,451 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/data/885fc0435/8ac3371b31494aa1a2c51736cb57388e [2024-11-09 07:18:13,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:18:13,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:18:13,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:18:13,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:18:13,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:18:13,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:18:13" (1/1) ... [2024-11-09 07:18:13,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36880d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:13, skipping insertion in model container [2024-11-09 07:18:13,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:18:13" (1/1) ... [2024-11-09 07:18:13,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:18:13,750 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_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-36.i[916,929] [2024-11-09 07:18:13,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:18:13,843 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:18:13,861 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_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-36.i[916,929] [2024-11-09 07:18:13,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:18:13,943 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:18:13,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:13 WrapperNode [2024-11-09 07:18:13,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:18:13,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:18:13,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:18:13,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:18:13,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:13" (1/1) ... [2024-11-09 07:18:13,984 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:13" (1/1) ... [2024-11-09 07:18:14,051 INFO L138 Inliner]: procedures = 29, calls = 167, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 583 [2024-11-09 07:18:14,052 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:18:14,053 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:18:14,053 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:18:14,053 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:18:14,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:13" (1/1) ... [2024-11-09 07:18:14,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:13" (1/1) ... [2024-11-09 07:18:14,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:13" (1/1) ... [2024-11-09 07:18:14,084 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:13" (1/1) ... [2024-11-09 07:18:14,106 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:13" (1/1) ... [2024-11-09 07:18:14,112 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:13" (1/1) ... [2024-11-09 07:18:14,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:13" (1/1) ... [2024-11-09 07:18:14,119 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:13" (1/1) ... [2024-11-09 07:18:14,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:18:14,131 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:18:14,131 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:18:14,131 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:18:14,132 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:13" (1/1) ... [2024-11-09 07:18:14,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:18:14,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:18:14,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 07:18:14,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 07:18:14,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:18:14,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 07:18:14,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 07:18:14,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 07:18:14,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 07:18:14,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2024-11-09 07:18:14,227 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 07:18:14,227 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 07:18:14,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 07:18:14,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:18:14,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:18:14,457 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:18:14,459 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:18:15,424 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2024-11-09 07:18:15,424 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:18:16,262 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:18:16,263 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 07:18:16,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:18:16 BoogieIcfgContainer [2024-11-09 07:18:16,265 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:18:16,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:18:16,270 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:18:16,274 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:18:16,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:18:13" (1/3) ... [2024-11-09 07:18:16,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d56b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:18:16, skipping insertion in model container [2024-11-09 07:18:16,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:13" (2/3) ... [2024-11-09 07:18:16,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d56b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:18:16, skipping insertion in model container [2024-11-09 07:18:16,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:18:16" (3/3) ... [2024-11-09 07:18:16,281 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-36.i [2024-11-09 07:18:16,366 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:18:16,370 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 07:18:16,563 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:18:16,572 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;@7fcf9f98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:18:16,573 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 07:18:16,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 07:18:16,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 07:18:16,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:16,596 INFO L215 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:16,597 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:18:16,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:16,604 INFO L85 PathProgramCache]: Analyzing trace with hash -137243914, now seen corresponding path program 1 times [2024-11-09 07:18:16,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:18:16,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471626250] [2024-11-09 07:18:16,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:16,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:18:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:18:20,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 07:18:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:18:21,918 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 07:18:21,920 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 07:18:21,922 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 07:18:21,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:18:21,930 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-09 07:18:22,090 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:18:22,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:18:22 BoogieIcfgContainer [2024-11-09 07:18:22,096 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:18:22,097 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:18:22,097 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:18:22,097 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:18:22,099 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:18:16" (3/4) ... [2024-11-09 07:18:22,102 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 07:18:22,103 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:18:22,105 INFO L158 Benchmark]: Toolchain (without parser) took 8648.38ms. Allocated memory was 165.7MB in the beginning and 377.5MB in the end (delta: 211.8MB). Free memory was 131.8MB in the beginning and 240.9MB in the end (delta: -109.1MB). Peak memory consumption was 105.7MB. Max. memory is 16.1GB. [2024-11-09 07:18:22,106 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 113.2MB. Free memory is still 63.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:18:22,106 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.22ms. Allocated memory is still 165.7MB. Free memory was 131.6MB in the beginning and 115.1MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 07:18:22,108 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.58ms. Allocated memory is still 165.7MB. Free memory was 115.1MB in the beginning and 111.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:18:22,108 INFO L158 Benchmark]: Boogie Preprocessor took 77.07ms. Allocated memory is still 165.7MB. Free memory was 111.6MB in the beginning and 108.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:18:22,109 INFO L158 Benchmark]: RCFGBuilder took 2134.29ms. Allocated memory was 165.7MB in the beginning and 224.4MB in the end (delta: 58.7MB). Free memory was 108.6MB in the beginning and 109.3MB in the end (delta: -703.2kB). Peak memory consumption was 67.4MB. Max. memory is 16.1GB. [2024-11-09 07:18:22,111 INFO L158 Benchmark]: TraceAbstraction took 5827.62ms. Allocated memory was 224.4MB in the beginning and 377.5MB in the end (delta: 153.1MB). Free memory was 108.3MB in the beginning and 240.9MB in the end (delta: -132.6MB). Peak memory consumption was 148.6MB. Max. memory is 16.1GB. [2024-11-09 07:18:22,112 INFO L158 Benchmark]: Witness Printer took 6.95ms. Allocated memory is still 377.5MB. Free memory is still 240.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:18:22,116 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.34ms. Allocated memory is still 113.2MB. Free memory is still 63.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 486.22ms. Allocated memory is still 165.7MB. Free memory was 131.6MB in the beginning and 115.1MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.58ms. Allocated memory is still 165.7MB. Free memory was 115.1MB in the beginning and 111.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.07ms. Allocated memory is still 165.7MB. Free memory was 111.6MB in the beginning and 108.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2134.29ms. Allocated memory was 165.7MB in the beginning and 224.4MB in the end (delta: 58.7MB). Free memory was 108.6MB in the beginning and 109.3MB in the end (delta: -703.2kB). Peak memory consumption was 67.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5827.62ms. Allocated memory was 224.4MB in the beginning and 377.5MB in the end (delta: 153.1MB). Free memory was 108.3MB in the beginning and 240.9MB in the end (delta: -132.6MB). Peak memory consumption was 148.6MB. Max. memory is 16.1GB. * Witness Printer took 6.95ms. Allocated memory is still 377.5MB. Free memory is still 240.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of shiftRight at line 50, overapproximation of someUnaryDOUBLEoperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1; [L23] unsigned long int* var_1_1_Pointer = &(var_1_1); [L24] float var_1_3 = 9999999999.875; [L25] float* var_1_3_Pointer = &(var_1_3); [L26] unsigned char var_1_4 = 0; [L27] unsigned char* var_1_4_Pointer = &(var_1_4); [L28] float var_1_5 = 4.25; [L29] float* var_1_5_Pointer = &(var_1_5); [L30] unsigned char var_1_7 = 1; [L31] unsigned char* var_1_7_Pointer = &(var_1_7); [L32] unsigned char var_1_9 = 1; [L33] unsigned char* var_1_9_Pointer = &(var_1_9); [L34] double var_1_10 = 64.2; [L35] double* var_1_10_Pointer = &(var_1_10); [L36] double var_1_11 = 9.5; [L37] double* var_1_11_Pointer = &(var_1_11); [L38] double var_1_12 = 199.5; [L39] double* var_1_12_Pointer = &(var_1_12); [L40] double var_1_13 = 3.5; [L41] double* var_1_13_Pointer = &(var_1_13); [L42] unsigned char var_1_14 = 1; [L43] unsigned char* var_1_14_Pointer = &(var_1_14); [L44] unsigned char var_1_16 = 2; [L45] unsigned char* var_1_16_Pointer = &(var_1_16); [L46] unsigned char last_1_var_1_14 = 1; [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] CALL updateLastVariables() [L104] EXPR \read(var_1_14) [L104] last_1_var_1_14 = var_1_14 [L114] RET updateLastVariables() [L115] CALL updateVariables() [L83] var_1_3 = __VERIFIER_nondet_float() [L84] EXPR \read(var_1_3) [L84] EXPR var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F [L84] EXPR (var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) [L84] EXPR \read(var_1_3) [L84] EXPR var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F [L84] EXPR \read(var_1_3) [L84] EXPR var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F [L84] EXPR (var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L84] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) [L84] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L85] var_1_4 = __VERIFIER_nondet_uchar() [L86] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) [L86] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L87] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L87] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) [L87] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] var_1_5 = __VERIFIER_nondet_float() [L89] EXPR \read(var_1_5) [L89] EXPR var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F [L89] EXPR (var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F ) [L89] EXPR \read(var_1_5) [L89] EXPR var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F [L89] EXPR \read(var_1_5) [L89] EXPR var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F [L89] EXPR (var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) [L89] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] var_1_9 = __VERIFIER_nondet_uchar() [L91] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) [L91] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) [L92] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] var_1_11 = __VERIFIER_nondet_double() [L94] EXPR \read(var_1_11) [L94] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F [L94] EXPR \read(var_1_11) [L94] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F [L94] EXPR (var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) [L94] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L95] var_1_12 = __VERIFIER_nondet_double() [L96] EXPR \read(var_1_12) [L96] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F [L96] EXPR \read(var_1_12) [L96] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F [L96] EXPR (var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) [L96] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L97] var_1_13 = __VERIFIER_nondet_double() [L98] EXPR \read(var_1_13) [L98] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F [L98] EXPR (var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) [L98] EXPR \read(var_1_13) [L98] EXPR var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F [L98] EXPR \read(var_1_13) [L98] EXPR var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F [L98] EXPR (var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L98] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) [L98] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] var_1_16 = __VERIFIER_nondet_uchar() [L100] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L100] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) [L100] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L101] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L101] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) [L101] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L115] RET updateVariables() [L116] CALL step() [L50] EXPR last_1_var_1_14 >> last_1_var_1_14 [L50] COND FALSE !((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) [L53] EXPR \read(*var_1_13_Pointer) [L53] EXPR \read(*var_1_12_Pointer) [L53] COND TRUE (*(var_1_13_Pointer)) == (- (*(var_1_12_Pointer))) [L54] EXPR \read(*var_1_7_Pointer) [L54] (*(var_1_7_Pointer)) && (*(var_1_7_Pointer)) [L54] EXPR \read(*var_1_7_Pointer) [L54] (*(var_1_7_Pointer)) && (*(var_1_7_Pointer)) [L54] COND TRUE (*(var_1_7_Pointer)) && (*(var_1_7_Pointer)) [L55] EXPR \read(*var_1_16_Pointer) [L55] (*(var_1_14_Pointer)) = (*(var_1_16_Pointer)) [L62] EXPR \read(*var_1_5_Pointer) [L62] EXPR \read(*var_1_3_Pointer) [L62] COND FALSE !((*(var_1_5_Pointer)) > (*(var_1_3_Pointer))) [L65] EXPR \read(*var_1_11_Pointer) [L65] EXPR \read(*var_1_12_Pointer) [L65] EXPR \read(*var_1_13_Pointer) [L65] EXPR (((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))) [L65] EXPR \read(*var_1_13_Pointer) [L65] EXPR (((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))) [L65] EXPR (((*(var_1_11_Pointer))) > ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) ? ((*(var_1_11_Pointer))) : ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))) [L65] EXPR \read(*var_1_11_Pointer) [L65] EXPR (((*(var_1_11_Pointer))) > ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) ? ((*(var_1_11_Pointer))) : ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))) [L65] (*(var_1_10_Pointer)) = (((((*(var_1_11_Pointer))) > ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) ? ((*(var_1_11_Pointer))) : ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) [L67] EXPR \read(*var_1_10_Pointer) [L67] EXPR \read(*var_1_10_Pointer) [L67] unsigned char stepLocal_0 = (*(var_1_10_Pointer)) > (*(var_1_10_Pointer)); [L68] stepLocal_0 && (*(var_1_7_Pointer)) [L68] EXPR \read(*var_1_7_Pointer) [L68] stepLocal_0 && (*(var_1_7_Pointer)) [L68] COND TRUE stepLocal_0 && (*(var_1_7_Pointer)) [L69] EXPR \read(*var_1_10_Pointer) [L69] EXPR \read(*var_1_10_Pointer) [L69] EXPR (((*(var_1_10_Pointer))) > ((- (*(var_1_10_Pointer))))) ? ((*(var_1_10_Pointer))) : ((- (*(var_1_10_Pointer)))) [L69] EXPR \read(*var_1_10_Pointer) [L69] EXPR (((*(var_1_10_Pointer))) > ((- (*(var_1_10_Pointer))))) ? ((*(var_1_10_Pointer))) : ((- (*(var_1_10_Pointer)))) [L69] EXPR \read(*var_1_10_Pointer) [L69] COND TRUE (((((*(var_1_10_Pointer))) > ((- (*(var_1_10_Pointer))))) ? ((*(var_1_10_Pointer))) : ((- (*(var_1_10_Pointer)))))) != (*(var_1_10_Pointer)) [L70] EXPR \read(*var_1_7_Pointer) [L70] COND TRUE (*(var_1_7_Pointer)) [L71] (*(var_1_1_Pointer)) = 10u [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR \read(*var_1_10_Pointer) [L107] EXPR \read(*var_1_10_Pointer) [L107] EXPR ((*(var_1_10_Pointer)) > (*(var_1_10_Pointer))) && (*(var_1_7_Pointer)) [L107] EXPR (((*(var_1_10_Pointer)) > (*(var_1_10_Pointer))) && (*(var_1_7_Pointer))) ? (((((((*(var_1_10_Pointer))) > ((- (*(var_1_10_Pointer))))) ? ((*(var_1_10_Pointer))) : ((- (*(var_1_10_Pointer)))))) != (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer)))) [L107] EXPR \read(*var_1_1_Pointer) [L107] EXPR \read(*var_1_14_Pointer) [L107] EXPR (((*(var_1_10_Pointer)) > (*(var_1_10_Pointer))) && (*(var_1_7_Pointer))) ? (((((((*(var_1_10_Pointer))) > ((- (*(var_1_10_Pointer))))) ? ((*(var_1_10_Pointer))) : ((- (*(var_1_10_Pointer)))))) != (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer)))) [L107] EXPR ((((*(var_1_10_Pointer)) > (*(var_1_10_Pointer))) && (*(var_1_7_Pointer))) ? (((((((*(var_1_10_Pointer))) > ((- (*(var_1_10_Pointer))))) ? ((*(var_1_10_Pointer))) : ((- (*(var_1_10_Pointer)))))) != (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_9_Pointer))))) : 1) [L107] EXPR (((((*(var_1_10_Pointer)) > (*(var_1_10_Pointer))) && (*(var_1_7_Pointer))) ? (((((((*(var_1_10_Pointer))) > ((- (*(var_1_10_Pointer))))) ? ((*(var_1_10_Pointer))) : ((- (*(var_1_10_Pointer)))))) != (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_9_Pointer))))) : 1)) && (((*(var_1_5_Pointer)) > (*(var_1_3_Pointer))) ? ((*(var_1_10_Pointer)) == ((double) 4.6)) : ((*(var_1_10_Pointer)) == ((double) (((((*(var_1_11_Pointer))) > ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) ? ((*(var_1_11_Pointer))) : ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))))))) [L107] EXPR ((((((*(var_1_10_Pointer)) > (*(var_1_10_Pointer))) && (*(var_1_7_Pointer))) ? (((((((*(var_1_10_Pointer))) > ((- (*(var_1_10_Pointer))))) ? ((*(var_1_10_Pointer))) : ((- (*(var_1_10_Pointer)))))) != (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_9_Pointer))))) : 1)) && (((*(var_1_5_Pointer)) > (*(var_1_3_Pointer))) ? ((*(var_1_10_Pointer)) == ((double) 4.6)) : ((*(var_1_10_Pointer)) == ((double) (((((*(var_1_11_Pointer))) > ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) ? ((*(var_1_11_Pointer))) : ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))))))) && (((*(var_1_13_Pointer)) == (- (*(var_1_12_Pointer)))) ? (((*(var_1_7_Pointer)) && (*(var_1_7_Pointer))) ? ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_16_Pointer))))) : ((*(var_1_14_Pointer)) == ((unsigned char) 0))) [L107-L108] return ((((((*(var_1_10_Pointer)) > (*(var_1_10_Pointer))) && (*(var_1_7_Pointer))) ? (((((((*(var_1_10_Pointer))) > ((- (*(var_1_10_Pointer))))) ? ((*(var_1_10_Pointer))) : ((- (*(var_1_10_Pointer)))))) != (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_9_Pointer))))) : 1)) && (((*(var_1_5_Pointer)) > (*(var_1_3_Pointer))) ? ((*(var_1_10_Pointer)) == ((double) 4.6)) : ((*(var_1_10_Pointer)) == ((double) (((((*(var_1_11_Pointer))) > ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) ? ((*(var_1_11_Pointer))) : ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))))))) && (((*(var_1_13_Pointer)) == (- (*(var_1_12_Pointer)))) ? (((*(var_1_7_Pointer)) && (*(var_1_7_Pointer))) ? ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_16_Pointer))))) : ((*(var_1_14_Pointer)) == ((unsigned char) 0))) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 1, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 07:18:22,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-36.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 78f51271513a16e7eca7d465f5387c94d8fad5b43cbf0af1b75f69199640eaee --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 07:18:25,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:18:25,484 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 07:18:25,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:18:25,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:18:25,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:18:25,540 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:18:25,540 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:18:25,541 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:18:25,542 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:18:25,543 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 07:18:25,543 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 07:18:25,544 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 07:18:25,547 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 07:18:25,548 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 07:18:25,548 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 07:18:25,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:18:25,550 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:18:25,550 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:18:25,551 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:18:25,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:18:25,555 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:18:25,555 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:18:25,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:18:25,556 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:18:25,556 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 07:18:25,557 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:18:25,557 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 07:18:25,558 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:18:25,558 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:18:25,558 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:18:25,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:18:25,562 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:18:25,562 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:18:25,563 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:18:25,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:18:25,564 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:18:25,564 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:18:25,565 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:18:25,565 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 07:18:25,565 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 07:18:25,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:18:25,566 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 07:18:25,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 78f51271513a16e7eca7d465f5387c94d8fad5b43cbf0af1b75f69199640eaee [2024-11-09 07:18:26,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:18:26,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:18:26,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:18:26,086 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:18:26,086 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:18:26,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-36.i Unable to find full path for "g++" [2024-11-09 07:18:28,809 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:18:29,123 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:18:29,124 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-36.i [2024-11-09 07:18:29,138 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/data/f1e1ad70e/84bc1d82d8dd4e748b7a6fb2eec942c9/FLAG294af16a5 [2024-11-09 07:18:29,163 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/data/f1e1ad70e/84bc1d82d8dd4e748b7a6fb2eec942c9 [2024-11-09 07:18:29,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:18:29,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:18:29,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:18:29,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:18:29,177 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:18:29,178 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:18:29" (1/1) ... [2024-11-09 07:18:29,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8524d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:29, skipping insertion in model container [2024-11-09 07:18:29,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:18:29" (1/1) ... [2024-11-09 07:18:29,214 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:18:29,448 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_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-36.i[916,929] [2024-11-09 07:18:29,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:18:29,557 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:18:29,574 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_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-36.i[916,929] [2024-11-09 07:18:29,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:18:29,646 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:18:29,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:29 WrapperNode [2024-11-09 07:18:29,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:18:29,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:18:29,649 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:18:29,649 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:18:29,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:29" (1/1) ... [2024-11-09 07:18:29,691 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:29" (1/1) ... [2024-11-09 07:18:29,793 INFO L138 Inliner]: procedures = 36, calls = 167, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 569 [2024-11-09 07:18:29,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:18:29,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:18:29,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:18:29,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:18:29,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:29" (1/1) ... [2024-11-09 07:18:29,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:29" (1/1) ... [2024-11-09 07:18:29,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:29" (1/1) ... [2024-11-09 07:18:29,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:29" (1/1) ... [2024-11-09 07:18:29,911 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:29" (1/1) ... [2024-11-09 07:18:29,924 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:29" (1/1) ... [2024-11-09 07:18:29,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:29" (1/1) ... [2024-11-09 07:18:29,940 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:29" (1/1) ... [2024-11-09 07:18:29,954 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:18:29,955 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:18:29,956 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:18:29,956 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:18:29,957 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:29" (1/1) ... [2024-11-09 07:18:29,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:18:29,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:18:29,999 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 07:18:30,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 07:18:30,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:18:30,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2024-11-09 07:18:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2024-11-09 07:18:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-09 07:18:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 07:18:30,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-11-09 07:18:30,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2024-11-09 07:18:30,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2024-11-09 07:18:30,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-09 07:18:30,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2024-11-09 07:18:30,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2024-11-09 07:18:30,053 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 07:18:30,054 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 07:18:30,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:18:30,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:18:30,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2024-11-09 07:18:30,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-09 07:18:30,318 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:18:30,325 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:18:31,680 INFO L? ?]: Removed 149 outVars from TransFormulas that were not future-live. [2024-11-09 07:18:31,681 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:18:31,701 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:18:31,701 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 07:18:31,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:18:31 BoogieIcfgContainer [2024-11-09 07:18:31,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:18:31,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:18:31,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:18:31,712 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:18:31,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:18:29" (1/3) ... [2024-11-09 07:18:31,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6657b692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:18:31, skipping insertion in model container [2024-11-09 07:18:31,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:29" (2/3) ... [2024-11-09 07:18:31,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6657b692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:18:31, skipping insertion in model container [2024-11-09 07:18:31,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:18:31" (3/3) ... [2024-11-09 07:18:31,718 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-36.i [2024-11-09 07:18:31,739 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:18:31,739 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 07:18:31,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:18:31,837 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;@c686d29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:18:31,838 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 07:18:31,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 105 states have (on average 1.4857142857142858) internal successors, (156), 106 states have internal predecessors, (156), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 07:18:31,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 07:18:31,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:31,869 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:31,870 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:18:31,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:31,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1010334444, now seen corresponding path program 1 times [2024-11-09 07:18:31,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:18:31,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405379394] [2024-11-09 07:18:31,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:31,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:18:31,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:18:31,918 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:18:31,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 07:18:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:32,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 07:18:32,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:32,694 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-09 07:18:32,695 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:18:32,698 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:18:32,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405379394] [2024-11-09 07:18:32,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405379394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:32,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:32,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:18:32,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112101172] [2024-11-09 07:18:32,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:32,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 07:18:32,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:18:32,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 07:18:32,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:18:32,746 INFO L87 Difference]: Start difference. First operand has 119 states, 105 states have (on average 1.4857142857142858) internal successors, (156), 106 states have internal predecessors, (156), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 07:18:32,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:32,793 INFO L93 Difference]: Finished difference Result 227 states and 355 transitions. [2024-11-09 07:18:32,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 07:18:32,796 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2024-11-09 07:18:32,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:32,808 INFO L225 Difference]: With dead ends: 227 [2024-11-09 07:18:32,809 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 07:18:32,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:18:32,819 INFO L432 NwaCegarLoop]: 163 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, 163 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:32,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:18:32,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 07:18:32,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-09 07:18:32,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.4387755102040816) internal successors, (141), 98 states have internal predecessors, (141), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 07:18:32,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2024-11-09 07:18:32,908 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 108 [2024-11-09 07:18:32,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:32,908 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2024-11-09 07:18:32,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 07:18:32,909 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2024-11-09 07:18:32,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 07:18:32,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:32,917 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:32,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 07:18:33,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:18:33,123 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:18:33,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:33,126 INFO L85 PathProgramCache]: Analyzing trace with hash 54683214, now seen corresponding path program 1 times [2024-11-09 07:18:33,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:18:33,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684099390] [2024-11-09 07:18:33,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:33,128 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:18:33,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:18:33,133 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:18:33,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 07:18:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:33,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:18:33,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:33,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:18:33,899 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 184 treesize of output 64 [2024-11-09 07:18:33,940 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 07:18:33,940 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:18:33,941 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:18:33,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684099390] [2024-11-09 07:18:33,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684099390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:33,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:33,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:18:33,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844509116] [2024-11-09 07:18:33,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:33,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:18:33,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:18:33,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:18:33,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:18:33,954 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 07:18:34,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:34,017 INFO L93 Difference]: Finished difference Result 215 states and 316 transitions. [2024-11-09 07:18:34,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:18:34,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-09 07:18:34,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:34,025 INFO L225 Difference]: With dead ends: 215 [2024-11-09 07:18:34,025 INFO L226 Difference]: Without dead ends: 107 [2024-11-09 07:18:34,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 106 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-09 07:18:34,032 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:34,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 301 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:18:34,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-09 07:18:34,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-09 07:18:34,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 07:18:34,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 154 transitions. [2024-11-09 07:18:34,060 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 154 transitions. Word has length 108 [2024-11-09 07:18:34,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:34,062 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 154 transitions. [2024-11-09 07:18:34,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 07:18:34,063 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 154 transitions. [2024-11-09 07:18:34,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 07:18:34,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:34,068 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:34,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 07:18:34,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:18:34,270 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:18:34,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:34,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1225180464, now seen corresponding path program 1 times [2024-11-09 07:18:34,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:18:34,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1105424119] [2024-11-09 07:18:34,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:34,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:18:34,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:18:34,280 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:18:34,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 07:18:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:34,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:18:34,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:34,943 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 07:18:34,943 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:18:34,943 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:18:34,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1105424119] [2024-11-09 07:18:34,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1105424119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:34,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:34,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:18:34,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680677354] [2024-11-09 07:18:34,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:34,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:18:34,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:18:34,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:18:34,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:18:34,954 INFO L87 Difference]: Start difference. First operand 107 states and 154 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 07:18:35,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:35,011 INFO L93 Difference]: Finished difference Result 205 states and 296 transitions. [2024-11-09 07:18:35,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:18:35,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-09 07:18:35,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:35,017 INFO L225 Difference]: With dead ends: 205 [2024-11-09 07:18:35,018 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 07:18:35,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 106 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-09 07:18:35,024 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:35,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 279 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:18:35,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 07:18:35,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-09 07:18:35,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 88 states have (on average 1.375) internal successors, (121), 88 states have internal predecessors, (121), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 07:18:35,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2024-11-09 07:18:35,045 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 108 [2024-11-09 07:18:35,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:35,050 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2024-11-09 07:18:35,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 07:18:35,051 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2024-11-09 07:18:35,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 07:18:35,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:35,058 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:35,068 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 07:18:35,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:18:35,260 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:18:35,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:35,261 INFO L85 PathProgramCache]: Analyzing trace with hash -967015026, now seen corresponding path program 1 times [2024-11-09 07:18:35,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:18:35,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212663911] [2024-11-09 07:18:35,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:35,263 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:18:35,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:18:35,267 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:18:35,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 07:18:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:35,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 07:18:35,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:37,380 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 12 treesize of output 8 [2024-11-09 07:18:37,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-09 07:18:37,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-09 07:18:37,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2024-11-09 07:18:37,726 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 07:18:37,727 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:18:37,727 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:18:37,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212663911] [2024-11-09 07:18:37,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212663911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:37,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:37,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:18:37,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425463548] [2024-11-09 07:18:37,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:37,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:18:37,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:18:37,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:18:37,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:18:37,732 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 07:18:39,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:39,170 INFO L93 Difference]: Finished difference Result 240 states and 338 transitions. [2024-11-09 07:18:39,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:18:39,171 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-09 07:18:39,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:39,173 INFO L225 Difference]: With dead ends: 240 [2024-11-09 07:18:39,173 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 07:18:39,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:18:39,180 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 265 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:39,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 380 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 07:18:39,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 07:18:39,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 116. [2024-11-09 07:18:39,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.3592233009708738) internal successors, (140), 103 states have internal predecessors, (140), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 07:18:39,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2024-11-09 07:18:39,216 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 162 transitions. Word has length 108 [2024-11-09 07:18:39,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:39,216 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 162 transitions. [2024-11-09 07:18:39,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 07:18:39,217 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2024-11-09 07:18:39,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 07:18:39,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:39,226 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:39,244 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 07:18:39,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:18:39,427 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:18:39,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:39,427 INFO L85 PathProgramCache]: Analyzing trace with hash 825250592, now seen corresponding path program 1 times [2024-11-09 07:18:39,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:18:39,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927267335] [2024-11-09 07:18:39,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:39,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:18:39,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:18:39,433 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:18:39,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 07:18:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:39,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:18:39,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:39,901 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 07:18:39,901 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:18:39,901 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:18:39,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927267335] [2024-11-09 07:18:39,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927267335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:39,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:39,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:18:39,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250756802] [2024-11-09 07:18:39,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:39,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:18:39,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:18:39,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:18:39,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:18:39,908 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 07:18:39,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:39,978 INFO L93 Difference]: Finished difference Result 231 states and 324 transitions. [2024-11-09 07:18:39,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:18:39,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-09 07:18:39,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:39,982 INFO L225 Difference]: With dead ends: 231 [2024-11-09 07:18:39,982 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 07:18:39,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:18:39,984 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:39,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 544 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:18:39,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 07:18:39,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-09 07:18:39,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 105 states have (on average 1.3523809523809525) internal successors, (142), 105 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 07:18:39,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 164 transitions. [2024-11-09 07:18:39,999 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 164 transitions. Word has length 110 [2024-11-09 07:18:39,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:40,000 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 164 transitions. [2024-11-09 07:18:40,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 07:18:40,000 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2024-11-09 07:18:40,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 07:18:40,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:40,003 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:40,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-09 07:18:40,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:18:40,207 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:18:40,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:40,208 INFO L85 PathProgramCache]: Analyzing trace with hash 4763014, now seen corresponding path program 1 times [2024-11-09 07:18:40,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:18:40,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597152741] [2024-11-09 07:18:40,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:40,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:18:40,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:18:40,213 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:18:40,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 07:18:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:40,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:18:40,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:41,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:18:41,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2024-11-09 07:18:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 07:18:41,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:18:41,676 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:18:41,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597152741] [2024-11-09 07:18:41,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597152741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:41,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:41,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:18:41,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230801703] [2024-11-09 07:18:41,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:41,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:18:41,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:18:41,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:18:41,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:18:41,680 INFO L87 Difference]: Start difference. First operand 118 states and 164 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 07:18:43,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:18:43,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:43,758 INFO L93 Difference]: Finished difference Result 231 states and 322 transitions. [2024-11-09 07:18:43,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:18:43,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-09 07:18:43,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:43,764 INFO L225 Difference]: With dead ends: 231 [2024-11-09 07:18:43,764 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 07:18:43,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:18:43,768 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 75 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:43,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 376 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 07:18:43,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 07:18:43,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2024-11-09 07:18:43,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 07:18:43,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 141 transitions. [2024-11-09 07:18:43,791 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 141 transitions. Word has length 110 [2024-11-09 07:18:43,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:43,796 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 141 transitions. [2024-11-09 07:18:43,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 07:18:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2024-11-09 07:18:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 07:18:43,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:43,798 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:43,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 07:18:43,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:18:43,999 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:18:43,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:44,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1369732795, now seen corresponding path program 1 times [2024-11-09 07:18:44,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:18:44,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257499865] [2024-11-09 07:18:44,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:44,001 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:18:44,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:18:44,003 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:18:44,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 07:18:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:44,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 07:18:44,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:45,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:18:45,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-09 07:18:45,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-09 07:18:46,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:18:46,367 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 123 treesize of output 53 [2024-11-09 07:18:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 07:18:46,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:18:46,428 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:18:46,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257499865] [2024-11-09 07:18:46,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257499865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:46,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:46,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:18:46,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888529117] [2024-11-09 07:18:46,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:46,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:18:46,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:18:46,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:18:46,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:18:46,432 INFO L87 Difference]: Start difference. First operand 101 states and 141 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 07:18:47,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:47,945 INFO L93 Difference]: Finished difference Result 236 states and 325 transitions. [2024-11-09 07:18:47,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:18:47,946 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-09 07:18:47,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:47,948 INFO L225 Difference]: With dead ends: 236 [2024-11-09 07:18:47,949 INFO L226 Difference]: Without dead ends: 138 [2024-11-09 07:18:47,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:18:47,950 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 193 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:47,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 438 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 07:18:47,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-09 07:18:47,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 117. [2024-11-09 07:18:47,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 104 states have internal predecessors, (136), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 07:18:47,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 158 transitions. [2024-11-09 07:18:47,976 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 158 transitions. Word has length 112 [2024-11-09 07:18:47,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:47,977 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 158 transitions. [2024-11-09 07:18:47,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 07:18:47,978 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 158 transitions. [2024-11-09 07:18:47,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 07:18:47,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:47,980 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:47,993 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 07:18:48,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:18:48,182 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:18:48,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:48,183 INFO L85 PathProgramCache]: Analyzing trace with hash -469446681, now seen corresponding path program 1 times [2024-11-09 07:18:48,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:18:48,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438876361] [2024-11-09 07:18:48,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:48,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:18:48,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:18:48,189 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:18:48,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 07:18:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:48,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 07:18:48,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:49,783 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 12 treesize of output 8 [2024-11-09 07:18:49,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-09 07:18:49,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-09 07:18:50,008 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-09 07:18:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 07:18:50,081 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:18:50,081 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:18:50,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438876361] [2024-11-09 07:18:50,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438876361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:50,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:50,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:18:50,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765625756] [2024-11-09 07:18:50,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:50,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:18:50,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:18:50,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:18:50,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:18:50,084 INFO L87 Difference]: Start difference. First operand 117 states and 158 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 07:18:51,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:51,331 INFO L93 Difference]: Finished difference Result 180 states and 234 transitions. [2024-11-09 07:18:51,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:18:51,332 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 114 [2024-11-09 07:18:51,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:51,333 INFO L225 Difference]: With dead ends: 180 [2024-11-09 07:18:51,333 INFO L226 Difference]: Without dead ends: 178 [2024-11-09 07:18:51,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:18:51,335 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 273 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:51,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 576 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 07:18:51,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-09 07:18:51,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2024-11-09 07:18:51,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 153 states have (on average 1.2810457516339868) internal successors, (196), 153 states have internal predecessors, (196), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 07:18:51,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 218 transitions. [2024-11-09 07:18:51,366 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 218 transitions. Word has length 114 [2024-11-09 07:18:51,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:51,367 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 218 transitions. [2024-11-09 07:18:51,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 07:18:51,368 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 218 transitions. [2024-11-09 07:18:51,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 07:18:51,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:51,371 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:51,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-09 07:18:51,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:18:51,572 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:18:51,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:51,573 INFO L85 PathProgramCache]: Analyzing trace with hash -744695604, now seen corresponding path program 1 times [2024-11-09 07:18:51,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:18:51,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064934607] [2024-11-09 07:18:51,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:51,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:18:51,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:18:51,576 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:18:51,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 07:18:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:52,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-09 07:18:52,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:53,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:18:53,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:18:54,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:18:56,295 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 57 treesize of output 42 [2024-11-09 07:18:57,308 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 57 treesize of output 42 [2024-11-09 07:18:58,029 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 57 treesize of output 42 [2024-11-09 07:18:58,602 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 57 treesize of output 42 [2024-11-09 07:18:59,131 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 57 treesize of output 42 [2024-11-09 07:18:59,840 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 57 treesize of output 42 [2024-11-09 07:19:00,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 74 [2024-11-09 07:19:00,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 74 [2024-11-09 07:19:00,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 58 [2024-11-09 07:19:00,957 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 07:19:00,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:19:01,426 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_259 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_259))) (fp.gt (let ((.cse0 (select (select .cse1 c_~var_1_5_Pointer~0.base) c_~var_1_5_Pointer~0.offset))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select (select .cse1 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) is different from false [2024-11-09 07:19:02,381 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:19:02,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064934607] [2024-11-09 07:19:02,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064934607] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:19:02,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [116077486] [2024-11-09 07:19:02,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:19:02,383 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:19:02,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 07:19:02,388 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 07:19:02,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-09 07:19:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:19:06,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 07:19:06,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:19:07,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2024-11-09 07:19:07,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2024-11-09 07:19:08,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 34 [2024-11-09 07:19:08,327 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 07:19:08,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:19:08,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [116077486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:19:08,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:19:08,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 23 [2024-11-09 07:19:08,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662797003] [2024-11-09 07:19:08,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:19:08,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:19:08,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:19:08,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:19:08,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=614, Unknown=5, NotChecked=52, Total=812 [2024-11-09 07:19:08,330 INFO L87 Difference]: Start difference. First operand 166 states and 218 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 07:19:09,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:19:09,879 INFO L93 Difference]: Finished difference Result 347 states and 455 transitions. [2024-11-09 07:19:09,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:19:09,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 115 [2024-11-09 07:19:09,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:19:09,884 INFO L225 Difference]: With dead ends: 347 [2024-11-09 07:19:09,884 INFO L226 Difference]: Without dead ends: 184 [2024-11-09 07:19:09,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=161, Invalid=708, Unknown=5, NotChecked=56, Total=930 [2024-11-09 07:19:09,886 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 156 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:19:09,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 363 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 07:19:09,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-09 07:19:09,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 166. [2024-11-09 07:19:09,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 153 states have (on average 1.2679738562091503) internal successors, (194), 153 states have internal predecessors, (194), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 07:19:09,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 216 transitions. [2024-11-09 07:19:09,901 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 216 transitions. Word has length 115 [2024-11-09 07:19:09,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:19:09,901 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 216 transitions. [2024-11-09 07:19:09,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 07:19:09,902 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 216 transitions. [2024-11-09 07:19:09,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 07:19:09,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:19:09,904 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:19:09,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2024-11-09 07:19:10,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-09 07:19:10,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:19:10,306 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:19:10,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:19:10,306 INFO L85 PathProgramCache]: Analyzing trace with hash 251634023, now seen corresponding path program 1 times [2024-11-09 07:19:10,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:19:10,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893473546] [2024-11-09 07:19:10,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:19:10,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:19:10,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:19:10,309 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:19:10,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 07:19:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:19:10,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 07:19:10,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:19:12,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:19:13,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:19:14,920 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 57 treesize of output 42 [2024-11-09 07:19:15,947 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 57 treesize of output 42 [2024-11-09 07:19:16,615 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 57 treesize of output 42 [2024-11-09 07:19:17,223 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 57 treesize of output 42 [2024-11-09 07:19:17,744 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 57 treesize of output 42 [2024-11-09 07:19:18,468 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 57 treesize of output 42 [2024-11-09 07:19:19,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 75 [2024-11-09 07:19:19,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 75 [2024-11-09 07:19:19,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 59 [2024-11-09 07:19:19,879 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 07:19:19,879 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:19:20,901 WARN L851 $PredicateComparison]: unable to prove that (or (fp.gt (let ((.cse0 (select (select |c_#memory_int| c_~var_1_5_Pointer~0.base) c_~var_1_5_Pointer~0.offset))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse1 (select (select |c_#memory_int| c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (forall ((v_ArrVal_322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_323 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse3 (store (store |c_#memory_int| c_~var_1_10_Pointer~0.base v_ArrVal_322) c_~var_1_1_Pointer~0.base v_ArrVal_323))) (fp.gt (let ((.cse2 (select (select .cse3 c_~var_1_5_Pointer~0.base) c_~var_1_5_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (select (select .cse3 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))))))) is different from false [2024-11-09 07:19:21,396 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:19:21,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893473546] [2024-11-09 07:19:21,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893473546] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:19:21,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [461851089] [2024-11-09 07:19:21,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:19:21,397 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:19:21,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 07:19:21,398 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 07:19:21,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-11-09 07:19:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:19:25,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 07:19:25,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:19:27,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2024-11-09 07:19:27,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2024-11-09 07:19:28,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 35 [2024-11-09 07:19:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 07:19:28,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:19:28,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [461851089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:19:28,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:19:28,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 24 [2024-11-09 07:19:28,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198790470] [2024-11-09 07:19:28,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:19:28,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:19:28,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:19:28,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:19:28,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=707, Unknown=19, NotChecked=56, Total=930 [2024-11-09 07:19:28,279 INFO L87 Difference]: Start difference. First operand 166 states and 216 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 07:19:30,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:19:30,164 INFO L93 Difference]: Finished difference Result 347 states and 451 transitions. [2024-11-09 07:19:30,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:19:30,166 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 115 [2024-11-09 07:19:30,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:19:30,168 INFO L225 Difference]: With dead ends: 347 [2024-11-09 07:19:30,169 INFO L226 Difference]: Without dead ends: 184 [2024-11-09 07:19:30,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=160, Invalid=755, Unknown=19, NotChecked=58, Total=992 [2024-11-09 07:19:30,171 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 151 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:19:30,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 437 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 07:19:30,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-09 07:19:30,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 166. [2024-11-09 07:19:30,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 153 states have (on average 1.2549019607843137) internal successors, (192), 153 states have internal predecessors, (192), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 07:19:30,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 214 transitions. [2024-11-09 07:19:30,185 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 214 transitions. Word has length 115 [2024-11-09 07:19:30,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:19:30,186 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 214 transitions. [2024-11-09 07:19:30,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 07:19:30,186 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 214 transitions. [2024-11-09 07:19:30,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 07:19:30,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:19:30,188 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:19:30,205 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-09 07:19:30,404 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2024-11-09 07:19:30,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 07:19:30,589 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:19:30,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:19:30,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1325473247, now seen corresponding path program 1 times [2024-11-09 07:19:30,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:19:30,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789350805] [2024-11-09 07:19:30,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:19:30,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:19:30,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:19:30,593 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:19:30,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 07:19:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:19:31,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 07:19:31,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:19:33,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:19:35,025 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 109 treesize of output 82 [2024-11-09 07:19:35,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 125 [2024-11-09 07:19:36,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:19:36,700 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 241 treesize of output 91 [2024-11-09 07:19:36,907 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 07:19:36,908 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:19:37,233 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse2 (store |c_#memory_int| |c_~#var_1_16~0.base| v_ArrVal_380))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 c_~var_1_13_Pointer~0.base))) (concat (select .cse1 (bvadd (_ bv4 32) c_~var_1_13_Pointer~0.offset)) (select .cse1 c_~var_1_13_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp.neg (let ((.cse3 (let ((.cse4 (select .cse2 c_~var_1_12_Pointer~0.base))) (concat (select .cse4 (bvadd (_ bv4 32) c_~var_1_12_Pointer~0.offset)) (select .cse4 c_~var_1_12_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))))) is different from false [2024-11-09 07:19:37,255 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:19:37,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789350805] [2024-11-09 07:19:37,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789350805] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:19:37,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1515962941] [2024-11-09 07:19:37,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:19:37,256 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:19:37,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 07:19:37,258 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 07:19:37,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-11-09 07:19:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:19:39,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 07:19:39,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:19:43,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:19:43,651 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 26 treesize of output 1 [2024-11-09 07:19:45,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:19:45,855 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 1 case distinctions, treesize of input 123 treesize of output 57 [2024-11-09 07:19:47,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 119 [2024-11-09 07:19:49,195 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 07:19:49,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:19:49,288 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse2 (store |c_#memory_int| |c_~#var_1_16~0.base| v_ArrVal_413))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 c_~var_1_13_Pointer~0.base))) (concat (select .cse1 (bvadd (_ bv4 32) c_~var_1_13_Pointer~0.offset)) (select .cse1 c_~var_1_13_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp.neg (let ((.cse3 (let ((.cse4 (select .cse2 c_~var_1_12_Pointer~0.base))) (concat (select .cse4 (bvadd (_ bv4 32) c_~var_1_12_Pointer~0.offset)) (select .cse4 c_~var_1_12_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))))) is different from false [2024-11-09 07:19:49,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1515962941] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:19:49,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718705583] [2024-11-09 07:19:49,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:19:49,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:19:49,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:19:49,307 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:19:49,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 07:19:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:19:49,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 07:19:49,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:19:52,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2024-11-09 07:19:56,152 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 69 treesize of output 55 [2024-11-09 07:20:01,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 90 [2024-11-09 07:20:02,649 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 0 case distinctions, treesize of input 182 treesize of output 86 [2024-11-09 07:20:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 07:20:07,303 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:20:07,388 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse2 (store |c_#memory_int| |c_~#var_1_16~0.base| v_ArrVal_446))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 c_~var_1_13_Pointer~0.base))) (concat (select .cse1 (bvadd (_ bv4 32) c_~var_1_13_Pointer~0.offset)) (select .cse1 c_~var_1_13_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp.neg (let ((.cse3 (let ((.cse4 (select .cse2 c_~var_1_12_Pointer~0.base))) (concat (select .cse4 (bvadd (_ bv4 32) c_~var_1_12_Pointer~0.offset)) (select .cse4 c_~var_1_12_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))))) is different from false [2024-11-09 07:20:07,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718705583] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:20:07,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:20:07,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2024-11-09 07:20:07,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590072517] [2024-11-09 07:20:07,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:20:07,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 07:20:07,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:20:07,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 07:20:07,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1094, Unknown=7, NotChecked=204, Total=1406 [2024-11-09 07:20:07,408 INFO L87 Difference]: Start difference. First operand 166 states and 214 transitions. Second operand has 33 states, 33 states have (on average 5.0606060606060606) internal successors, (167), 32 states have internal predecessors, (167), 12 states have call successors, (33), 12 states have call predecessors, (33), 12 states have return successors, (33), 12 states have call predecessors, (33), 12 states have call successors, (33) [2024-11-09 07:20:09,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:20:16,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:20:18,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:20:20,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:20:22,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:20:24,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:20:26,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:20:28,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:20:30,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:20:32,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:20:34,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:20:36,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:20:38,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:20:40,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:20:42,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:20:45,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:20:47,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:20:49,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:20:51,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:20:53,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:20:55,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:20:57,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:20:59,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:21:01,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:21:03,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:21:06,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:21:08,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:21:10,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:21:12,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:21:14,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:21:16,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:21:18,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:21:20,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:21:22,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:21:24,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:21:27,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:21:29,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:21:31,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:21:33,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:21:35,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:21:37,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:21:39,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:21:41,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:21:43,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:21:45,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:21:48,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:21:50,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:21:52,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:21:55,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:22:00,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:22:04,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:22:06,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:22:08,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:22:10,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:22:30,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:22:34,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:22:36,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:22:36,088 INFO L93 Difference]: Finished difference Result 545 states and 684 transitions. [2024-11-09 07:22:36,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:22:36,090 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 5.0606060606060606) internal successors, (167), 32 states have internal predecessors, (167), 12 states have call successors, (33), 12 states have call predecessors, (33), 12 states have return successors, (33), 12 states have call predecessors, (33), 12 states have call successors, (33) Word has length 116 [2024-11-09 07:22:36,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:22:36,091 INFO L225 Difference]: With dead ends: 545 [2024-11-09 07:22:36,092 INFO L226 Difference]: Without dead ends: 382 [2024-11-09 07:22:36,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 439 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 36.7s TimeCoverageRelationStatistics Valid=292, Invalid=1963, Unknown=13, NotChecked=282, Total=2550 [2024-11-09 07:22:36,094 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 936 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 2247 mSolverCounterSat, 161 mSolverCounterUnsat, 56 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 128.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 2464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 2247 IncrementalHoareTripleChecker+Invalid, 56 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 128.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:22:36,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1483 Invalid, 2464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 2247 Invalid, 56 Unknown, 0 Unchecked, 128.9s Time] [2024-11-09 07:22:36,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-09 07:22:36,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 208. [2024-11-09 07:22:36,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 184 states have (on average 1.2391304347826086) internal successors, (228), 185 states have internal predecessors, (228), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 07:22:36,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 264 transitions. [2024-11-09 07:22:36,127 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 264 transitions. Word has length 116 [2024-11-09 07:22:36,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:22:36,128 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 264 transitions. [2024-11-09 07:22:36,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.0606060606060606) internal successors, (167), 32 states have internal predecessors, (167), 12 states have call successors, (33), 12 states have call predecessors, (33), 12 states have return successors, (33), 12 states have call predecessors, (33), 12 states have call successors, (33) [2024-11-09 07:22:36,129 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 264 transitions. [2024-11-09 07:22:36,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 07:22:36,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:22:36,130 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:22:36,144 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-09 07:22:36,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-09 07:22:36,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2024-11-09 07:22:36,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 07:22:36,731 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:22:36,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:22:36,732 INFO L85 PathProgramCache]: Analyzing trace with hash -703112863, now seen corresponding path program 1 times [2024-11-09 07:22:36,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:22:36,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160199341] [2024-11-09 07:22:36,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:22:36,733 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:22:36,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:22:36,737 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:22:36,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-09 07:22:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:22:37,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:22:37,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:22:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-09 07:22:37,152 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:22:37,152 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:22:37,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160199341] [2024-11-09 07:22:37,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1160199341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:22:37,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:22:37,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:22:37,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257806053] [2024-11-09 07:22:37,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:22:37,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:22:37,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:22:37,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:22:37,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:22:37,154 INFO L87 Difference]: Start difference. First operand 208 states and 264 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 07:22:37,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:22:37,285 INFO L93 Difference]: Finished difference Result 415 states and 528 transitions. [2024-11-09 07:22:37,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:22:37,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2024-11-09 07:22:37,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:22:37,290 INFO L225 Difference]: With dead ends: 415 [2024-11-09 07:22:37,290 INFO L226 Difference]: Without dead ends: 210 [2024-11-09 07:22:37,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:22:37,292 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:22:37,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 409 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:22:37,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-09 07:22:37,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2024-11-09 07:22:37,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 186 states have (on average 1.2311827956989247) internal successors, (229), 187 states have internal predecessors, (229), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 07:22:37,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 265 transitions. [2024-11-09 07:22:37,319 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 265 transitions. Word has length 116 [2024-11-09 07:22:37,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:22:37,319 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 265 transitions. [2024-11-09 07:22:37,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 07:22:37,320 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 265 transitions. [2024-11-09 07:22:37,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 07:22:37,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:22:37,322 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:22:37,338 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-09 07:22:37,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:22:37,522 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:22:37,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:22:37,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1527297181, now seen corresponding path program 1 times [2024-11-09 07:22:37,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:22:37,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32556105] [2024-11-09 07:22:37,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:22:37,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:22:37,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:22:37,525 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:22:37,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-09 07:22:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:22:37,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:22:37,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:22:37,960 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-09 07:22:37,961 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:22:37,961 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:22:37,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32556105] [2024-11-09 07:22:37,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32556105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:22:37,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:22:37,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:22:37,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797210457] [2024-11-09 07:22:37,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:22:37,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:22:37,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:22:37,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:22:37,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:22:37,963 INFO L87 Difference]: Start difference. First operand 210 states and 265 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 07:22:38,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:22:38,073 INFO L93 Difference]: Finished difference Result 417 states and 527 transitions. [2024-11-09 07:22:38,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:22:38,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2024-11-09 07:22:38,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:22:38,075 INFO L225 Difference]: With dead ends: 417 [2024-11-09 07:22:38,076 INFO L226 Difference]: Without dead ends: 210 [2024-11-09 07:22:38,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:22:38,077 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:22:38,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 409 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:22:38,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-09 07:22:38,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2024-11-09 07:22:38,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 186 states have (on average 1.2258064516129032) internal successors, (228), 187 states have internal predecessors, (228), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 07:22:38,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 264 transitions. [2024-11-09 07:22:38,107 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 264 transitions. Word has length 116 [2024-11-09 07:22:38,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:22:38,108 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 264 transitions. [2024-11-09 07:22:38,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 07:22:38,108 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 264 transitions. [2024-11-09 07:22:38,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 07:22:38,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:22:38,110 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:22:38,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-09 07:22:38,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:22:38,310 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:22:38,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:22:38,311 INFO L85 PathProgramCache]: Analyzing trace with hash -514653350, now seen corresponding path program 1 times [2024-11-09 07:22:38,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:22:38,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082777188] [2024-11-09 07:22:38,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:22:38,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:22:38,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:22:38,313 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:22:38,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-09 07:22:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:22:38,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 07:22:38,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:22:42,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:22:44,254 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 109 treesize of output 82 [2024-11-09 07:22:45,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 163 [2024-11-09 07:22:47,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 163 [2024-11-09 07:22:47,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 163 [2024-11-09 07:22:47,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 163 [2024-11-09 07:22:48,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:22:48,662 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 291 treesize of output 111 [2024-11-09 07:22:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 07:22:48,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:22:49,353 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_530 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse2 (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_530))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 c_~var_1_13_Pointer~0.base))) (concat (select .cse1 (bvadd (_ bv4 32) c_~var_1_13_Pointer~0.offset)) (select .cse1 c_~var_1_13_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp.neg (let ((.cse3 (let ((.cse4 (select .cse2 c_~var_1_12_Pointer~0.base))) (concat (select .cse4 (bvadd (_ bv4 32) c_~var_1_12_Pointer~0.offset)) (select .cse4 c_~var_1_12_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))))) is different from false [2024-11-09 07:22:49,398 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse2 (store (store |c_#memory_int| c_~var_1_10_Pointer~0.base v_ArrVal_529) c_~var_1_1_Pointer~0.base v_ArrVal_530))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 c_~var_1_13_Pointer~0.base))) (concat (select .cse1 (bvadd (_ bv4 32) c_~var_1_13_Pointer~0.offset)) (select .cse1 c_~var_1_13_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp.neg (let ((.cse3 (let ((.cse4 (select .cse2 c_~var_1_12_Pointer~0.base))) (concat (select .cse4 (bvadd (_ bv4 32) c_~var_1_12_Pointer~0.offset)) (select .cse4 c_~var_1_12_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))))) is different from false [2024-11-09 07:22:49,429 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_528 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse2 (store (store (store |c_#memory_int| c_~var_1_14_Pointer~0.base v_ArrVal_528) c_~var_1_10_Pointer~0.base v_ArrVal_529) c_~var_1_1_Pointer~0.base v_ArrVal_530))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 c_~var_1_13_Pointer~0.base))) (concat (select .cse1 (bvadd (_ bv4 32) c_~var_1_13_Pointer~0.offset)) (select .cse1 c_~var_1_13_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp.neg (let ((.cse3 (let ((.cse4 (select .cse2 c_~var_1_12_Pointer~0.base))) (concat (select .cse4 (bvadd (_ bv4 32) c_~var_1_12_Pointer~0.offset)) (select .cse4 c_~var_1_12_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))))) is different from false [2024-11-09 07:22:49,484 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:22:49,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082777188] [2024-11-09 07:22:49,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082777188] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:22:49,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1801661453] [2024-11-09 07:22:49,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:22:49,485 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:22:49,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 07:22:49,486 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 07:22:49,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-11-09 07:22:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:22:51,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 07:22:51,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:22:56,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2024-11-09 07:22:59,556 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 116 treesize of output 67 [2024-11-09 07:23:03,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 113 [2024-11-09 07:23:05,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 113 [2024-11-09 07:23:06,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 113 [2024-11-09 07:23:06,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 113 [2024-11-09 07:23:07,916 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 0 case distinctions, treesize of input 209 treesize of output 105 [2024-11-09 07:23:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 07:23:10,114 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:23:10,240 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_564 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse2 (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_564))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 c_~var_1_13_Pointer~0.base))) (concat (select .cse1 (bvadd (_ bv4 32) c_~var_1_13_Pointer~0.offset)) (select .cse1 c_~var_1_13_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp.neg (let ((.cse3 (let ((.cse4 (select .cse2 c_~var_1_12_Pointer~0.base))) (concat (select .cse4 (bvadd (_ bv4 32) c_~var_1_12_Pointer~0.offset)) (select .cse4 c_~var_1_12_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))))) is different from false [2024-11-09 07:23:10,291 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_564 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse2 (store (store |c_#memory_int| c_~var_1_10_Pointer~0.base v_ArrVal_563) c_~var_1_1_Pointer~0.base v_ArrVal_564))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 c_~var_1_13_Pointer~0.base))) (concat (select .cse1 (bvadd (_ bv4 32) c_~var_1_13_Pointer~0.offset)) (select .cse1 c_~var_1_13_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp.neg (let ((.cse3 (let ((.cse4 (select .cse2 c_~var_1_12_Pointer~0.base))) (concat (select .cse4 (bvadd (_ bv4 32) c_~var_1_12_Pointer~0.offset)) (select .cse4 c_~var_1_12_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))))) is different from false [2024-11-09 07:23:10,328 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_562 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse2 (store (store (store |c_#memory_int| c_~var_1_14_Pointer~0.base v_ArrVal_562) c_~var_1_10_Pointer~0.base v_ArrVal_563) c_~var_1_1_Pointer~0.base v_ArrVal_564))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 c_~var_1_13_Pointer~0.base))) (concat (select .cse1 (bvadd (_ bv4 32) c_~var_1_13_Pointer~0.offset)) (select .cse1 c_~var_1_13_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp.neg (let ((.cse3 (let ((.cse4 (select .cse2 c_~var_1_12_Pointer~0.base))) (concat (select .cse4 (bvadd (_ bv4 32) c_~var_1_12_Pointer~0.offset)) (select .cse4 c_~var_1_12_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))))) is different from false [2024-11-09 07:23:10,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1801661453] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:23:10,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678405759] [2024-11-09 07:23:10,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:23:10,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:23:10,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:23:10,408 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:23:10,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-09 07:23:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:23:10,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 07:23:10,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:23:14,581 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 16 treesize of output 17 [2024-11-09 07:23:30,757 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 121 treesize of output 79 [2024-11-09 07:23:50,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 131 [2024-11-09 07:23:57,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 131 [2024-11-09 07:24:05,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 131 [2024-11-09 07:24:14,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 131 [2024-11-09 07:24:27,578 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 0 case distinctions, treesize of input 243 treesize of output 107 [2024-11-09 07:24:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 07:24:31,635 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:24:33,003 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_596 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_595 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse2 (store (store |c_#memory_int| c_~var_1_10_Pointer~0.base v_ArrVal_595) c_~var_1_1_Pointer~0.base v_ArrVal_596))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 c_~var_1_13_Pointer~0.base))) (concat (select .cse1 (bvadd (_ bv4 32) c_~var_1_13_Pointer~0.offset)) (select .cse1 c_~var_1_13_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp.neg (let ((.cse3 (let ((.cse4 (select .cse2 c_~var_1_12_Pointer~0.base))) (concat (select .cse4 (bvadd (_ bv4 32) c_~var_1_12_Pointer~0.offset)) (select .cse4 c_~var_1_12_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))))) is different from false [2024-11-09 07:24:33,032 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_596 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_594 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_595 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse2 (store (store (store |c_#memory_int| c_~var_1_14_Pointer~0.base v_ArrVal_594) c_~var_1_10_Pointer~0.base v_ArrVal_595) c_~var_1_1_Pointer~0.base v_ArrVal_596))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 c_~var_1_13_Pointer~0.base))) (concat (select .cse1 (bvadd (_ bv4 32) c_~var_1_13_Pointer~0.offset)) (select .cse1 c_~var_1_13_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp.neg (let ((.cse3 (let ((.cse4 (select .cse2 c_~var_1_12_Pointer~0.base))) (concat (select .cse4 (bvadd (_ bv4 32) c_~var_1_12_Pointer~0.offset)) (select .cse4 c_~var_1_12_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))))) is different from false [2024-11-09 07:24:33,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678405759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:24:33,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:24:33,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2024-11-09 07:24:33,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436192905] [2024-11-09 07:24:33,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:24:33,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-09 07:24:33,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:24:33,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-09 07:24:33,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1923, Unknown=71, NotChecked=776, Total=2970 [2024-11-09 07:24:33,105 INFO L87 Difference]: Start difference. First operand 210 states and 264 transitions. Second operand has 44 states, 44 states have (on average 4.681818181818182) internal successors, (206), 43 states have internal predecessors, (206), 12 states have call successors, (33), 12 states have call predecessors, (33), 12 states have return successors, (33), 12 states have call predecessors, (33), 12 states have call successors, (33) [2024-11-09 07:24:44,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:24:46,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:24:53,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:24:55,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:25:02,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:25:04,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:25:06,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:25:08,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:25:10,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:25:12,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:25:14,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:25:16,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:26:02,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:26:02,781 INFO L93 Difference]: Finished difference Result 587 states and 727 transitions. [2024-11-09 07:26:02,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:26:02,784 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 4.681818181818182) internal successors, (206), 43 states have internal predecessors, (206), 12 states have call successors, (33), 12 states have call predecessors, (33), 12 states have return successors, (33), 12 states have call predecessors, (33), 12 states have call successors, (33) Word has length 117 [2024-11-09 07:26:02,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:26:02,788 INFO L225 Difference]: With dead ends: 587 [2024-11-09 07:26:02,788 INFO L226 Difference]: Without dead ends: 380 [2024-11-09 07:26:02,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 392 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 112.1s TimeCoverageRelationStatistics Valid=396, Invalid=2981, Unknown=77, NotChecked=968, Total=4422 [2024-11-09 07:26:02,792 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 1091 mSDsluCounter, 1644 mSDsCounter, 0 mSdLazyCounter, 2678 mSolverCounterSat, 133 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 2678 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 60.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:26:02,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 1726 Invalid, 2823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 2678 Invalid, 12 Unknown, 0 Unchecked, 60.2s Time] [2024-11-09 07:26:02,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-09 07:26:02,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 255. [2024-11-09 07:26:02,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 231 states have (on average 1.2164502164502164) internal successors, (281), 232 states have internal predecessors, (281), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 07:26:02,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 317 transitions. [2024-11-09 07:26:02,832 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 317 transitions. Word has length 117 [2024-11-09 07:26:02,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:26:02,833 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 317 transitions. [2024-11-09 07:26:02,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 4.681818181818182) internal successors, (206), 43 states have internal predecessors, (206), 12 states have call successors, (33), 12 states have call predecessors, (33), 12 states have return successors, (33), 12 states have call predecessors, (33), 12 states have call successors, (33) [2024-11-09 07:26:02,834 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 317 transitions. [2024-11-09 07:26:02,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 07:26:02,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:26:02,836 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:26:02,860 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2024-11-09 07:26:03,065 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-09 07:26:03,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-09 07:26:03,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:26:03,439 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:26:03,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:26:03,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1741135520, now seen corresponding path program 1 times [2024-11-09 07:26:03,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:26:03,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961293562] [2024-11-09 07:26:03,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:26:03,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:26:03,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:26:03,445 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:26:03,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-09 07:26:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:26:04,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 07:26:04,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:26:08,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:26:10,098 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 109 treesize of output 82 [2024-11-09 07:26:10,941 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 109 treesize of output 82 [2024-11-09 07:26:11,728 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 109 treesize of output 82 [2024-11-09 07:26:12,788 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 109 treesize of output 82 [2024-11-09 07:26:13,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:26:13,309 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 170 treesize of output 96 [2024-11-09 07:26:13,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 140 [2024-11-09 07:26:15,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:26:15,010 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 260 treesize of output 100 [2024-11-09 07:26:15,558 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 07:26:15,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:26:16,973 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_179| (_ BitVec 64)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (or (let ((.cse2 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store |c_#memory_int| c_~var_1_10_Pointer~0.base (store (store (select |c_#memory_int| c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_179|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_179|))) c_~var_1_1_Pointer~0.base v_ArrVal_630))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse5 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (select .cse5 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_179|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_179|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_179|)) |c_ULTIMATE.start_step_#t~ite28#1|)))) is different from false [2024-11-09 07:26:17,050 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_179| (_ BitVec 64)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset))) (or (let ((.cse2 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store |c_#memory_int| c_~var_1_10_Pointer~0.base (store (store (select |c_#memory_int| c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_179|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_179|))) c_~var_1_1_Pointer~0.base v_ArrVal_630))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_179|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_179|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_179|)) (let ((.cse7 (let ((.cse8 (select |c_#memory_int| c_~var_1_11_Pointer~0.base))) (concat (select .cse8 .cse6) (select .cse8 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))) is different from false [2024-11-09 07:26:17,364 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_179| (_ BitVec 64)) (v_ArrVal_627 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse3 (store |c_#memory_int| c_~var_1_14_Pointer~0.base v_ArrVal_627))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_179|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_179|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_179|)) (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select .cse3 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_179|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_179|))) c_~var_1_1_Pointer~0.base v_ArrVal_630))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse8 (let ((.cse9 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse9 .cse2) (select .cse9 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2024-11-09 07:26:17,799 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:26:17,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961293562] [2024-11-09 07:26:17,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961293562] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:26:17,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [867200743] [2024-11-09 07:26:17,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:26:17,800 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:26:17,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 07:26:17,802 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 07:26:17,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-09 07:26:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:26:23,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-09 07:26:23,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:26:32,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2024-11-09 07:26:37,571 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 113 treesize of output 75 [2024-11-09 07:26:44,693 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 217 treesize of output 137 [2024-11-09 07:26:50,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 295 treesize of output 232 [2024-11-09 07:26:55,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 295 treesize of output 232 [2024-11-09 07:27:01,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 340 treesize of output 194 [2024-11-09 07:27:02,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 209 [2024-11-09 07:27:09,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 386 treesize of output 202 [2024-11-09 07:27:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 07:27:12,863 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:27:39,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [867200743] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:27:39,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015902089] [2024-11-09 07:27:39,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:39,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:27:39,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:27:39,128 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:27:39,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9d20b0-85ff-48fb-ac13-7e3d595e9b86/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-09 07:27:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:40,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-09 07:27:40,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:27:48,867 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 16 treesize of output 17 [2024-11-09 07:28:06,549 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 127 treesize of output 63 [2024-11-09 07:28:23,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 145 [2024-11-09 07:28:35,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 145 [2024-11-09 07:28:50,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 145 [2024-11-09 07:29:14,672 INFO L349 Elim1Store]: treesize reduction 192, result has 21.0 percent of original size [2024-11-09 07:29:14,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 315 treesize of output 223 [2024-11-09 07:29:19,703 INFO L349 Elim1Store]: treesize reduction 37, result has 19.6 percent of original size [2024-11-09 07:29:19,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 523 treesize of output 405 [2024-11-09 07:29:19,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:29:19,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 51 [2024-11-09 07:29:50,168 WARN L286 SmtUtils]: Spent 6.71s on a formula simplification that was a NOOP. DAG size: 221 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 07:29:50,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:29:50,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 4 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 66 case distinctions, treesize of input 1542 treesize of output 1304 [2024-11-09 07:30:58,019 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-09 07:30:58,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:31:46,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015902089] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:31:46,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:31:46,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 27, 27] total 64 [2024-11-09 07:31:46,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502023494] [2024-11-09 07:31:46,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:31:46,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-11-09 07:31:46,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:31:46,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-09 07:31:46,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=784, Invalid=6494, Unknown=216, NotChecked=516, Total=8010 [2024-11-09 07:31:46,979 INFO L87 Difference]: Start difference. First operand 255 states and 317 transitions. Second operand has 65 states, 64 states have (on average 3.484375) internal successors, (223), 64 states have internal predecessors, (223), 16 states have call successors, (33), 15 states have call predecessors, (33), 16 states have return successors, (33), 15 states have call predecessors, (33), 16 states have call successors, (33)