./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-30.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-30.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14263a7f5b9de37c93df4817d1a8be828f9a9f73581f135551b120fdb5e36320 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:34:07,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:34:07,847 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 04:34:07,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:34:07,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:34:07,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:34:07,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:34:07,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:34:07,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:34:07,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:34:07,903 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:34:07,903 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:34:07,904 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:34:07,904 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 04:34:07,905 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:34:07,905 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:34:07,905 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 04:34:07,906 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 04:34:07,906 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:34:07,906 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 04:34:07,906 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 04:34:07,906 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 04:34:07,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:34:07,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:34:07,907 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:34:07,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:34:07,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:34:07,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:34:07,907 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:34:07,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:34:07,907 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:34:07,907 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:34:07,907 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:34:07,907 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:34:07,908 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:34:07,908 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:34:07,908 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:34:07,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:34:07,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:34:07,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:34:07,908 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:34:07,908 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 04:34:07,908 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 04:34:07,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 04:34:07,908 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:34:07,909 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:34:07,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 04:34:07,910 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 14263a7f5b9de37c93df4817d1a8be828f9a9f73581f135551b120fdb5e36320 [2024-11-14 04:34:08,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:34:08,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:34:08,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:34:08,306 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:34:08,307 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:34:08,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-30.i Unable to find full path for "g++" [2024-11-14 04:34:10,229 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:34:10,473 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:34:10,474 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-30.i [2024-11-14 04:34:10,486 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/data/0ed22a629/ad016952f02c479cac0e6cf390433d4e/FLAG35a8ad73a [2024-11-14 04:34:10,796 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/data/0ed22a629/ad016952f02c479cac0e6cf390433d4e [2024-11-14 04:34:10,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:34:10,805 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:34:10,806 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:34:10,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:34:10,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:34:10,812 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:34:10" (1/1) ... [2024-11-14 04:34:10,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca341d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:10, skipping insertion in model container [2024-11-14 04:34:10,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:34:10" (1/1) ... [2024-11-14 04:34:10,839 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:34:11,021 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_53125025-27db-4e4c-8ad8-02b640e4060c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-30.i[915,928] [2024-11-14 04:34:11,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:34:11,097 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:34:11,112 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_53125025-27db-4e4c-8ad8-02b640e4060c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-30.i[915,928] [2024-11-14 04:34:11,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:34:11,171 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:34:11,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:11 WrapperNode [2024-11-14 04:34:11,176 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:34:11,177 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:34:11,177 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:34:11,177 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:34:11,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:11" (1/1) ... [2024-11-14 04:34:11,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:11" (1/1) ... [2024-11-14 04:34:11,232 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2024-11-14 04:34:11,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:34:11,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:34:11,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:34:11,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:34:11,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:11" (1/1) ... [2024-11-14 04:34:11,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:11" (1/1) ... [2024-11-14 04:34:11,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:11" (1/1) ... [2024-11-14 04:34:11,254 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:11" (1/1) ... [2024-11-14 04:34:11,259 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:11" (1/1) ... [2024-11-14 04:34:11,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:11" (1/1) ... [2024-11-14 04:34:11,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:11" (1/1) ... [2024-11-14 04:34:11,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:11" (1/1) ... [2024-11-14 04:34:11,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:34:11,280 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:34:11,280 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:34:11,280 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:34:11,281 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:11" (1/1) ... [2024-11-14 04:34:11,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:34:11,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:34:11,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:34:11,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:34:11,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:34:11,355 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 04:34:11,356 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 04:34:11,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 04:34:11,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:34:11,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:34:11,425 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:34:11,427 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:34:11,753 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-14 04:34:11,753 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:34:11,899 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:34:11,899 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 04:34:11,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:34:11 BoogieIcfgContainer [2024-11-14 04:34:11,900 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:34:11,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:34:11,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:34:11,911 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:34:11,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:34:10" (1/3) ... [2024-11-14 04:34:11,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114bdf28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:34:11, skipping insertion in model container [2024-11-14 04:34:11,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:11" (2/3) ... [2024-11-14 04:34:11,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114bdf28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:34:11, skipping insertion in model container [2024-11-14 04:34:11,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:34:11" (3/3) ... [2024-11-14 04:34:11,915 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-30.i [2024-11-14 04:34:11,928 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:34:11,929 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-30.i that has 2 procedures, 25 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 04:34:12,000 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:34:12,018 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;@2d6b3982, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:34:12,019 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 04:34:12,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 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-14 04:34:12,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-14 04:34:12,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:34:12,033 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] [2024-11-14 04:34:12,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:34:12,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:34:12,040 INFO L85 PathProgramCache]: Analyzing trace with hash 868471729, now seen corresponding path program 1 times [2024-11-14 04:34:12,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:34:12,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109158830] [2024-11-14 04:34:12,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:34:12,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:34:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-14 04:34:12,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [568970007] [2024-11-14 04:34:12,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:34:12,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:34:12,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:34:12,283 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:34:12,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 04:34:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:34:12,457 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 04:34:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:34:12,592 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 04:34:12,594 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 04:34:12,597 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 04:34:12,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 04:34:12,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:34:12,804 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-14 04:34:12,840 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 04:34:12,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:34:12 BoogieIcfgContainer [2024-11-14 04:34:12,843 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 04:34:12,844 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 04:34:12,844 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 04:34:12,844 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 04:34:12,845 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:34:11" (3/4) ... [2024-11-14 04:34:12,847 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 04:34:12,848 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 04:34:12,849 INFO L158 Benchmark]: Toolchain (without parser) took 2045.71ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 78.7MB in the end (delta: 13.2MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2024-11-14 04:34:12,850 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 83.9MB. Free memory is still 41.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:34:12,850 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.78ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 79.4MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 04:34:12,851 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.54ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 77.6MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 04:34:12,851 INFO L158 Benchmark]: Boogie Preprocessor took 46.11ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 76.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:34:12,851 INFO L158 Benchmark]: RCFGBuilder took 620.31ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 54.1MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 04:34:12,852 INFO L158 Benchmark]: TraceAbstraction took 938.90ms. Allocated memory is still 117.4MB. Free memory was 53.4MB in the beginning and 78.7MB in the end (delta: -25.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:34:12,852 INFO L158 Benchmark]: Witness Printer took 4.34ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 78.7MB in the end (delta: 14.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:34:12,858 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 83.9MB. Free memory is still 41.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.78ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 79.4MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.54ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 77.6MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.11ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 76.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 620.31ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 54.1MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 938.90ms. Allocated memory is still 117.4MB. Free memory was 53.4MB in the beginning and 78.7MB in the end (delta: -25.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.34ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 78.7MB in the end (delta: 14.1kB). 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 76, overapproximation of someBinaryFLOATComparisonOperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 64; [L23] unsigned char var_1_2 = 0; [L24] signed short int var_1_5 = 8; [L25] signed short int var_1_6 = -32; [L26] unsigned char var_1_7 = 100; [L27] signed long int var_1_8 = 32; [L28] float var_1_10 = 255.3; [L29] float var_1_13 = 2.8; [L30] signed long int last_1_var_1_8 = 32; [L86] isInitial = 1 [L87] FCALL initially() [L88] COND TRUE 1 [L89] CALL updateLastVariables() [L79] last_1_var_1_8 = var_1_8 [L89] RET updateLastVariables() [L90] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_5=8, var_1_6=-32, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) [L62] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_5=8, var_1_6=-32, var_1_7=100, var_1_8=32] [L63] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=8, var_1_6=-32, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) [L63] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=8, var_1_6=-32, var_1_7=100, var_1_8=32] [L64] var_1_5 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-32, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) [L65] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-32, var_1_7=100, var_1_8=32] [L66] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-32, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) [L66] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-32, var_1_7=100, var_1_8=32] [L67] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-32, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) [L67] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-32, var_1_7=100, var_1_8=32] [L68] var_1_6 = __VERIFIER_nondet_short() [L69] CALL assume_abort_if_not(var_1_6 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) [L69] RET assume_abort_if_not(var_1_6 >= -32768) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_7=100, var_1_8=32] [L70] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) [L70] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_7=100, var_1_8=32] [L71] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) [L71] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_7=100, var_1_8=32] [L72] var_1_7 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_8=32] [L20] COND FALSE !(!cond) [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_8=32] [L74] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_7=-191, var_1_8=32] [L20] COND FALSE !(!cond) [L74] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_7=-191, var_1_8=32] [L75] var_1_13 = __VERIFIER_nondet_float() [L76] 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_8=32, var_1_10=2553/10, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_7=-191, var_1_8=32] [L20] COND FALSE !(!cond) [L76] 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_8=32, var_1_10=2553/10, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_7=-191, var_1_8=32] [L90] RET updateVariables() [L91] CALL step() [L34] signed long int stepLocal_0 = (last_1_var_1_8 / var_1_5) % var_1_6; [L35] COND TRUE \read(var_1_2) [L36] COND FALSE !(last_1_var_1_8 > stepLocal_0) [L42] unsigned char stepLocal_1 = var_1_1; [L43] COND FALSE !(stepLocal_1 < var_1_5) [L46] var_1_8 = var_1_7 [L48] COND TRUE ((var_1_6 * var_1_8) * var_1_7) <= (var_1_8 - var_1_1) [L49] COND TRUE var_1_5 <= (var_1_8 + var_1_8) [L50] var_1_10 = var_1_13 [L91] RET step() [L92] CALL, EXPR property() [L82-L83] return ((var_1_2 ? ((last_1_var_1_8 > ((last_1_var_1_8 / var_1_5) % var_1_6)) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((var_1_1 < var_1_5) ? (var_1_8 == ((signed long int) (var_1_1 - ((((var_1_7) < (var_1_1)) ? (var_1_7) : (var_1_1)))))) : (var_1_8 == ((signed long int) var_1_7)))) && ((((var_1_6 * var_1_8) * var_1_7) <= (var_1_8 - var_1_1)) ? ((var_1_5 <= (var_1_8 + var_1_8)) ? (var_1_10 == ((float) var_1_13)) : 1) : ((var_1_1 >= var_1_1) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_13)))) ; [L92] RET, EXPR property() [L92] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2, var_1_13=2, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_7=-191, var_1_8=65] [L19] reach_error() VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2, var_1_13=2, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_7=-191, var_1_8=65] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, 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=25occurred 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, 0.2s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 2 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-14 04:34:12,888 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-30.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14263a7f5b9de37c93df4817d1a8be828f9a9f73581f135551b120fdb5e36320 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:34:15,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:34:15,727 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-14 04:34:15,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:34:15,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:34:15,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:34:15,789 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:34:15,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:34:15,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:34:15,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:34:15,790 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:34:15,790 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:34:15,790 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:34:15,791 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:34:15,792 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:34:15,792 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:34:15,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:34:15,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:34:15,792 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:34:15,793 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:34:15,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:34:15,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:34:15,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:34:15,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:34:15,793 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 04:34:15,793 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 04:34:15,793 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:34:15,793 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 04:34:15,793 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:34:15,793 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:34:15,794 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:34:15,794 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:34:15,794 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 04:34:15,794 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:34:15,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:34:15,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:34:15,794 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:34:15,794 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:34:15,794 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 04:34:15,795 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 04:34:15,795 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 04:34:15,795 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:34:15,795 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:34:15,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 14263a7f5b9de37c93df4817d1a8be828f9a9f73581f135551b120fdb5e36320 [2024-11-14 04:34:16,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:34:16,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:34:16,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:34:16,126 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:34:16,127 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:34:16,128 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-30.i Unable to find full path for "g++" [2024-11-14 04:34:18,078 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:34:18,405 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:34:18,406 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-30.i [2024-11-14 04:34:18,427 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/data/e829b8d32/ac125183b0ed4d9bafffcf18f28c37ab/FLAG727e5e345 [2024-11-14 04:34:18,452 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/data/e829b8d32/ac125183b0ed4d9bafffcf18f28c37ab [2024-11-14 04:34:18,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:34:18,458 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:34:18,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:34:18,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:34:18,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:34:18,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:34:18" (1/1) ... [2024-11-14 04:34:18,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b81c1c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:18, skipping insertion in model container [2024-11-14 04:34:18,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:34:18" (1/1) ... [2024-11-14 04:34:18,489 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:34:18,665 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_53125025-27db-4e4c-8ad8-02b640e4060c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-30.i[915,928] [2024-11-14 04:34:18,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:34:18,748 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:34:18,761 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_53125025-27db-4e4c-8ad8-02b640e4060c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-30.i[915,928] [2024-11-14 04:34:18,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:34:18,823 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:34:18,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:18 WrapperNode [2024-11-14 04:34:18,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:34:18,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:34:18,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:34:18,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:34:18,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:18" (1/1) ... [2024-11-14 04:34:18,850 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:18" (1/1) ... [2024-11-14 04:34:18,885 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 84 [2024-11-14 04:34:18,885 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:34:18,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:34:18,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:34:18,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:34:18,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:18" (1/1) ... [2024-11-14 04:34:18,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:18" (1/1) ... [2024-11-14 04:34:18,903 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:18" (1/1) ... [2024-11-14 04:34:18,904 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:18" (1/1) ... [2024-11-14 04:34:18,919 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:18" (1/1) ... [2024-11-14 04:34:18,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:18" (1/1) ... [2024-11-14 04:34:18,931 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:18" (1/1) ... [2024-11-14 04:34:18,933 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:18" (1/1) ... [2024-11-14 04:34:18,935 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:34:18,936 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:34:18,936 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:34:18,937 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:34:18,938 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:18" (1/1) ... [2024-11-14 04:34:18,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:34:18,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:34:18,986 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:34:18,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:34:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:34:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 04:34:19,016 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 04:34:19,016 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 04:34:19,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:34:19,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:34:19,121 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:34:19,123 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:34:19,590 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-14 04:34:19,591 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:34:19,603 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:34:19,603 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 04:34:19,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:34:19 BoogieIcfgContainer [2024-11-14 04:34:19,604 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:34:19,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:34:19,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:34:19,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:34:19,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:34:18" (1/3) ... [2024-11-14 04:34:19,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36186aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:34:19, skipping insertion in model container [2024-11-14 04:34:19,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:18" (2/3) ... [2024-11-14 04:34:19,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36186aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:34:19, skipping insertion in model container [2024-11-14 04:34:19,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:34:19" (3/3) ... [2024-11-14 04:34:19,625 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-30.i [2024-11-14 04:34:19,643 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:34:19,644 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-30.i that has 2 procedures, 42 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 04:34:19,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:34:19,718 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;@32cea922, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:34:19,718 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 04:34:19,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 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-14 04:34:19,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-14 04:34:19,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:34:19,732 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] [2024-11-14 04:34:19,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:34:19,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:34:19,737 INFO L85 PathProgramCache]: Analyzing trace with hash -224234091, now seen corresponding path program 1 times [2024-11-14 04:34:19,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:34:19,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332720949] [2024-11-14 04:34:19,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:34:19,748 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:34:19,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:34:19,750 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:34:19,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-14 04:34:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:34:20,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-14 04:34:20,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:34:20,060 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-14 04:34:20,061 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:34:20,063 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:34:20,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332720949] [2024-11-14 04:34:20,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332720949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:34:20,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:34:20,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:34:20,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63605813] [2024-11-14 04:34:20,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:34:20,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 04:34:20,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:34:20,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 04:34:20,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 04:34:20,110 INFO L87 Difference]: Start difference. First operand has 42 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 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 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:34:20,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:34:20,132 INFO L93 Difference]: Finished difference Result 77 states and 127 transitions. [2024-11-14 04:34:20,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:34:20,134 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2024-11-14 04:34:20,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:34:20,140 INFO L225 Difference]: With dead ends: 77 [2024-11-14 04:34:20,140 INFO L226 Difference]: Without dead ends: 38 [2024-11-14 04:34:20,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 04:34:20,146 INFO L432 NwaCegarLoop]: 53 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, 53 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:34:20,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 04:34:20,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-14 04:34:20,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-14 04:34:20,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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-14 04:34:20,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2024-11-14 04:34:20,191 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 74 [2024-11-14 04:34:20,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:34:20,191 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2024-11-14 04:34:20,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:34:20,192 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2024-11-14 04:34:20,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-14 04:34:20,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:34:20,195 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] [2024-11-14 04:34:20,201 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-14 04:34:20,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:34:20,395 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:34:20,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:34:20,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1128730733, now seen corresponding path program 1 times [2024-11-14 04:34:20,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:34:20,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438356765] [2024-11-14 04:34:20,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:34:20,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:34:20,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:34:20,400 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:34:20,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-14 04:34:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:34:20,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 04:34:20,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:34:29,529 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-14 04:34:29,529 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:34:29,529 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:34:29,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438356765] [2024-11-14 04:34:29,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438356765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:34:29,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:34:29,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-14 04:34:29,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415869618] [2024-11-14 04:34:29,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:34:29,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 04:34:29,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:34:29,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 04:34:29,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-14 04:34:29,533 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:34:34,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:34:34,700 INFO L93 Difference]: Finished difference Result 109 states and 144 transitions. [2024-11-14 04:34:34,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 04:34:34,705 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2024-11-14 04:34:34,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:34:34,707 INFO L225 Difference]: With dead ends: 109 [2024-11-14 04:34:34,707 INFO L226 Difference]: Without dead ends: 74 [2024-11-14 04:34:34,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2024-11-14 04:34:34,709 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 104 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-14 04:34:34,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 177 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-14 04:34:34,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-14 04:34:34,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 49. [2024-11-14 04:34:34,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 04:34:34,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2024-11-14 04:34:34,725 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 74 [2024-11-14 04:34:34,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:34:34,727 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2024-11-14 04:34:34,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:34:34,728 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2024-11-14 04:34:34,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-14 04:34:34,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:34:34,730 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] [2024-11-14 04:34:34,740 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-14 04:34:34,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:34:34,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:34:34,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:34:34,934 INFO L85 PathProgramCache]: Analyzing trace with hash -892309357, now seen corresponding path program 1 times [2024-11-14 04:34:34,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:34:34,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124738831] [2024-11-14 04:34:34,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:34:34,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:34:34,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:34:34,939 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:34:34,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-14 04:34:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:34:35,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 04:34:35,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:34:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 132 proven. 15 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-14 04:34:42,419 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:35:21,839 WARN L286 SmtUtils]: Spent 19.22s on a formula simplification that was a NOOP. DAG size: 107 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:35:59,706 WARN L286 SmtUtils]: Spent 19.99s on a formula simplification that was a NOOP. DAG size: 106 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:36:35,168 WARN L286 SmtUtils]: Spent 15.87s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:37:11,515 WARN L286 SmtUtils]: Spent 20.14s on a formula simplification. DAG size of input: 85 DAG size of output: 82 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:37:39,361 WARN L286 SmtUtils]: Spent 7.25s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:37:50,447 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-14 04:37:50,447 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:37:50,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124738831] [2024-11-14 04:37:50,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124738831] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 04:37:50,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:37:50,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [15] total 26 [2024-11-14 04:37:50,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248426165] [2024-11-14 04:37:50,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:37:50,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 04:37:50,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:37:50,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 04:37:50,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=528, Unknown=6, NotChecked=0, Total=650 [2024-11-14 04:37:50,450 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:37:55,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:38:02,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:38:09,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:38:24,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:38:38,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:38:40,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:38:42,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:38:53,404 WARN L286 SmtUtils]: Spent 7.54s on a formula simplification. DAG size of input: 76 DAG size of output: 81 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:38:54,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:39:16,726 WARN L286 SmtUtils]: Spent 19.06s on a formula simplification. DAG size of input: 93 DAG size of output: 98 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:39:17,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:39:20,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:39:23,396 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 ((_ zero_extend 24) c_~var_1_1~0))) (let ((.cse14 (bvneg .cse13)) (.cse20 ((_ zero_extend 24) c_~var_1_7~0))) (let ((.cse18 (= (_ bv0 8) c_~var_1_2~0)) (.cse6 ((_ sign_extend 16) c_~var_1_5~0)) (.cse45 (bvadd .cse14 .cse20))) (let ((.cse21 (bvadd c_~var_1_8~0 .cse14)) (.cse37 (forall ((~var_1_6~0 (_ BitVec 16))) (bvsle (bvmul (bvmul ((_ sign_extend 16) ~var_1_6~0) .cse20) .cse20) .cse45))) (.cse7 (fp.eq c_~var_1_13~0 c_~var_1_13~0)) (.cse31 (bvadd (bvneg .cse20) .cse13)) (.cse47 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse49 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse6) .cse49))) (bvsle (bvmul (bvmul .cse49 .cse20) .cse20) .cse45))))) (.cse17 (= .cse13 .cse20)) (.cse22 (not .cse18))) (let ((.cse4 (bvslt .cse13 .cse6)) (.cse39 (or (and (or .cse17 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse48 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse6) .cse48)) (bvsle (bvmul (bvmul .cse48 .cse20) .cse20) .cse45))))) (or .cse47 .cse17)) .cse22)) (.cse40 (or .cse47 .cse17 .cse18)) (.cse2 (bvslt .cse20 .cse13)) (.cse36 (= .cse31 .cse20)) (.cse34 (or .cse47 .cse18)) (.cse35 (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse44 ((_ sign_extend 16) ~var_1_6~0))) (or (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse6) .cse44)))) (bvsle (bvmul (bvmul .cse44 .cse20) .cse20) .cse45)))) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse46 ((_ sign_extend 16) ~var_1_6~0))) (or (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse6) .cse46))) (bvsle (bvmul (bvmul .cse46 .cse20) .cse20) .cse45))))) .cse22)) (.cse38 (or .cse37 .cse7)) (.cse29 (= c_~var_1_8~0 .cse20)) (.cse15 (forall ((~var_1_6~0 (_ BitVec 16))) (bvsle (bvmul (bvmul c_~var_1_8~0 ((_ sign_extend 16) ~var_1_6~0)) .cse20) .cse21)))) (let ((.cse8 (or .cse29 .cse15)) (.cse10 (or .cse15 .cse7)) (.cse16 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse43 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse6) .cse43))) (bvsle (bvmul (bvmul c_~var_1_8~0 .cse43) .cse20) .cse21))))) (.cse0 (and (or (let ((.cse41 (bvsle .cse6 (bvmul (_ bv2 32) .cse20))) (.cse42 (and .cse34 .cse35))) (and (or (not .cse41) .cse42) .cse38 (or .cse41 .cse42))) .cse36) (or (not .cse36) (and .cse34 .cse35 .cse38)))) (.cse1 (not .cse2)) (.cse3 (and .cse39 .cse38 .cse40)) (.cse12 (not .cse4))) (and (or (and (or .cse0 .cse1) (or .cse2 .cse3)) .cse4) (or (forall ((~var_1_7~0 (_ BitVec 8)) (~var_1_6~0 (_ BitVec 16))) (let ((.cse5 ((_ zero_extend 24) ~var_1_7~0))) (or (bvsle (bvmul .cse5 (bvmul .cse5 ((_ sign_extend 16) ~var_1_6~0))) (bvadd (bvneg .cse5) .cse5)) (bvslt .cse5 .cse6)))) .cse7) (or .cse2 (let ((.cse9 (or (and (or .cse17 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse19 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsle (bvmul (bvmul c_~var_1_8~0 .cse19) .cse20) .cse21) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse6) .cse19)))))) (or .cse16 .cse17)) .cse22)) (.cse11 (or .cse16 .cse17 .cse18))) (and (or (and .cse8 .cse9 .cse10 .cse11) .cse4) (or .cse12 (and .cse9 .cse10 (or (= c_~var_1_8~0 (bvadd .cse13 .cse14)) .cse15) .cse11))))) (or .cse1 (let ((.cse26 (or .cse16 .cse18)) (.cse27 (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse32 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsle (bvmul (bvmul c_~var_1_8~0 .cse32) .cse20) .cse21) (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse6) .cse32))))))) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse33 ((_ sign_extend 16) ~var_1_6~0))) (or (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse6) .cse33))) (bvsle (bvmul (bvmul c_~var_1_8~0 .cse33) .cse20) .cse21))))) .cse22))) (let ((.cse28 (and .cse26 .cse27)) (.cse30 (bvsle .cse6 (bvmul (_ bv2 32) c_~var_1_8~0)))) (let ((.cse25 (= c_~var_1_8~0 .cse31)) (.cse23 (or .cse28 .cse30)) (.cse24 (or (not .cse30) .cse28))) (and (or (and (or (and .cse8 .cse10 .cse23 .cse24) .cse25) (or (not .cse25) (and .cse8 .cse26 .cse27 .cse10))) .cse4) (or .cse12 (and (or .cse28 (not .cse29)) .cse10 (or .cse15 .cse25) (or .cse29 (and .cse23 .cse24))))))))) (or (and (or (and (or .cse0 .cse4) (or (and .cse34 .cse35 (or .cse36 .cse37) .cse38) .cse12)) .cse1) (or .cse2 (and (or .cse3 .cse4) (or .cse12 (and .cse39 .cse37 .cse38 .cse40))))) (bvslt ((_ zero_extend 24) |c_ULTIMATE.start_step_~stepLocal_1~0#1|) .cse6))))))))) is different from false [2024-11-14 04:39:28,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:39:29,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:39:32,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:39:34,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:39:42,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:39:44,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:39:45,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:39:47,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:39:52,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:39:55,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:39:56,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:39:58,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:39:59,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:40:02,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:40:05,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:40:36,372 WARN L286 SmtUtils]: Spent 24.26s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:40:38,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:40:41,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:40:44,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:40:46,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:41:21,514 WARN L286 SmtUtils]: Spent 27.49s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:41:23,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:41:25,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:41:27,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:41:30,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:41:32,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:41:34,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:41:36,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:41:38,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:41:41,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:41:43,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:41:45,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:41:47,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:41:50,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:41:51,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:41:51,876 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2024-11-14 04:41:51,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 04:41:51,879 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2024-11-14 04:41:51,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:41:51,880 INFO L225 Difference]: With dead ends: 90 [2024-11-14 04:41:51,880 INFO L226 Difference]: Without dead ends: 88 [2024-11-14 04:41:51,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 241.1s TimeCoverageRelationStatistics Valid=151, Invalid=711, Unknown=12, NotChecked=56, Total=930 [2024-11-14 04:41:51,882 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 106 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 14 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 131.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 139.4s IncrementalHoareTripleChecker+Time [2024-11-14 04:41:51,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 219 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 311 Invalid, 16 Unknown, 21 Unchecked, 139.4s Time] [2024-11-14 04:41:51,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-14 04:41:51,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 66. [2024-11-14 04:41:51,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-14 04:41:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2024-11-14 04:41:51,896 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 74 [2024-11-14 04:41:51,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:41:51,896 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2024-11-14 04:41:51,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 04:41:51,897 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2024-11-14 04:41:51,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-14 04:41:51,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:41:51,898 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] [2024-11-14 04:41:51,904 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-14 04:41:52,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:41:52,099 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:41:52,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:41:52,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1391229201, now seen corresponding path program 1 times [2024-11-14 04:41:52,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:41:52,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255673522] [2024-11-14 04:41:52,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:41:52,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:41:52,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:41:52,103 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:41:52,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-14 04:41:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:41:52,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 04:41:52,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:41:53,594 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 114 proven. 18 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-14 04:41:53,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:41:54,683 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-14 04:41:54,683 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:41:54,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255673522] [2024-11-14 04:41:54,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255673522] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 04:41:54,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:41:54,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-11-14 04:41:54,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833207769] [2024-11-14 04:41:54,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:41:54,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:41:54,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:41:54,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:41:54,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-14 04:41:54,685 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-14 04:41:56,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:41:56,475 INFO L93 Difference]: Finished difference Result 190 states and 237 transitions. [2024-11-14 04:41:56,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:41:56,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 74 [2024-11-14 04:41:56,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:41:56,479 INFO L225 Difference]: With dead ends: 190 [2024-11-14 04:41:56,479 INFO L226 Difference]: Without dead ends: 127 [2024-11-14 04:41:56,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-14 04:41:56,481 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 70 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:41:56,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 161 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-14 04:41:56,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-14 04:41:56,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 59. [2024-11-14 04:41:56,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 04:41:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2024-11-14 04:41:56,494 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 74 [2024-11-14 04:41:56,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:41:56,494 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2024-11-14 04:41:56,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-14 04:41:56,495 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2024-11-14 04:41:56,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-14 04:41:56,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:41:56,499 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] [2024-11-14 04:41:56,508 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-14 04:41:56,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:41:56,700 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:41:56,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:41:56,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1393076243, now seen corresponding path program 1 times [2024-11-14 04:41:56,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:41:56,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120073726] [2024-11-14 04:41:56,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:41:56,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:41:56,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:41:56,702 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:41:56,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-14 04:41:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:41:56,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-14 04:41:56,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:42:01,764 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 114 proven. 18 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-14 04:42:01,764 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:42:28,894 WARN L286 SmtUtils]: Spent 11.53s on a formula simplification. DAG size of input: 64 DAG size of output: 63 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:42:38,986 WARN L286 SmtUtils]: Spent 5.31s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:43:02,486 WARN L286 SmtUtils]: Spent 9.72s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:43:46,563 WARN L286 SmtUtils]: Spent 25.77s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:44:08,661 WARN L286 SmtUtils]: Spent 6.76s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:44:09,185 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-14 04:44:09,185 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:44:09,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120073726] [2024-11-14 04:44:09,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120073726] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 04:44:09,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:44:09,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2024-11-14 04:44:09,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147258384] [2024-11-14 04:44:09,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:44:09,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 04:44:09,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:44:09,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 04:44:09,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=244, Unknown=5, NotChecked=0, Total=306 [2024-11-14 04:44:09,187 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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-14 04:44:11,506 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ zero_extend 24) c_~var_1_7~0)) (.cse46 ((_ zero_extend 24) c_~var_1_1~0))) (let ((.cse39 (bvneg .cse46)) (.cse47 (bvneg .cse3)) (.cse24 (= (_ bv0 8) c_~var_1_2~0))) (let ((.cse23 (not .cse24)) (.cse2 (bvadd .cse47 .cse46)) (.cse4 (bvadd .cse47 .cse46 .cse39)) (.cse40 (bvadd .cse46 .cse39)) (.cse43 (bvadd .cse46 (bvmul (_ bv2 32) .cse39))) (.cse0 ((_ sign_extend 16) c_~var_1_5~0))) (let ((.cse25 (bvslt .cse3 .cse46)) (.cse16 (= c_~var_1_8~0 .cse3)) (.cse6 (bvslt .cse46 .cse0)) (.cse26 (= .cse46 .cse3)) (.cse41 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse51 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse51))) (not (bvsle (bvmul .cse3 (bvmul .cse51 .cse40)) .cse43)))))) (.cse1 (or (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse50 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse50))) (not (bvsle (bvmul (bvmul .cse2 .cse50) .cse3) .cse4))))) .cse24)) (.cse5 (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse48 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul .cse2 .cse48) .cse3) .cse4)) (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse48))))))) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse49 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul .cse2 .cse49) .cse3) .cse4)) (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse49))))))) .cse23))) (let ((.cse10 (bvsle .cse0 (bvadd (bvmul (_ bv2 32) .cse46) (bvmul (_ bv2 32) .cse47)))) (.cse8 (let ((.cse44 (= .cse2 .cse3)) (.cse45 (and .cse1 .cse5))) (and (or .cse44 .cse45) (or (not .cse44) .cse45)))) (.cse11 (or (and (or .cse26 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse42 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul .cse3 (bvmul .cse42 .cse40)) .cse43)) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse42)))))) (or .cse26 .cse41)) .cse23)) (.cse12 (or .cse26 .cse41 .cse24)) (.cse7 (not .cse6)) (.cse19 (not .cse16)) (.cse20 (= c_~var_1_8~0 .cse2)) (.cse9 (not .cse25)) (.cse27 (= c_~var_1_8~0 .cse40)) (.cse29 (bvadd c_~var_1_8~0 .cse39)) (.cse13 (bvsle .cse0 (bvmul (_ bv2 32) c_~var_1_8~0)))) (and (or (not (bvslt ((_ zero_extend 24) |c_ULTIMATE.start_step_~stepLocal_1~0#1|) .cse0)) (and (or (and (or (and .cse1 (forall ((~var_1_6~0 (_ BitVec 16))) (not (bvsle (bvmul (bvmul .cse2 ((_ sign_extend 16) ~var_1_6~0)) .cse3) .cse4))) .cse5) .cse6) (or .cse7 .cse8)) .cse9 .cse10) .cse11 .cse12)) (or .cse13 (let ((.cse28 ((_ sign_extend 16) c_~var_1_6~0))) (let ((.cse21 (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse28)))) (.cse14 (bvsle (bvmul (bvmul c_~var_1_8~0 .cse28) .cse3) .cse29)) (.cse22 (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse28)))))) (and (or (let ((.cse15 (or .cse22 .cse24)) (.cse17 (or (and .cse21 .cse22) .cse23))) (and .cse14 (or .cse6 (and .cse15 .cse16 .cse17)) (or .cse7 (let ((.cse18 (and .cse15 .cse17))) (and (or .cse16 .cse18) (or .cse19 .cse18) .cse20))))) .cse9) (or .cse25 (and (or .cse23 (and (or .cse26 .cse22) (or .cse26 .cse21))) .cse14 .cse27 (or .cse26 .cse22 .cse24))))))) (or .cse7 (and (or .cse9 .cse10 .cse8) .cse11 .cse12)) (or (let ((.cse30 (forall ((~var_1_6~0 (_ BitVec 16))) (not (bvsle (bvmul (bvmul c_~var_1_8~0 ((_ sign_extend 16) ~var_1_6~0)) .cse3) .cse29)))) (.cse34 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse38 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse38))) (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse38) .cse3) .cse29))))))) (and (or (let ((.cse31 (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse35 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse35) .cse3) .cse29)) (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse35))))))) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse36 ((_ sign_extend 16) ~var_1_6~0))) (or (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse36))) (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse36) .cse3) .cse29)))))) .cse23)) (.cse32 (or .cse34 .cse24))) (and (or (and (or .cse30 .cse16) .cse31 .cse32) .cse6) (or .cse7 (let ((.cse33 (and .cse31 .cse32))) (and (or .cse19 .cse33) (or .cse30 .cse20) (or .cse16 .cse33)))))) .cse9) (or .cse25 (and (or .cse30 .cse27) (or .cse34 .cse26 .cse24) (or (and (or .cse26 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse37 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse37) .cse3) .cse29)) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse37)))))) (or .cse34 .cse26)) .cse23))))) .cse13))))))) is different from true [2024-11-14 04:44:13,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:44:17,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:44:22,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:44:25,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:44:31,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:44:36,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:44:40,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:44:41,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:45:07,214 WARN L286 SmtUtils]: Spent 22.08s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:45:08,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:45:11,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:45:54,410 WARN L286 SmtUtils]: Spent 35.10s on a formula simplification that was a NOOP. DAG size: 129 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:45:56,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:45:59,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:46:00,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:46:01,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:46:03,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:46:05,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:46:07,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:46:11,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:46:13,947 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse22 ((_ zero_extend 24) c_~var_1_1~0)) (.cse20 ((_ zero_extend 24) c_~var_1_7~0))) (let ((.cse18 ((_ sign_extend 16) c_~var_1_5~0)) (.cse23 (bvneg .cse20)) (.cse31 (bvneg .cse22))) (let ((.cse13 (= (_ bv0 8) c_~var_1_2~0)) (.cse33 (bvadd .cse22 .cse31)) (.cse15 (bvslt .cse20 .cse22)) (.cse27 (bvadd .cse23 .cse22)) (.cse4 (= c_~var_1_8~0 .cse20)) (.cse2 (bvslt .cse22 .cse18))) (let ((.cse6 (not .cse2)) (.cse8 (not .cse4)) (.cse9 (= c_~var_1_8~0 .cse27)) (.cse14 (not .cse15)) (.cse17 (= c_~var_1_8~0 .cse33)) (.cse16 (= .cse22 .cse20)) (.cse12 (not .cse13)) (.cse21 (bvadd c_~var_1_8~0 .cse31)) (.cse0 (bvsle .cse18 (bvmul (_ bv2 32) c_~var_1_8~0)))) (and (or .cse0 (let ((.cse19 ((_ sign_extend 16) c_~var_1_6~0))) (let ((.cse10 (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse18) .cse19)))) (.cse1 (bvsle (bvmul (bvmul c_~var_1_8~0 .cse19) .cse20) .cse21)) (.cse11 (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse18) .cse19)))))) (and (or (let ((.cse3 (or .cse11 .cse13)) (.cse5 (or (and .cse10 .cse11) .cse12))) (and .cse1 (or .cse2 (and .cse3 .cse4 .cse5)) (or .cse6 (let ((.cse7 (and .cse3 .cse5))) (and (or .cse4 .cse7) (or .cse8 .cse7) .cse9))))) .cse14) (or .cse15 (and (or .cse12 (and (or .cse16 .cse11) (or .cse16 .cse10))) .cse1 .cse17 (or .cse16 .cse11 .cse13))))))) (or .cse6 (let ((.cse34 (bvadd .cse22 (bvmul (_ bv2 32) .cse31)))) (let ((.cse35 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse36 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse18) .cse36))) (not (bvsle (bvmul .cse20 (bvmul .cse36 .cse33)) .cse34))))))) (and (or .cse14 (bvsle .cse18 (bvadd (bvmul (_ bv2 32) .cse22) (bvmul (_ bv2 32) .cse23))) (let ((.cse24 (= .cse27 .cse20)) (.cse25 (let ((.cse28 (bvadd .cse23 .cse22 .cse31))) (and (or (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse26 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse18) .cse26))) (not (bvsle (bvmul (bvmul .cse27 .cse26) .cse20) .cse28))))) .cse13) (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse29 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul .cse27 .cse29) .cse20) .cse28)) (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse18) .cse29))))))) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse30 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul .cse27 .cse30) .cse20) .cse28)) (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse18) .cse30))))))) .cse12))))) (and (or .cse24 .cse25) (or (not .cse24) .cse25)))) (or (and (or .cse16 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse32 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul .cse20 (bvmul .cse32 .cse33)) .cse34)) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse18) .cse32)))))) (or .cse16 .cse35)) .cse12) (or .cse16 .cse35 .cse13))))) (or (let ((.cse37 (forall ((~var_1_6~0 (_ BitVec 16))) (not (bvsle (bvmul (bvmul c_~var_1_8~0 ((_ sign_extend 16) ~var_1_6~0)) .cse20) .cse21)))) (.cse41 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse45 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse18) .cse45))) (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse45) .cse20) .cse21))))))) (and (or (let ((.cse38 (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse42 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse42) .cse20) .cse21)) (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse18) .cse42))))))) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse43 ((_ sign_extend 16) ~var_1_6~0))) (or (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse18) .cse43))) (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse43) .cse20) .cse21)))))) .cse12)) (.cse39 (or .cse41 .cse13))) (and (or (and (or .cse37 .cse4) .cse38 .cse39) .cse2) (or .cse6 (let ((.cse40 (and .cse38 .cse39))) (and (or .cse8 .cse40) (or .cse37 .cse9) (or .cse4 .cse40)))))) .cse14) (or .cse15 (and (or .cse37 .cse17) (or .cse41 .cse16 .cse13) (or (and (or .cse16 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse44 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse44) .cse20) .cse21)) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse18) .cse44)))))) (or .cse41 .cse16)) .cse12))))) .cse0)))))) is different from true [2024-11-14 04:46:16,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:46:18,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:46:21,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:46:23,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:47:11,845 WARN L286 SmtUtils]: Spent 41.10s on a formula simplification. DAG size of input: 96 DAG size of output: 127 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:47:12,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:47:15,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:47:16,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:47:18,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:47:19,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:47:22,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:47:24,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:47:25,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:47:46,983 WARN L286 SmtUtils]: Spent 7.46s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:47:50,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:47:51,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:47:54,361 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ sign_extend 16) c_~var_1_5~0)) (.cse9 ((_ zero_extend 24) c_~var_1_7~0)) (.cse3 ((_ zero_extend 24) c_~var_1_1~0))) (let ((.cse11 (= (_ bv0 8) c_~var_1_2~0)) (.cse15 (bvneg .cse3)) (.cse32 (bvslt .cse9 .cse3)) (.cse4 (bvneg .cse9)) (.cse26 (bvslt .cse3 .cse2))) (let ((.cse0 (not .cse26)) (.cse8 (bvadd .cse4 .cse3)) (.cse1 (not .cse32)) (.cse18 (bvadd .cse3 .cse15)) (.cse16 (= .cse3 .cse9)) (.cse14 (not .cse11))) (and (or .cse0 (let ((.cse19 (bvadd .cse3 (bvmul (_ bv2 32) .cse15)))) (let ((.cse20 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse21 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse2) .cse21))) (not (bvsle (bvmul .cse9 (bvmul .cse21 .cse18)) .cse19))))))) (and (or .cse1 (bvsle .cse2 (bvadd (bvmul (_ bv2 32) .cse3) (bvmul (_ bv2 32) .cse4))) (let ((.cse5 (= .cse8 .cse9)) (.cse6 (let ((.cse10 (bvadd .cse4 .cse3 .cse15))) (and (or (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse7 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse2) .cse7))) (not (bvsle (bvmul (bvmul .cse8 .cse7) .cse9) .cse10))))) .cse11) (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse12 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul .cse8 .cse12) .cse9) .cse10)) (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse2) .cse12))))))) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse13 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul .cse8 .cse13) .cse9) .cse10)) (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse2) .cse13))))))) .cse14))))) (and (or .cse5 .cse6) (or (not .cse5) .cse6)))) (or (and (or .cse16 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse17 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul .cse9 (bvmul .cse17 .cse18)) .cse19)) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse2) .cse17)))))) (or .cse16 .cse20)) .cse14) (or .cse16 .cse20 .cse11))))) (or (let ((.cse30 (bvadd c_~var_1_8~0 .cse15))) (let ((.cse22 (forall ((~var_1_6~0 (_ BitVec 16))) (not (bvsle (bvmul (bvmul c_~var_1_8~0 ((_ sign_extend 16) ~var_1_6~0)) .cse9) .cse30)))) (.cse28 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse34 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse2) .cse34))) (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse34) .cse9) .cse30))))))) (and (or (let ((.cse23 (= c_~var_1_8~0 .cse9)) (.cse24 (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse29 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse29) .cse9) .cse30)) (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse2) .cse29))))))) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse31 ((_ sign_extend 16) ~var_1_6~0))) (or (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse2) .cse31))) (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse31) .cse9) .cse30)))))) .cse14)) (.cse25 (or .cse28 .cse11))) (and (or (and (or .cse22 .cse23) .cse24 .cse25) .cse26) (or .cse0 (let ((.cse27 (and .cse24 .cse25))) (and (or (not .cse23) .cse27) (or .cse22 (= c_~var_1_8~0 .cse8)) (or .cse23 .cse27)))))) .cse1) (or .cse32 (and (or .cse22 (= c_~var_1_8~0 .cse18)) (or .cse28 .cse16 .cse11) (or (and (or .cse16 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse33 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse33) .cse9) .cse30)) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse2) .cse33)))))) (or .cse28 .cse16)) .cse14)))))) (bvsle .cse2 (bvmul (_ bv2 32) c_~var_1_8~0))))))) is different from true [2024-11-14 04:47:55,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:47:58,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:48:00,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:48:02,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:48:26,231 WARN L286 SmtUtils]: Spent 8.72s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:48:28,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:48:30,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:48:32,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:48:35,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:48:37,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:48:39,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:48:40,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:48:43,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:48:45,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:48:47,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:48:50,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:48:52,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:48:53,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:48:55,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:48:57,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:48:59,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:49:01,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:49:04,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:49:05,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:49:07,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:49:08,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:49:10,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:49:11,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:49:11,696 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2024-11-14 04:49:11,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 04:49:11,798 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 74 [2024-11-14 04:49:11,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:49:11,800 INFO L225 Difference]: With dead ends: 91 [2024-11-14 04:49:11,800 INFO L226 Difference]: Without dead ends: 89 [2024-11-14 04:49:11,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 260.8s TimeCoverageRelationStatistics Valid=96, Invalid=400, Unknown=22, NotChecked=132, Total=650 [2024-11-14 04:49:11,802 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 46 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 12 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 129.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 138.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:49:11,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 297 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 183 Invalid, 28 Unknown, 29 Unchecked, 138.2s Time] [2024-11-14 04:49:11,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-14 04:49:11,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2024-11-14 04:49:11,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 04:49:11,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2024-11-14 04:49:11,819 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 74 [2024-11-14 04:49:11,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:49:11,819 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2024-11-14 04:49:11,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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-14 04:49:11,820 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2024-11-14 04:49:11,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-14 04:49:11,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:49:11,821 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] [2024-11-14 04:49:11,831 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-14 04:49:12,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:49:12,022 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:49:12,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:49:12,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1627650577, now seen corresponding path program 1 times [2024-11-14 04:49:12,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:49:12,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676985019] [2024-11-14 04:49:12,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:49:12,023 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:49:12,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:49:12,026 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:49:12,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53125025-27db-4e4c-8ad8-02b640e4060c/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-14 04:49:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:49:12,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 04:49:12,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:49:23,549 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-14 04:49:23,550 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:49:23,550 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:49:23,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676985019] [2024-11-14 04:49:23,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676985019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:49:23,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:49:23,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-14 04:49:23,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001773467] [2024-11-14 04:49:23,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:49:23,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 04:49:23,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:49:23,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 04:49:23,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-14 04:49:23,554 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11)