./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_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_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/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_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-30.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/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_5cb43066-1977-477f-8db0-62e235f5cf41/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 0c9ac74b48c7165afb9f2b624d9d9a4575a37c69f2655e95ac9683bba5876265 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 02:43:52,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 02:43:52,358 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 02:43:52,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 02:43:52,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 02:43:52,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 02:43:52,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 02:43:52,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 02:43:52,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 02:43:52,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 02:43:52,409 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 02:43:52,409 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 02:43:52,410 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 02:43:52,410 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 02:43:52,410 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 02:43:52,410 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 02:43:52,410 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 02:43:52,410 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 02:43:52,410 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 02:43:52,411 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 02:43:52,411 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 02:43:52,411 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 02:43:52,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 02:43:52,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 02:43:52,412 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 02:43:52,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 02:43:52,413 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 02:43:52,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 02:43:52,413 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 02:43:52,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 02:43:52,413 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 02:43:52,413 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 02:43:52,413 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 02:43:52,413 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 02:43:52,414 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 02:43:52,414 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 02:43:52,414 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 02:43:52,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 02:43:52,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 02:43:52,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 02:43:52,414 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 02:43:52,414 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 02:43:52,414 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 02:43:52,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 02:43:52,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 02:43:52,415 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 02:43:52,415 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 02:43:52,415 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_5cb43066-1977-477f-8db0-62e235f5cf41/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 -> 0c9ac74b48c7165afb9f2b624d9d9a4575a37c69f2655e95ac9683bba5876265 [2024-11-14 02:43:52,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 02:43:52,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 02:43:52,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 02:43:52,768 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 02:43:52,768 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 02:43:52,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-30.i Unable to find full path for "g++" [2024-11-14 02:43:54,665 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 02:43:54,943 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 02:43:54,944 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-30.i [2024-11-14 02:43:54,953 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/data/3b2a48734/9daf7eee67384655bd6f1b2a3b9872b0/FLAG0e43d18a5 [2024-11-14 02:43:54,981 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/data/3b2a48734/9daf7eee67384655bd6f1b2a3b9872b0 [2024-11-14 02:43:54,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 02:43:54,986 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 02:43:54,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 02:43:54,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 02:43:54,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 02:43:54,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:43:54" (1/1) ... [2024-11-14 02:43:54,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@935e041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:54, skipping insertion in model container [2024-11-14 02:43:54,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:43:54" (1/1) ... [2024-11-14 02:43:55,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 02:43:55,196 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_5cb43066-1977-477f-8db0-62e235f5cf41/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-30.i[915,928] [2024-11-14 02:43:55,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 02:43:55,271 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 02:43:55,282 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_5cb43066-1977-477f-8db0-62e235f5cf41/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-30.i[915,928] [2024-11-14 02:43:55,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 02:43:55,318 INFO L204 MainTranslator]: Completed translation [2024-11-14 02:43:55,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:55 WrapperNode [2024-11-14 02:43:55,318 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 02:43:55,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 02:43:55,319 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 02:43:55,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 02:43:55,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:55" (1/1) ... [2024-11-14 02:43:55,334 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:55" (1/1) ... [2024-11-14 02:43:55,363 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-11-14 02:43:55,363 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 02:43:55,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 02:43:55,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 02:43:55,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 02:43:55,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:55" (1/1) ... [2024-11-14 02:43:55,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:55" (1/1) ... [2024-11-14 02:43:55,374 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:55" (1/1) ... [2024-11-14 02:43:55,375 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:55" (1/1) ... [2024-11-14 02:43:55,380 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:55" (1/1) ... [2024-11-14 02:43:55,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:55" (1/1) ... [2024-11-14 02:43:55,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:55" (1/1) ... [2024-11-14 02:43:55,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:55" (1/1) ... [2024-11-14 02:43:55,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 02:43:55,396 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 02:43:55,396 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 02:43:55,396 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 02:43:55,397 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:55" (1/1) ... [2024-11-14 02:43:55,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 02:43:55,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:43:55,448 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 02:43:55,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 02:43:55,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 02:43:55,481 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 02:43:55,481 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 02:43:55,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 02:43:55,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 02:43:55,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 02:43:55,548 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 02:43:55,550 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 02:43:55,901 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-14 02:43:55,901 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 02:43:56,077 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 02:43:56,078 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 02:43:56,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:43:56 BoogieIcfgContainer [2024-11-14 02:43:56,078 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 02:43:56,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 02:43:56,082 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 02:43:56,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 02:43:56,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 02:43:54" (1/3) ... [2024-11-14 02:43:56,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e1c40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:43:56, skipping insertion in model container [2024-11-14 02:43:56,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:55" (2/3) ... [2024-11-14 02:43:56,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e1c40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:43:56, skipping insertion in model container [2024-11-14 02:43:56,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:43:56" (3/3) ... [2024-11-14 02:43:56,092 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-30.i [2024-11-14 02:43:56,111 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 02:43:56,112 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-30.i that has 2 procedures, 25 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 02:43:56,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 02:43:56,175 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;@5a5cd140, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 02:43:56,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 02:43:56,180 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 02:43:56,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-14 02:43:56,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:43:56,189 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 02:43:56,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:43:56,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:43:56,194 INFO L85 PathProgramCache]: Analyzing trace with hash 868471729, now seen corresponding path program 1 times [2024-11-14 02:43:56,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:43:56,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910984746] [2024-11-14 02:43:56,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:43:56,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:43:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-14 02:43:56,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1887851192] [2024-11-14 02:43:56,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:43:56,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:43:56,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:43:56,482 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:43:56,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 02:43:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 02:43:56,677 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 02:43:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 02:43:56,786 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 02:43:56,788 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 02:43:56,790 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 02:43:56,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 02:43:56,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:43:56,997 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-14 02:43:57,042 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 02:43:57,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 02:43:57 BoogieIcfgContainer [2024-11-14 02:43:57,045 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 02:43:57,046 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 02:43:57,046 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 02:43:57,046 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 02:43:57,047 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:43:56" (3/4) ... [2024-11-14 02:43:57,049 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 02:43:57,050 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 02:43:57,052 INFO L158 Benchmark]: Toolchain (without parser) took 2065.97ms. Allocated memory is still 117.4MB. Free memory was 94.1MB in the beginning and 79.2MB in the end (delta: 14.9MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2024-11-14 02:43:57,052 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 167.8MB. Free memory is still 103.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 02:43:57,052 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.34ms. Allocated memory is still 117.4MB. Free memory was 94.1MB in the beginning and 81.9MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 02:43:57,053 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.62ms. Allocated memory is still 117.4MB. Free memory was 81.9MB in the beginning and 80.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 02:43:57,053 INFO L158 Benchmark]: Boogie Preprocessor took 31.58ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 78.7MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 02:43:57,054 INFO L158 Benchmark]: RCFGBuilder took 681.88ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 55.8MB in the end (delta: 23.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 02:43:57,054 INFO L158 Benchmark]: TraceAbstraction took 963.93ms. Allocated memory is still 117.4MB. Free memory was 55.4MB in the beginning and 79.3MB in the end (delta: -23.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 02:43:57,054 INFO L158 Benchmark]: Witness Printer took 4.42ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 79.2MB in the end (delta: 21.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 02:43:57,057 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.43ms. Allocated memory is still 167.8MB. Free memory is still 103.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.34ms. Allocated memory is still 117.4MB. Free memory was 94.1MB in the beginning and 81.9MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.62ms. Allocated memory is still 117.4MB. Free memory was 81.9MB in the beginning and 80.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.58ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 78.7MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 681.88ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 55.8MB in the end (delta: 23.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 963.93ms. Allocated memory is still 117.4MB. Free memory was 55.4MB in the beginning and 79.3MB in the end (delta: -23.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.42ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 79.2MB in the end (delta: 21.0kB). 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] int k_loop; [L89] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=0, var_1_5=8, var_1_6=-32, var_1_7=100, var_1_8=32] [L89] COND TRUE k_loop < 1 [L90] CALL updateLastVariables() [L79] last_1_var_1_8 = var_1_8 [L90] RET updateLastVariables() [L91] 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=-255, 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=-255, 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=-255, 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=-255, 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=-255, 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=-255, 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=-255, 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=-255, 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=-255, 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=-255, 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=-255, 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=-255, 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=-255, 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=-255, 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=-255, 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=-255, 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=-255, 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=-255, 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=-255, 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=-255, var_1_5=1, var_1_6=33, var_1_7=-191, var_1_8=32] [L91] RET updateVariables() [L92] 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 FALSE !(((var_1_6 * var_1_8) * var_1_7) <= (var_1_8 - var_1_1)) [L53] COND TRUE var_1_1 >= var_1_1 [L54] var_1_10 = var_1_13 [L92] RET step() [L93] 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)))) ; [L93] RET, EXPR property() [L93] 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=-255, 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=-255, 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.3s 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 02:43:57,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/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_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-30.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/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_5cb43066-1977-477f-8db0-62e235f5cf41/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 0c9ac74b48c7165afb9f2b624d9d9a4575a37c69f2655e95ac9683bba5876265 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 02:43:59,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 02:43:59,862 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-14 02:43:59,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 02:43:59,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 02:43:59,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 02:43:59,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 02:43:59,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 02:43:59,912 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 02:43:59,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 02:43:59,913 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 02:43:59,914 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 02:43:59,914 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 02:43:59,914 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 02:43:59,914 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 02:43:59,914 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 02:43:59,915 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 02:43:59,915 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 02:43:59,916 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 02:43:59,916 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 02:43:59,916 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 02:43:59,916 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 02:43:59,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 02:43:59,916 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 02:43:59,916 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 02:43:59,916 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 02:43:59,916 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 02:43:59,917 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 02:43:59,917 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 02:43:59,917 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 02:43:59,917 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 02:43:59,917 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 02:43:59,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 02:43:59,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 02:43:59,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 02:43:59,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 02:43:59,919 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 02:43:59,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 02:43:59,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 02:43:59,919 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 02:43:59,919 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 02:43:59,920 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 02:43:59,920 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 02:43:59,920 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_5cb43066-1977-477f-8db0-62e235f5cf41/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 -> 0c9ac74b48c7165afb9f2b624d9d9a4575a37c69f2655e95ac9683bba5876265 [2024-11-14 02:44:00,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 02:44:00,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 02:44:00,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 02:44:00,256 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 02:44:00,257 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 02:44:00,258 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-30.i Unable to find full path for "g++" [2024-11-14 02:44:02,485 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 02:44:02,733 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 02:44:02,733 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-30.i [2024-11-14 02:44:02,743 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/data/b33f306c4/5fc823218ac04c948b7a8125383c4824/FLAG17ccbe966 [2024-11-14 02:44:02,760 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/data/b33f306c4/5fc823218ac04c948b7a8125383c4824 [2024-11-14 02:44:02,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 02:44:02,764 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 02:44:02,766 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 02:44:02,766 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 02:44:02,772 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 02:44:02,773 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:44:02" (1/1) ... [2024-11-14 02:44:02,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d77cda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:02, skipping insertion in model container [2024-11-14 02:44:02,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:44:02" (1/1) ... [2024-11-14 02:44:02,792 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 02:44:03,004 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_5cb43066-1977-477f-8db0-62e235f5cf41/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-30.i[915,928] [2024-11-14 02:44:03,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 02:44:03,091 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 02:44:03,109 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_5cb43066-1977-477f-8db0-62e235f5cf41/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-30.i[915,928] [2024-11-14 02:44:03,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 02:44:03,173 INFO L204 MainTranslator]: Completed translation [2024-11-14 02:44:03,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:03 WrapperNode [2024-11-14 02:44:03,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 02:44:03,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 02:44:03,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 02:44:03,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 02:44:03,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:03" (1/1) ... [2024-11-14 02:44:03,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:03" (1/1) ... [2024-11-14 02:44:03,232 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2024-11-14 02:44:03,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 02:44:03,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 02:44:03,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 02:44:03,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 02:44:03,244 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:03" (1/1) ... [2024-11-14 02:44:03,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:03" (1/1) ... [2024-11-14 02:44:03,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:03" (1/1) ... [2024-11-14 02:44:03,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:03" (1/1) ... [2024-11-14 02:44:03,269 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:03" (1/1) ... [2024-11-14 02:44:03,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:03" (1/1) ... [2024-11-14 02:44:03,280 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:03" (1/1) ... [2024-11-14 02:44:03,285 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:03" (1/1) ... [2024-11-14 02:44:03,288 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 02:44:03,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 02:44:03,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 02:44:03,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 02:44:03,295 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:03" (1/1) ... [2024-11-14 02:44:03,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 02:44:03,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:44:03,340 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 02:44:03,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 02:44:03,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 02:44:03,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 02:44:03,379 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 02:44:03,379 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 02:44:03,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 02:44:03,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 02:44:03,485 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 02:44:03,487 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 02:44:03,926 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-14 02:44:03,926 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 02:44:03,936 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 02:44:03,936 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 02:44:03,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:44:03 BoogieIcfgContainer [2024-11-14 02:44:03,937 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 02:44:03,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 02:44:03,940 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 02:44:03,945 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 02:44:03,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 02:44:02" (1/3) ... [2024-11-14 02:44:03,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae41263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:44:03, skipping insertion in model container [2024-11-14 02:44:03,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:44:03" (2/3) ... [2024-11-14 02:44:03,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae41263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:44:03, skipping insertion in model container [2024-11-14 02:44:03,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:44:03" (3/3) ... [2024-11-14 02:44:03,948 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-30.i [2024-11-14 02:44:03,963 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 02:44:03,965 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-30.i that has 2 procedures, 42 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 02:44:04,020 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 02:44:04,032 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;@4b0cec4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 02:44:04,033 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 02:44:04,037 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 02:44:04,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-14 02:44:04,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:44:04,047 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 02:44:04,047 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:44:04,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:44:04,052 INFO L85 PathProgramCache]: Analyzing trace with hash -224234091, now seen corresponding path program 1 times [2024-11-14 02:44:04,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 02:44:04,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442349317] [2024-11-14 02:44:04,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:44:04,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 02:44:04,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 02:44:04,067 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 02:44:04,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-14 02:44:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:44:04,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-14 02:44:04,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:44:04,400 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 02:44:04,401 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 02:44:04,401 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 02:44:04,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442349317] [2024-11-14 02:44:04,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442349317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:44:04,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:44:04,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 02:44:04,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426916315] [2024-11-14 02:44:04,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:44:04,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 02:44:04,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 02:44:04,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 02:44:04,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 02:44:04,440 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 02:44:04,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:44:04,462 INFO L93 Difference]: Finished difference Result 81 states and 130 transitions. [2024-11-14 02:44:04,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 02:44:04,464 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 02:44:04,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:44:04,470 INFO L225 Difference]: With dead ends: 81 [2024-11-14 02:44:04,471 INFO L226 Difference]: Without dead ends: 38 [2024-11-14 02:44:04,478 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 02:44:04,481 INFO L432 NwaCegarLoop]: 57 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, 57 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 02:44:04,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 02:44:04,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-14 02:44:04,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-14 02:44:04,510 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 02:44:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2024-11-14 02:44:04,516 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 74 [2024-11-14 02:44:04,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:44:04,517 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2024-11-14 02:44:04,517 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 02:44:04,517 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2024-11-14 02:44:04,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-14 02:44:04,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:44:04,520 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 02:44:04,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/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 02:44:04,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 02:44:04,721 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:44:04,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:44:04,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1128730733, now seen corresponding path program 1 times [2024-11-14 02:44:04,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 02:44:04,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136018366] [2024-11-14 02:44:04,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:44:04,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 02:44:04,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 02:44:04,725 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 02:44:04,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-14 02:44:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:44:05,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 02:44:05,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:44:14,337 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 02:44:14,338 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 02:44:14,338 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 02:44:14,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136018366] [2024-11-14 02:44:14,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136018366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:44:14,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:44:14,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-14 02:44:14,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021631569] [2024-11-14 02:44:14,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:44:14,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 02:44:14,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 02:44:14,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 02:44:14,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-14 02:44:14,345 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 02:44:21,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:44:21,031 INFO L93 Difference]: Finished difference Result 109 states and 144 transitions. [2024-11-14 02:44:21,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 02:44:21,035 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 02:44:21,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:44:21,037 INFO L225 Difference]: With dead ends: 109 [2024-11-14 02:44:21,037 INFO L226 Difference]: Without dead ends: 74 [2024-11-14 02:44:21,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2024-11-14 02:44:21,040 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 113 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-14 02:44:21,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 165 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-14 02:44:21,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-14 02:44:21,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 49. [2024-11-14 02:44:21,051 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 02:44:21,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2024-11-14 02:44:21,053 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 74 [2024-11-14 02:44:21,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:44:21,053 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2024-11-14 02:44:21,054 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 02:44:21,054 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2024-11-14 02:44:21,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-14 02:44:21,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:44:21,056 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 02:44:21,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-14 02:44:21,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 02:44:21,257 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:44:21,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:44:21,257 INFO L85 PathProgramCache]: Analyzing trace with hash -892309357, now seen corresponding path program 1 times [2024-11-14 02:44:21,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 02:44:21,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409463955] [2024-11-14 02:44:21,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:44:21,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 02:44:21,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 02:44:21,261 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 02:44:21,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-14 02:44:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:44:21,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 02:44:21,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:44:29,163 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 02:44:29,164 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:45:15,870 WARN L286 SmtUtils]: Spent 23.42s 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 02:46:01,271 WARN L286 SmtUtils]: Spent 24.82s 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 02:46:43,524 WARN L286 SmtUtils]: Spent 16.91s 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 02:47:19,079 WARN L286 SmtUtils]: Spent 19.87s 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 02:47:44,646 WARN L286 SmtUtils]: Spent 7.26s 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 02:47:59,150 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 02:47:59,150 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 02:47:59,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409463955] [2024-11-14 02:47:59,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [409463955] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 02:47:59,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 02:47:59,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [15] total 26 [2024-11-14 02:47:59,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256660768] [2024-11-14 02:47:59,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:47:59,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 02:47:59,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 02:47:59,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 02:47:59,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=526, Unknown=8, NotChecked=0, Total=650 [2024-11-14 02:47:59,153 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 02:48:03,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:48:07,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:48:43,368 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 02:48:51,382 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 02:48:52,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:49:06,605 WARN L286 SmtUtils]: Spent 7.92s 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 02:49:29,428 WARN L286 SmtUtils]: Spent 19.27s 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 02:49:30,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:49:33,171 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 02:50:23,029 WARN L286 SmtUtils]: Spent 39.83s on a formula simplification. DAG size of input: 150 DAG size of output: 155 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 02:50:24,189 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 02:50:27,178 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 02:50:33,958 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse63 ((_ zero_extend 24) c_~var_1_1~0))) (let ((.cse64 (bvneg .cse63)) (.cse39 ((_ zero_extend 24) c_~var_1_7~0))) (let ((.cse27 (= (_ bv0 8) c_~var_1_2~0)) (.cse29 ((_ sign_extend 16) c_~var_1_5~0)) (.cse67 (bvadd .cse64 .cse39))) (let ((.cse62 ((_ sign_extend 16) c_~var_1_6~0)) (.cse40 (bvadd c_~var_1_8~0 .cse64)) (.cse55 (forall ((~var_1_6~0 (_ BitVec 16))) (bvsle (bvmul (bvmul ((_ sign_extend 16) ~var_1_6~0) .cse39) .cse39) .cse67))) (.cse14 (fp.eq c_~var_1_13~0 c_~var_1_13~0)) (.cse65 (bvadd (bvneg .cse39) .cse63)) (.cse69 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse71 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse29) .cse71))) (bvsle (bvmul (bvmul .cse71 .cse39) .cse39) .cse67))))) (.cse37 (= .cse63 .cse39)) (.cse26 (not .cse27))) (let ((.cse4 (bvslt .cse63 .cse29)) (.cse57 (or (and (or .cse37 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse70 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse29) .cse70)) (bvsle (bvmul (bvmul .cse70 .cse39) .cse39) .cse67))))) (or .cse69 .cse37)) .cse26)) (.cse58 (or .cse69 .cse37 .cse27)) (.cse2 (bvslt .cse39 .cse63)) (.cse54 (= .cse65 .cse39)) (.cse52 (or .cse69 .cse27)) (.cse53 (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse66 ((_ 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 .cse29) .cse66)))) (bvsle (bvmul (bvmul .cse66 .cse39) .cse39) .cse67)))) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse68 ((_ 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 .cse29) .cse68))) (bvsle (bvmul (bvmul .cse68 .cse39) .cse39) .cse67))))) .cse26)) (.cse56 (or .cse55 .cse14)) (.cse23 (bvsle .cse29 (bvmul (_ bv2 32) c_~var_1_8~0))) (.cse7 (= c_~var_1_8~0 .cse39)) (.cse35 (forall ((~var_1_6~0 (_ BitVec 16))) (bvsle (bvmul (bvmul c_~var_1_8~0 ((_ sign_extend 16) ~var_1_6~0)) .cse39) .cse40))) (.cse6 (= c_~var_1_8~0 .cse65)) (.cse19 (bvsle (bvmul (bvmul c_~var_1_8~0 .cse62) .cse39) .cse40))) (let ((.cse18 (not .cse19)) (.cse10 (not .cse14)) (.cse34 (= c_~var_1_8~0 (bvadd .cse63 .cse64))) (.cse25 (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 .cse29) .cse62))))) (.cse24 (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse29) .cse62)))) (.cse20 (not .cse6)) (.cse30 (or .cse7 .cse35)) (.cse21 (not .cse7)) (.cse32 (or .cse35 .cse14)) (.cse12 (not .cse23)) (.cse36 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse61 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse29) .cse61))) (bvsle (bvmul (bvmul c_~var_1_8~0 .cse61) .cse39) .cse40))))) (.cse0 (and (or (let ((.cse59 (bvsle .cse29 (bvmul (_ bv2 32) .cse39))) (.cse60 (and .cse52 .cse53))) (and (or (not .cse59) .cse60) .cse56 (or .cse59 .cse60))) .cse54) (or (not .cse54) (and .cse52 .cse53 .cse56)))) (.cse1 (not .cse2)) (.cse3 (and .cse57 .cse56 .cse58)) (.cse15 (not .cse4))) (and (or (and (or .cse0 .cse1) (or .cse2 .cse3)) .cse4) (or .cse1 (let ((.cse11 (or .cse25 .cse27)) (.cse13 (or (and .cse24 .cse25) .cse26))) (let ((.cse22 (and .cse11 .cse13))) (let ((.cse8 (or .cse12 .cse22)) (.cse9 (or .cse23 .cse22))) (let ((.cse16 (or .cse21 .cse22)) (.cse17 (or .cse7 (and .cse8 .cse9))) (.cse5 (or (and .cse11 .cse7 .cse13 .cse14) .cse20))) (and (or (and (or (and .cse5 (or .cse6 (and (or (and .cse7 .cse8 .cse9) .cse10) (or (and .cse11 .cse7 .cse12 .cse13) .cse14)))) .cse4) (or .cse15 (and .cse6 (or (and .cse16 (or .cse7 (and .cse11 .cse12 .cse13))) .cse14) (or .cse10 (and .cse16 .cse17))))) .cse18) (or .cse19 (and (or .cse15 (and .cse16 .cse6 .cse14 .cse17)) (or (and (or .cse6 (and .cse7 .cse8 .cse14 .cse9)) .cse5) .cse4))))))))) (or (forall ((~var_1_7~0 (_ BitVec 8)) (~var_1_6~0 (_ BitVec 16))) (let ((.cse28 ((_ zero_extend 24) ~var_1_7~0))) (or (bvsle (bvmul .cse28 (bvmul .cse28 ((_ sign_extend 16) ~var_1_6~0))) (bvadd (bvneg .cse28) .cse28)) (bvslt .cse28 .cse29)))) .cse14) (or .cse2 (let ((.cse31 (or (and (or .cse37 (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 (bvsle (bvmul (bvmul c_~var_1_8~0 .cse38) .cse39) .cse40) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse29) .cse38)))))) (or .cse36 .cse37)) .cse26)) (.cse33 (or .cse36 .cse37 .cse27))) (and (or (and .cse30 .cse31 .cse32 .cse33) .cse4) (or .cse15 (and .cse31 .cse32 (or .cse34 .cse35) .cse33))))) (or .cse2 (let ((.cse42 (or .cse26 (and (or .cse37 .cse25) (or .cse37 .cse24)))) (.cse43 (or .cse37 .cse25 .cse27))) (let ((.cse44 (or .cse4 (and .cse7 .cse42 .cse43 .cse14)))) (and (or .cse18 (and (or .cse15 (let ((.cse41 (and .cse42 .cse43))) (and (or .cse14 .cse41) .cse34 (or .cse10 .cse41)))) .cse44)) (or .cse19 (and (or (and .cse42 .cse34 .cse43 .cse14) .cse15) .cse44)))))) (or .cse1 (let ((.cse47 (or .cse36 .cse27)) (.cse48 (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse50 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsle (bvmul (bvmul c_~var_1_8~0 .cse50) .cse39) .cse40) (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 .cse29) .cse50))))))) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse51 ((_ 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 .cse29) .cse51))) (bvsle (bvmul (bvmul c_~var_1_8~0 .cse51) .cse39) .cse40))))) .cse26))) (let ((.cse49 (and .cse47 .cse48))) (let ((.cse45 (or .cse49 .cse23)) (.cse46 (or .cse12 .cse49))) (and (or (and (or (and .cse30 .cse32 .cse45 .cse46) .cse6) (or .cse20 (and .cse30 .cse47 .cse48 .cse32))) .cse4) (or .cse15 (and (or .cse49 .cse21) .cse32 (or .cse35 .cse6) (or .cse7 (and .cse45 .cse46))))))))) (or (and (or (and (or .cse0 .cse4) (or (and .cse52 .cse53 (or .cse54 .cse55) .cse56) .cse15)) .cse1) (or .cse2 (and (or .cse3 .cse4) (or .cse15 (and .cse57 .cse55 .cse56 .cse58))))) (bvslt ((_ zero_extend 24) |c_ULTIMATE.start_step_~stepLocal_1~0#1|) .cse29))))))))) is different from true [2024-11-14 02:50:35,972 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 02:50:38,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:50:40,014 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 02:50:43,394 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 02:50:45,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:50:47,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:50:49,998 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 02:50:55,390 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 02:50:57,712 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse29 ((_ zero_extend 24) c_~var_1_1~0))) (let ((.cse21 (bvneg .cse29))) (let ((.cse33 (bvadd c_~var_1_8~0 .cse21)) (.cse6 ((_ zero_extend 24) c_~var_1_7~0)) (.cse5 ((_ sign_extend 16) c_~var_1_5~0))) (let ((.cse13 (= (_ bv0 8) c_~var_1_2~0)) (.cse20 (fp.eq c_~var_1_13~0 c_~var_1_13~0)) (.cse22 (bvslt .cse29 .cse5)) (.cse40 (= c_~var_1_8~0 .cse6)) (.cse30 (forall ((~var_1_6~0 (_ BitVec 16))) (bvsle (bvmul (bvmul c_~var_1_8~0 ((_ sign_extend 16) ~var_1_6~0)) .cse6) .cse33))) (.cse16 (bvslt .cse6 .cse29))) (let ((.cse17 (= .cse29 .cse6)) (.cse15 (not .cse16)) (.cse24 (or .cse40 .cse30)) (.cse28 (not .cse22)) (.cse26 (or .cse30 .cse20)) (.cse14 (bvadd (bvneg .cse6) .cse29)) (.cse11 (not .cse13)) (.cse31 (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 (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse5) .cse44))) (bvsle (bvmul (bvmul c_~var_1_8~0 .cse44) .cse6) .cse33)))))) (and (or (let ((.cse9 (bvadd .cse21 .cse6))) (let ((.cse2 (or (forall ((~var_1_6~0 (_ BitVec 16))) (bvsle (bvmul (bvmul ((_ sign_extend 16) ~var_1_6~0) .cse6) .cse6) .cse9)) .cse20)) (.cse12 (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 (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse5) .cse19))) (bvsle (bvmul (bvmul .cse19 .cse6) .cse6) .cse9)))))) (and (or (let ((.cse7 (= .cse14 .cse6)) (.cse3 (or .cse12 .cse13)) (.cse4 (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse8 ((_ 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 .cse5) .cse8)))) (bvsle (bvmul (bvmul .cse8 .cse6) .cse6) .cse9)))) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse10 ((_ 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 .cse5) .cse10))) (bvsle (bvmul (bvmul .cse10 .cse6) .cse6) .cse9))))) .cse11))) (and (or (let ((.cse0 (bvsle .cse5 (bvmul (_ bv2 32) .cse6))) (.cse1 (and .cse3 .cse4))) (and (or (not .cse0) .cse1) .cse2 (or .cse0 .cse1))) .cse7) (or (not .cse7) (and .cse3 .cse4 .cse2)))) .cse15) (or .cse16 (and (or (and (or .cse17 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse18 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse5) .cse18)) (bvsle (bvmul (bvmul .cse18 .cse6) .cse6) .cse9))))) (or .cse12 .cse17)) .cse11) .cse2 (or .cse12 .cse17 .cse13)))))) .cse22) (or (forall ((~var_1_7~0 (_ BitVec 8)) (~var_1_6~0 (_ BitVec 16))) (let ((.cse23 ((_ zero_extend 24) ~var_1_7~0))) (or (bvsle (bvmul .cse23 (bvmul .cse23 ((_ sign_extend 16) ~var_1_6~0))) (bvadd (bvneg .cse23) .cse23)) (bvslt .cse23 .cse5)))) .cse20) (or .cse16 (let ((.cse25 (or (and (or .cse17 (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 (bvsle (bvmul (bvmul c_~var_1_8~0 .cse32) .cse6) .cse33) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse5) .cse32)))))) (or .cse31 .cse17)) .cse11)) (.cse27 (or .cse31 .cse17 .cse13))) (and (or (and .cse24 .cse25 .cse26 .cse27) .cse22) (or .cse28 (and .cse25 .cse26 (or (= c_~var_1_8~0 (bvadd .cse29 .cse21)) .cse30) .cse27))))) (or .cse15 (let ((.cse37 (or .cse31 .cse13)) (.cse38 (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse42 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsle (bvmul (bvmul c_~var_1_8~0 .cse42) .cse6) .cse33) (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 .cse5) .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 .cse5) .cse43))) (bvsle (bvmul (bvmul c_~var_1_8~0 .cse43) .cse6) .cse33))))) .cse11))) (let ((.cse39 (and .cse37 .cse38)) (.cse41 (bvsle .cse5 (bvmul (_ bv2 32) c_~var_1_8~0)))) (let ((.cse36 (= c_~var_1_8~0 .cse14)) (.cse34 (or .cse39 .cse41)) (.cse35 (or (not .cse41) .cse39))) (and (or (and (or (and .cse24 .cse26 .cse34 .cse35) .cse36) (or (not .cse36) (and .cse24 .cse37 .cse38 .cse26))) .cse22) (or .cse28 (and (or .cse39 (not .cse40)) .cse26 (or .cse30 .cse36) (or .cse40 (and .cse34 .cse35))))))))))))))) is different from true [2024-11-14 02:51:00,294 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 02:51:01,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:51:03,950 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 02:51:36,191 WARN L286 SmtUtils]: Spent 25.13s 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 02:51:38,225 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 02:51:39,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:51:42,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:51:44,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:51:46,229 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 02:52:20,378 WARN L286 SmtUtils]: Spent 25.70s 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 02:52:23,015 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 02:52:24,902 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 02:52:27,043 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 02:52:29,178 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 02:52:31,240 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 02:52:33,671 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 02:52:36,713 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 02:52:38,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:52:39,333 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 02:52:41,372 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 02:52:43,966 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 02:52:46,143 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 02:52:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:52:48,156 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2024-11-14 02:52:48,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 02:52:48,158 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 02:52:48,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:52:48,160 INFO L225 Difference]: With dead ends: 90 [2024-11-14 02:52:48,160 INFO L226 Difference]: Without dead ends: 88 [2024-11-14 02:52:48,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 306.4s TimeCoverageRelationStatistics Valid=166, Invalid=756, Unknown=16, NotChecked=118, Total=1056 [2024-11-14 02:52:48,161 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 126 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 20 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 128.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 136.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:52:48,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 199 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 270 Invalid, 16 Unknown, 20 Unchecked, 136.1s Time] [2024-11-14 02:52:48,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-14 02:52:48,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 66. [2024-11-14 02:52:48,174 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 02:52:48,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2024-11-14 02:52:48,175 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 74 [2024-11-14 02:52:48,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:52:48,176 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2024-11-14 02:52:48,176 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 02:52:48,176 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2024-11-14 02:52:48,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-14 02:52:48,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:52:48,184 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 02:52:48,190 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-14 02:52:48,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 02:52:48,385 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:52:48,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:52:48,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1391229201, now seen corresponding path program 1 times [2024-11-14 02:52:48,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 02:52:48,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268119692] [2024-11-14 02:52:48,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:52:48,387 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 02:52:48,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 02:52:48,391 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 02:52:48,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/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 02:52:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:52:48,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 02:52:48,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:52:50,135 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 02:52:50,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:52:51,382 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 02:52:51,382 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 02:52:51,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268119692] [2024-11-14 02:52:51,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268119692] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 02:52:51,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 02:52:51,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-11-14 02:52:51,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509948433] [2024-11-14 02:52:51,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:52:51,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 02:52:51,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 02:52:51,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 02:52:51,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-14 02:52:51,384 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 02:52:53,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:52:53,466 INFO L93 Difference]: Finished difference Result 190 states and 237 transitions. [2024-11-14 02:52:53,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 02:52:53,467 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 02:52:53,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:52:53,470 INFO L225 Difference]: With dead ends: 190 [2024-11-14 02:52:53,470 INFO L226 Difference]: Without dead ends: 127 [2024-11-14 02:52:53,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-14 02:52:53,472 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 70 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-14 02:52:53,472 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.5s Time] [2024-11-14 02:52:53,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-14 02:52:53,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 59. [2024-11-14 02:52:53,485 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 02:52:53,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2024-11-14 02:52:53,486 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 74 [2024-11-14 02:52:53,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:52:53,487 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2024-11-14 02:52:53,487 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 02:52:53,487 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2024-11-14 02:52:53,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-14 02:52:53,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:52:53,489 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 02:52:53,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/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 02:52:53,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 02:52:53,689 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:52:53,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:52:53,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1393076243, now seen corresponding path program 1 times [2024-11-14 02:52:53,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 02:52:53,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854818151] [2024-11-14 02:52:53,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:52:53,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 02:52:53,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 02:52:53,692 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 02:52:53,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cb43066-1977-477f-8db0-62e235f5cf41/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 02:52:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:52:53,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-14 02:52:53,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:52:59,201 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 02:52:59,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:53:27,506 WARN L286 SmtUtils]: Spent 9.39s 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 02:53:38,424 WARN L286 SmtUtils]: Spent 5.52s 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 02:54:05,529 WARN L286 SmtUtils]: Spent 11.04s 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 02:54:48,368 WARN L286 SmtUtils]: Spent 25.90s 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 02:55:16,094 WARN L286 SmtUtils]: Spent 8.92s 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 02:55:16,789 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 02:55:16,789 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 02:55:16,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854818151] [2024-11-14 02:55:16,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854818151] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 02:55:16,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 02:55:16,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2024-11-14 02:55:16,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008592579] [2024-11-14 02:55:16,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:55:16,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 02:55:16,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 02:55:16,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 02:55:16,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=244, Unknown=5, NotChecked=0, Total=306 [2024-11-14 02:55:16,791 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 02:55:19,620 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 02:55:24,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:55:26,014 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 02:55:33,374 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 02:55:37,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:55:38,899 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 02:55:41,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:55:42,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:55:43,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:55:45,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:55:50,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:55:51,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:56:17,152 WARN L286 SmtUtils]: Spent 21.26s 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 02:56:26,504 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ zero_extend 24) c_~var_1_7~0)) (.cse35 ((_ zero_extend 24) c_~var_1_1~0))) (let ((.cse29 (bvneg .cse35)) (.cse36 (bvneg .cse3)) (.cse19 (= (_ bv0 8) c_~var_1_2~0))) (let ((.cse23 (not .cse19)) (.cse2 (bvadd .cse36 .cse35)) (.cse4 (bvadd .cse36 .cse35 .cse29)) (.cse25 (bvadd .cse35 .cse29)) (.cse32 (bvadd .cse35 (bvmul (_ bv2 32) .cse29))) (.cse0 ((_ sign_extend 16) c_~var_1_5~0))) (let ((.cse24 (bvslt .cse3 .cse35)) (.cse6 (bvslt .cse35 .cse0)) (.cse26 (= .cse35 .cse3)) (.cse30 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse40 ((_ 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) .cse40))) (not (bvsle (bvmul .cse3 (bvmul .cse40 .cse25)) .cse32)))))) (.cse1 (or (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse39 ((_ 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) .cse39))) (not (bvsle (bvmul (bvmul .cse2 .cse39) .cse3) .cse4))))) .cse19)) (.cse5 (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse37 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul .cse2 .cse37) .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) .cse37))))))) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse38 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul .cse2 .cse38) .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) .cse38))))))) .cse23))) (let ((.cse10 (bvsle .cse0 (bvadd (bvmul (_ bv2 32) .cse35) (bvmul (_ bv2 32) .cse36)))) (.cse8 (let ((.cse33 (= .cse2 .cse3)) (.cse34 (and .cse1 .cse5))) (and (or .cse33 .cse34) (or (not .cse33) .cse34)))) (.cse11 (or (and (or .cse26 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse31 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul .cse3 (bvmul .cse31 .cse25)) .cse32)) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse31)))))) (or .cse26 .cse30)) .cse23)) (.cse12 (or .cse26 .cse30 .cse19)) (.cse7 (not .cse6)) (.cse9 (not .cse24))) (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 .cse7 (and (or .cse9 .cse10 .cse8) .cse11 .cse12)) (or (let ((.cse21 (bvadd c_~var_1_8~0 .cse29))) (let ((.cse13 (forall ((~var_1_6~0 (_ BitVec 16))) (not (bvsle (bvmul (bvmul c_~var_1_8~0 ((_ sign_extend 16) ~var_1_6~0)) .cse3) .cse21)))) (.cse18 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse28 ((_ 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) .cse28))) (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse28) .cse3) .cse21))))))) (and (or (let ((.cse14 (= c_~var_1_8~0 .cse3)) (.cse15 (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse20 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse20) .cse3) .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 .cse0) .cse20))))))) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse22 ((_ 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) .cse22))) (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse22) .cse3) .cse21)))))) .cse23)) (.cse16 (or .cse18 .cse19))) (and (or (and (or .cse13 .cse14) .cse15 .cse16) .cse6) (or .cse7 (let ((.cse17 (and .cse15 .cse16))) (and (or (not .cse14) .cse17) (or .cse13 (= c_~var_1_8~0 .cse2)) (or .cse14 .cse17)))))) .cse9) (or .cse24 (and (or .cse13 (= c_~var_1_8~0 .cse25)) (or .cse18 .cse26 .cse19) (or (and (or .cse26 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse27 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse27) .cse3) .cse21)) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse27)))))) (or .cse18 .cse26)) .cse23)))))) (bvsle .cse0 (bvmul (_ bv2 32) c_~var_1_8~0))))))))) is different from true [2024-11-14 02:56:30,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:56:33,719 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 02:56:35,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:56:37,003 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 02:56:39,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:56:41,263 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 02:56:43,329 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 02:56:45,959 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 02:56:48,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:56:51,194 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 02:56:53,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:56:55,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:56:59,099 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 02:57:01,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:57:51,700 WARN L286 SmtUtils]: Spent 41.44s 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 02:57:52,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:57:55,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:57:58,105 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 02:58:00,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:58:02,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:58:18,606 WARN L286 SmtUtils]: Spent 6.51s 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 02:58:20,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:58:21,724 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 02:58:23,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 02:58:24,781 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 02:58:27,175 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 02:58:29,266 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 02:58:31,368 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 02:58:50,239 WARN L286 SmtUtils]: Spent 6.69s 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 02:58:53,054 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 02:58:55,601 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 02:58:58,221 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 02:59:00,309 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 02:59:02,384 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 02:59:06,179 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 02:59:08,267 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]