./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:44:23,228 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:44:23,300 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-28 20:44:23,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:44:23,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:44:23,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:44:23,334 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:44:23,334 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:44:23,335 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:44:23,336 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:44:23,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:44:23,337 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:44:23,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:44:23,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:44:23,339 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:44:23,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:44:23,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:44:23,341 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:44:23,341 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:44:23,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:44:23,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:44:23,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:44:23,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:44:23,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:44:23,345 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:44:23,345 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:44:23,346 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:44:23,346 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:44:23,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:44:23,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:44:23,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:44:23,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:44:23,348 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:44:23,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:44:23,349 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:44:23,349 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:44:23,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:44:23,349 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:44:23,350 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:44:23,350 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:44:23,350 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:44:23,350 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:44:23,351 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya 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 -> Automizer 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 -> 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef [2023-11-28 20:44:23,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:44:23,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:44:23,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:44:23,613 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:44:23,613 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:44:23,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/float-benchs/filter1.c [2023-11-28 20:44:26,759 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:44:26,950 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:44:26,951 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/sv-benchmarks/c/float-benchs/filter1.c [2023-11-28 20:44:26,960 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/data/2d80ce6e3/9283fb660b89466a9ea551aef12f55c8/FLAG88cde727f [2023-11-28 20:44:26,977 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/data/2d80ce6e3/9283fb660b89466a9ea551aef12f55c8 [2023-11-28 20:44:26,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:44:26,981 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:44:26,983 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:44:26,983 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:44:26,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:44:26,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:44:26" (1/1) ... [2023-11-28 20:44:26,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1634289e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:26, skipping insertion in model container [2023-11-28 20:44:26,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:44:26" (1/1) ... [2023-11-28 20:44:27,011 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:44:27,154 WARN L240 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_4550b578-4fa7-450b-81c1-caefe9ab57f7/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2023-11-28 20:44:27,168 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:44:27,179 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:44:27,191 WARN L240 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_4550b578-4fa7-450b-81c1-caefe9ab57f7/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2023-11-28 20:44:27,196 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:44:27,210 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:44:27,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:27 WrapperNode [2023-11-28 20:44:27,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:44:27,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:44:27,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:44:27,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:44:27,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:27" (1/1) ... [2023-11-28 20:44:27,227 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:27" (1/1) ... [2023-11-28 20:44:27,246 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2023-11-28 20:44:27,247 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:44:27,247 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:44:27,248 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:44:27,248 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:44:27,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:27" (1/1) ... [2023-11-28 20:44:27,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:27" (1/1) ... [2023-11-28 20:44:27,259 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:27" (1/1) ... [2023-11-28 20:44:27,271 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-28 20:44:27,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:27" (1/1) ... [2023-11-28 20:44:27,272 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:27" (1/1) ... [2023-11-28 20:44:27,277 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:27" (1/1) ... [2023-11-28 20:44:27,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:27" (1/1) ... [2023-11-28 20:44:27,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:27" (1/1) ... [2023-11-28 20:44:27,284 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:27" (1/1) ... [2023-11-28 20:44:27,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:44:27,288 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:44:27,288 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:44:27,288 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:44:27,289 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:27" (1/1) ... [2023-11-28 20:44:27,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:44:27,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:44:27,326 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:44:27,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:44:27,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:44:27,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 20:44:27,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:44:27,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:44:27,434 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:44:27,437 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:44:27,540 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:44:27,567 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:44:27,568 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 20:44:27,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:44:27 BoogieIcfgContainer [2023-11-28 20:44:27,568 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:44:27,571 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:44:27,571 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:44:27,574 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:44:27,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:44:26" (1/3) ... [2023-11-28 20:44:27,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d3dc2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:44:27, skipping insertion in model container [2023-11-28 20:44:27,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:27" (2/3) ... [2023-11-28 20:44:27,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d3dc2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:44:27, skipping insertion in model container [2023-11-28 20:44:27,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:44:27" (3/3) ... [2023-11-28 20:44:27,577 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c [2023-11-28 20:44:27,595 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:44:27,595 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:44:27,639 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:44:27,646 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, 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;@2c90a466, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:44:27,647 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 20:44:27,650 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:44:27,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-28 20:44:27,656 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:44:27,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:44:27,657 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:44:27,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:44:27,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1726010407, now seen corresponding path program 1 times [2023-11-28 20:44:27,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:44:27,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933289986] [2023-11-28 20:44:27,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:44:27,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:44:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:27,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:44:27,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:44:27,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933289986] [2023-11-28 20:44:27,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933289986] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:44:27,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:44:27,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:44:27,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267621798] [2023-11-28 20:44:27,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:44:27,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-28 20:44:27,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:44:27,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-28 20:44:27,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 20:44:27,852 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:44:27,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:44:27,877 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2023-11-28 20:44:27,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-28 20:44:27,879 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-28 20:44:27,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:44:27,887 INFO L225 Difference]: With dead ends: 23 [2023-11-28 20:44:27,887 INFO L226 Difference]: Without dead ends: 10 [2023-11-28 20:44:27,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 20:44:27,894 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:44:27,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:44:27,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-11-28 20:44:27,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-11-28 20:44:27,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:44:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-11-28 20:44:27,925 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2023-11-28 20:44:27,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:44:27,926 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-11-28 20:44:27,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:44:27,926 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2023-11-28 20:44:27,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-28 20:44:27,927 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:44:27,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:44:27,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 20:44:27,928 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:44:27,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:44:27,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1783268709, now seen corresponding path program 1 times [2023-11-28 20:44:27,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:44:27,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191092442] [2023-11-28 20:44:27,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:44:27,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:44:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:44:27,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:44:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:44:27,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:44:27,996 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 20:44:27,998 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-28 20:44:28,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 20:44:28,004 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-28 20:44:28,007 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 20:44:28,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:44:28 BoogieIcfgContainer [2023-11-28 20:44:28,026 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 20:44:28,027 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 20:44:28,027 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 20:44:28,027 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 20:44:28,028 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:44:27" (3/4) ... [2023-11-28 20:44:28,030 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-28 20:44:28,032 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 20:44:28,032 INFO L158 Benchmark]: Toolchain (without parser) took 1051.41ms. Allocated memory is still 157.3MB. Free memory was 117.4MB in the beginning and 68.7MB in the end (delta: 48.8MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2023-11-28 20:44:28,033 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 157.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:44:28,034 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.59ms. Allocated memory is still 157.3MB. Free memory was 116.9MB in the beginning and 106.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-28 20:44:28,034 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.87ms. Allocated memory is still 157.3MB. Free memory was 106.4MB in the beginning and 104.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 20:44:28,035 INFO L158 Benchmark]: Boogie Preprocessor took 39.44ms. Allocated memory is still 157.3MB. Free memory was 104.9MB in the beginning and 103.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 20:44:28,036 INFO L158 Benchmark]: RCFGBuilder took 280.67ms. Allocated memory is still 157.3MB. Free memory was 103.3MB in the beginning and 92.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-28 20:44:28,037 INFO L158 Benchmark]: TraceAbstraction took 455.36ms. Allocated memory is still 157.3MB. Free memory was 92.3MB in the beginning and 69.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-28 20:44:28,037 INFO L158 Benchmark]: Witness Printer took 4.59ms. Allocated memory is still 157.3MB. Free memory was 69.2MB in the beginning and 68.7MB in the end (delta: 528.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:44:28,041 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.23ms. Allocated memory is still 157.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.59ms. Allocated memory is still 157.3MB. Free memory was 116.9MB in the beginning and 106.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.87ms. Allocated memory is still 157.3MB. Free memory was 106.4MB in the beginning and 104.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.44ms. Allocated memory is still 157.3MB. Free memory was 104.9MB in the beginning and 103.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 280.67ms. Allocated memory is still 157.3MB. Free memory was 103.3MB in the beginning and 92.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 455.36ms. Allocated memory is still 157.3MB. Free memory was 92.3MB in the beginning and 69.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Witness Printer took 4.59ms. Allocated memory is still 157.3MB. Free memory was 69.2MB in the beginning and 68.7MB in the end (delta: 528.3kB). 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: 17]: 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 someBinaryDOUBLEComparisonOperation at line 41, overapproximation of to_real at line 34. Possible FailurePath: [L22] double E0, E1, S; [L23] int i; [L25] E1 = 0 [L26] S = 0 [L28] i = 0 VAL [i=0] [L28] COND TRUE i <= 1000000 [L30] E0 = __VERIFIER_nondet_double() [L31] CALL assume_abort_if_not(E0 >= -1. && E0 <= 1.) [L15] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L31] RET assume_abort_if_not(E0 >= -1. && E0 <= 1.) [L33] COND TRUE __VERIFIER_nondet_int() [L34] S = 0 VAL [i=0] [L39] E1 = E0 [L41] CALL __VERIFIER_assert(S >= -10000. && S <= 10000.) [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L17] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 10 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 [2023-11-28 20:44:28,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:44:30,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:44:30,388 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-28 20:44:30,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:44:30,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:44:30,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:44:30,441 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:44:30,441 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:44:30,442 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:44:30,443 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:44:30,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:44:30,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:44:30,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:44:30,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:44:30,446 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:44:30,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:44:30,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:44:30,448 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:44:30,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:44:30,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:44:30,450 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:44:30,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:44:30,451 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:44:30,451 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 20:44:30,452 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-28 20:44:30,452 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-28 20:44:30,453 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:44:30,453 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:44:30,454 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:44:30,454 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:44:30,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:44:30,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:44:30,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:44:30,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:44:30,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:44:30,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:44:30,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:44:30,457 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-28 20:44:30,457 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-28 20:44:30,457 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:44:30,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:44:30,458 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:44:30,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:44:30,458 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:44:30,458 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-28 20:44:30,459 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya 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 -> Automizer 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 -> 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef [2023-11-28 20:44:30,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:44:30,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:44:30,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:44:30,843 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:44:30,844 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:44:30,846 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/float-benchs/filter1.c [2023-11-28 20:44:34,131 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:44:34,359 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:44:34,360 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/sv-benchmarks/c/float-benchs/filter1.c [2023-11-28 20:44:34,370 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/data/7b2fb0693/a5e305422c414f9c82da711cc581ba44/FLAG8a5c4a6f8 [2023-11-28 20:44:34,390 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/data/7b2fb0693/a5e305422c414f9c82da711cc581ba44 [2023-11-28 20:44:34,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:44:34,395 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:44:34,397 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:44:34,397 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:44:34,404 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:44:34,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:44:34" (1/1) ... [2023-11-28 20:44:34,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b07909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:34, skipping insertion in model container [2023-11-28 20:44:34,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:44:34" (1/1) ... [2023-11-28 20:44:34,432 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:44:34,606 WARN L240 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_4550b578-4fa7-450b-81c1-caefe9ab57f7/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2023-11-28 20:44:34,621 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:44:34,636 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:44:34,649 WARN L240 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_4550b578-4fa7-450b-81c1-caefe9ab57f7/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2023-11-28 20:44:34,655 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:44:34,675 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:44:34,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:34 WrapperNode [2023-11-28 20:44:34,676 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:44:34,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:44:34,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:44:34,678 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:44:34,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:34" (1/1) ... [2023-11-28 20:44:34,696 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:34" (1/1) ... [2023-11-28 20:44:34,715 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2023-11-28 20:44:34,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:44:34,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:44:34,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:44:34,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:44:34,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:34" (1/1) ... [2023-11-28 20:44:34,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:34" (1/1) ... [2023-11-28 20:44:34,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:34" (1/1) ... [2023-11-28 20:44:34,748 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-28 20:44:34,749 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:34" (1/1) ... [2023-11-28 20:44:34,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:34" (1/1) ... [2023-11-28 20:44:34,759 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:34" (1/1) ... [2023-11-28 20:44:34,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:34" (1/1) ... [2023-11-28 20:44:34,766 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:34" (1/1) ... [2023-11-28 20:44:34,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:34" (1/1) ... [2023-11-28 20:44:34,771 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:44:34,773 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:44:34,773 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:44:34,773 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:44:34,774 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:34" (1/1) ... [2023-11-28 20:44:34,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:44:34,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:44:34,814 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:44:34,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:44:34,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:44:34,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-28 20:44:34,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:44:34,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:44:34,953 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:44:34,955 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:44:39,160 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:44:39,196 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:44:39,197 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 20:44:39,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:44:39 BoogieIcfgContainer [2023-11-28 20:44:39,197 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:44:39,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:44:39,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:44:39,205 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:44:39,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:44:34" (1/3) ... [2023-11-28 20:44:39,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467df881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:44:39, skipping insertion in model container [2023-11-28 20:44:39,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:44:34" (2/3) ... [2023-11-28 20:44:39,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467df881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:44:39, skipping insertion in model container [2023-11-28 20:44:39,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:44:39" (3/3) ... [2023-11-28 20:44:39,209 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c [2023-11-28 20:44:39,233 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:44:39,234 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:44:39,287 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:44:39,297 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, 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;@24a37416, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:44:39,297 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 20:44:39,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:44:39,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-28 20:44:39,310 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:44:39,310 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:44:39,311 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:44:39,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:44:39,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1726010407, now seen corresponding path program 1 times [2023-11-28 20:44:39,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:44:39,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220523737] [2023-11-28 20:44:39,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:44:39,334 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 [2023-11-28 20:44:39,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:44:39,336 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-28 20:44:39,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:44:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:39,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-28 20:44:39,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:44:39,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:44:39,447 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:44:39,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:44:39,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220523737] [2023-11-28 20:44:39,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220523737] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:44:39,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:44:39,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:44:39,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210305760] [2023-11-28 20:44:39,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:44:39,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-28 20:44:39,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:44:39,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-28 20:44:39,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 20:44:39,490 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:44:39,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:44:39,521 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2023-11-28 20:44:39,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-28 20:44:39,524 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-28 20:44:39,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:44:39,531 INFO L225 Difference]: With dead ends: 23 [2023-11-28 20:44:39,531 INFO L226 Difference]: Without dead ends: 10 [2023-11-28 20:44:39,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 20:44:39,538 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:44:39,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:44:39,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-11-28 20:44:39,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-11-28 20:44:39,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:44:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-11-28 20:44:39,566 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2023-11-28 20:44:39,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:44:39,567 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-11-28 20:44:39,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:44:39,567 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2023-11-28 20:44:39,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-28 20:44:39,568 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:44:39,568 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:44:39,576 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-28 20:44:39,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:44:39,771 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:44:39,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:44:39,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1783268709, now seen corresponding path program 1 times [2023-11-28 20:44:39,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:44:39,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842340703] [2023-11-28 20:44:39,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:44:39,774 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 [2023-11-28 20:44:39,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:44:39,776 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-28 20:44:39,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:44:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:39,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:44:39,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:44:40,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:44:40,002 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:44:40,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:44:40,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1842340703] [2023-11-28 20:44:40,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1842340703] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:44:40,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:44:40,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:44:40,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791279063] [2023-11-28 20:44:40,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:44:40,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:44:40,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:44:40,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:44:40,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:44:40,007 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:44:41,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:44:41,115 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2023-11-28 20:44:41,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:44:41,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-28 20:44:41,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:44:41,118 INFO L225 Difference]: With dead ends: 19 [2023-11-28 20:44:41,118 INFO L226 Difference]: Without dead ends: 17 [2023-11-28 20:44:41,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:44:41,120 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:44:41,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 12 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-28 20:44:41,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-11-28 20:44:41,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2023-11-28 20:44:41,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:44:41,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2023-11-28 20:44:41,126 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 8 [2023-11-28 20:44:41,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:44:41,127 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2023-11-28 20:44:41,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:44:41,127 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2023-11-28 20:44:41,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-28 20:44:41,128 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:44:41,128 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:44:41,131 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:44:41,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:44:41,329 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:44:41,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:44:41,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1783328291, now seen corresponding path program 1 times [2023-11-28 20:44:41,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:44:41,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890132821] [2023-11-28 20:44:41,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:44:41,331 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 [2023-11-28 20:44:41,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:44:41,332 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-28 20:44:41,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:44:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:41,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-28 20:44:41,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:44:42,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:44:42,873 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:44:42,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:44:42,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890132821] [2023-11-28 20:44:42,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890132821] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:44:42,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:44:42,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:44:42,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614562070] [2023-11-28 20:44:42,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:44:42,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:44:42,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:44:42,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:44:42,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:44:42,878 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:44:48,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:44:52,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:44:52,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:44:52,602 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2023-11-28 20:44:52,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:44:52,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-28 20:44:52,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:44:52,651 INFO L225 Difference]: With dead ends: 28 [2023-11-28 20:44:52,651 INFO L226 Difference]: Without dead ends: 26 [2023-11-28 20:44:52,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:44:52,653 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2023-11-28 20:44:52,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 14 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 2 Unknown, 0 Unchecked, 9.5s Time] [2023-11-28 20:44:52,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-28 20:44:52,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2023-11-28 20:44:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:44:52,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2023-11-28 20:44:52,660 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 8 [2023-11-28 20:44:52,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:44:52,660 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2023-11-28 20:44:52,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:44:52,661 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2023-11-28 20:44:52,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-28 20:44:52,661 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:44:52,662 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:44:52,671 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:44:52,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:44:52,863 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:44:52,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:44:52,863 INFO L85 PathProgramCache]: Analyzing trace with hash 221904285, now seen corresponding path program 1 times [2023-11-28 20:44:52,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:44:52,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309888259] [2023-11-28 20:44:52,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:44:52,864 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 [2023-11-28 20:44:52,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:44:52,865 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-28 20:44:52,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:44:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:53,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-28 20:44:53,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:45:18,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:45:18,873 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:45:29,700 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:45:37,906 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:45:41,951 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2023-11-28 20:45:46,003 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2023-11-28 20:45:53,735 WARN L293 SmtUtils]: Spent 7.73s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:46:01,941 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:46:10,143 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:46:18,356 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:46:26,566 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:46:30,629 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from false [2023-11-28 20:46:34,692 WARN L876 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from true [2023-11-28 20:46:42,940 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:46:51,067 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:46:59,312 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:47:07,553 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:47:15,685 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:47:23,939 WARN L293 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:47:28,044 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse2 (fp.neg .cse3))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3))))))) is different from true [2023-11-28 20:47:36,303 WARN L293 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:47:44,429 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:47:52,668 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:48:00,889 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:48:09,005 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:48:14,007 WARN L293 SmtUtils]: Spent 5.00s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:48:22,254 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:48:30,398 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:48:38,643 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:48:46,896 WARN L293 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:48:55,051 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:49:03,321 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:49:11,582 WARN L293 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:49:19,730 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:49:28,091 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:49:36,358 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:49:44,633 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:49:50,269 WARN L293 SmtUtils]: Spent 5.64s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:49:54,373 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse3)) (.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) (fp.neg .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1)))))) is different from true [2023-11-28 20:51:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-11-28 20:51:01,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:51:01,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309888259] [2023-11-28 20:51:01,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309888259] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:51:01,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:51:01,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2023-11-28 20:51:01,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290611099] [2023-11-28 20:51:01,611 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:51:01,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-28 20:51:01,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:51:01,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-28 20:51:01,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=152, Unknown=15, NotChecked=116, Total=342 [2023-11-28 20:51:01,612 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:51:02,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:51:04,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:51:31,462 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse7 |c_ULTIMATE.start_main_~S~0#1|)) (.cse5 (fp.mul c_currentRoundingMode .cse7 .cse0)) (.cse2 (fp.neg .cse6)) (.cse3 (fp.neg .cse4))) (and (= |c_ULTIMATE.start_main_~S~0#1| .cse0) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse4)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse6) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse4)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse4)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse6))) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse3) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse4) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse4)))) (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse4) (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse3) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-11-28 20:52:01,476 WARN L293 SmtUtils]: Spent 6.90s on a formula simplification. DAG size of input: 40 DAG size of output: 27 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:52:06,009 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse2 (fp.neg .cse3))) (and (= |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)))) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse2) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse3) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-11-28 20:52:18,999 WARN L293 SmtUtils]: Spent 5.94s on a formula simplification. DAG size of input: 43 DAG size of output: 30 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:52:23,488 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse2 (fp.neg .cse3))) (and (= |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)))) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse2) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse3) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-11-28 20:52:31,086 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse2 (fp.neg .cse3)) (.cse6 (fp.neg .cse7)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse5 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (and (= |c_ULTIMATE.start_main_~S~0#1| .cse0) (or (let ((.cse1 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse3))) .cse5) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse6) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse7) (let ((.cse9 (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse6)) (.cse8 (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse7))) (or (and .cse8 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse9) (and (or (not .cse9) (not .cse8)) .cse5))) (or (let ((.cse10 (fp.mul c_currentRoundingMode .cse4 .cse0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse6)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse10 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse7)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse10 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse6)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse7)))))) .cse5) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-11-28 20:52:33,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-28 20:52:51,328 WARN L293 SmtUtils]: Spent 6.87s on a formula simplification. DAG size of input: 52 DAG size of output: 37 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:52:56,226 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse7 .cse0)) (.cse6 (fp.neg .cse3)) (.cse1 (fp.neg .cse4)) (.cse5 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (= |c_ULTIMATE.start_main_~S~0#1| .cse0) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse1)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse4)))) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse1) (fp.geq .cse5 .cse6) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse4) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse6) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse1)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse4)))) (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse4) (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse1) (fp.leq .cse5 .cse3) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-11-28 20:53:15,607 WARN L293 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 50 DAG size of output: 30 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:53:21,077 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse7 |c_ULTIMATE.start_main_~S~0#1|)) (.cse5 (fp.mul c_currentRoundingMode .cse7 .cse0)) (.cse2 (fp.neg .cse6)) (.cse3 (fp.neg .cse4))) (and (= |c_ULTIMATE.start_main_~S~0#1| .cse0) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse4)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse6) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse4)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse4)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse6))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse4)))) (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse4) (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse3) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-11-28 20:53:25,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:53:29,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:53:33,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:53:37,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:53:41,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:53:45,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:53:49,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:53:53,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:53:57,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:54:01,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:54:36,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-28 20:54:39,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-28 20:54:46,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-28 20:54:49,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-28 20:55:07,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-28 20:55:09,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-28 20:55:13,942 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 (fp.neg .cse2)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse4 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (and (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) .cse4) (or (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse5 (fp.neg .cse7))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse5)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse6 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse7)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse6 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse5)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse7))))))) .cse4)))) is different from false [2023-11-28 20:55:18,019 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 (fp.neg .cse2)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse4 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (and (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) .cse4) (or (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse5 (fp.neg .cse7))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse5)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse6 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse7)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse6 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse5)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse7))))))) .cse4)))) is different from true [2023-11-28 20:55:48,902 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse5 (fp.neg .cse2)) (.cse0 (fp.neg .cse3)) (.cse4 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse0)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)))) (fp.geq .cse4 .cse5) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)))) (fp.leq .cse4 .cse2)))) is different from false [2023-11-28 20:55:52,982 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse5 (fp.neg .cse2)) (.cse0 (fp.neg .cse3)) (.cse4 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse0)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)))) (fp.geq .cse4 .cse5) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)))) (fp.leq .cse4 .cse2)))) is different from true [2023-11-28 20:56:16,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:56:20,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:56:24,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:56:28,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:56:32,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:56:36,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:56:40,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:56:44,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:56:48,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:56:52,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:58:01,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:58:06,467 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse6 |c_ULTIMATE.start_main_~S~0#1|)) (.cse4 (fp.mul c_currentRoundingMode .cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse2 (fp.neg .cse3)) (.cse1 (fp.neg .cse5))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)))) (fp.leq |c_ULTIMATE.start_main_~S~0#1| .cse5) (fp.geq |c_ULTIMATE.start_main_~S~0#1| .cse1)))) is different from true [2023-11-28 20:58:10,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:58:14,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:58:18,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:58:22,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:58:26,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:58:30,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:58:34,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:58:38,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:58:42,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:58:44,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:58:48,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:58:52,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-28 20:58:56,392 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse2 (fp.neg .cse3))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)))) (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3))))))) is different from true [2023-11-28 20:59:14,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:59:18,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:59:22,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:59:26,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-28 20:59:26,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:59:26,596 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2023-11-28 20:59:26,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-28 20:59:26,660 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-28 20:59:26,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:59:26,661 INFO L225 Difference]: With dead ends: 60 [2023-11-28 20:59:26,661 INFO L226 Difference]: Without dead ends: 58 [2023-11-28 20:59:26,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 429.9s TimeCoverageRelationStatistics Valid=208, Invalid=719, Unknown=59, NotChecked=994, Total=1980 [2023-11-28 20:59:26,663 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 73 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 8 mSolverCounterUnsat, 35 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 171.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 35 IncrementalHoareTripleChecker+Unknown, 481 IncrementalHoareTripleChecker+Unchecked, 171.8s IncrementalHoareTripleChecker+Time [2023-11-28 20:59:26,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 40 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 117 Invalid, 35 Unknown, 481 Unchecked, 171.8s Time] [2023-11-28 20:59:26,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-28 20:59:26,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 19. [2023-11-28 20:59:26,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:59:26,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2023-11-28 20:59:26,667 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2023-11-28 20:59:26,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:59:26,667 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2023-11-28 20:59:26,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:59:26,668 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2023-11-28 20:59:26,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-28 20:59:26,668 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:59:26,668 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-28 20:59:26,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-28 20:59:26,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:59:26,869 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:59:26,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:59:26,869 INFO L85 PathProgramCache]: Analyzing trace with hash 922968863, now seen corresponding path program 1 times [2023-11-28 20:59:26,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:59:26,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2143324455] [2023-11-28 20:59:26,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:59:26,870 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 [2023-11-28 20:59:26,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:59:26,871 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-28 20:59:26,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4550b578-4fa7-450b-81c1-caefe9ab57f7/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:59:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:59:28,456 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-28 20:59:28,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:59:42,832 WARN L293 SmtUtils]: Spent 7.44s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)