./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/zonotope_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/zonotope_2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 07:05:30,297 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 07:05:30,300 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 07:05:30,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 07:05:30,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 07:05:30,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 07:05:30,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 07:05:30,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 07:05:30,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 07:05:30,354 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 07:05:30,354 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 07:05:30,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 07:05:30,356 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 07:05:30,358 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 07:05:30,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 07:05:30,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 07:05:30,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 07:05:30,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 07:05:30,367 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 07:05:30,372 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 07:05:30,373 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 07:05:30,374 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 07:05:30,375 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 07:05:30,376 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 07:05:30,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 07:05:30,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 07:05:30,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 07:05:30,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 07:05:30,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 07:05:30,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 07:05:30,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 07:05:30,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 07:05:30,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 07:05:30,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 07:05:30,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 07:05:30,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 07:05:30,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 07:05:30,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 07:05:30,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 07:05:30,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 07:05:30,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 07:05:30,387 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 07:05:30,412 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 07:05:30,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 07:05:30,413 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 07:05:30,413 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 07:05:30,414 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 07:05:30,414 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 07:05:30,415 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 07:05:30,415 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 07:05:30,415 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 07:05:30,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 07:05:30,416 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 07:05:30,416 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 07:05:30,416 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 07:05:30,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 07:05:30,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 07:05:30,417 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 07:05:30,417 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 07:05:30,417 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 07:05:30,417 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 07:05:30,417 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 07:05:30,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 07:05:30,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 07:05:30,418 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 07:05:30,418 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 07:05:30,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:05:30,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 07:05:30,418 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 07:05:30,418 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 07:05:30,419 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 07:05:30,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 07:05:30,419 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 07:05:30,419 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 07:05:30,419 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 07:05:30,420 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 07:05:30,420 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 [2021-12-17 07:05:30,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 07:05:30,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 07:05:30,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 07:05:30,626 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 07:05:30,626 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 07:05:30,627 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/zonotope_2.c [2021-12-17 07:05:30,690 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cabe009a4/4bfd1ae2f82a45558e89f716e0d756ca/FLAG9da4b1666 [2021-12-17 07:05:31,033 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 07:05:31,034 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/zonotope_2.c [2021-12-17 07:05:31,038 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cabe009a4/4bfd1ae2f82a45558e89f716e0d756ca/FLAG9da4b1666 [2021-12-17 07:05:31,051 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cabe009a4/4bfd1ae2f82a45558e89f716e0d756ca [2021-12-17 07:05:31,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 07:05:31,054 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 07:05:31,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 07:05:31,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 07:05:31,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 07:05:31,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:05:31" (1/1) ... [2021-12-17 07:05:31,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b7eb9d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:31, skipping insertion in model container [2021-12-17 07:05:31,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:05:31" (1/1) ... [2021-12-17 07:05:31,065 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 07:05:31,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 07:05:31,199 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2021-12-17 07:05:31,217 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:05:31,223 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 07:05:31,233 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2021-12-17 07:05:31,240 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:05:31,250 INFO L208 MainTranslator]: Completed translation [2021-12-17 07:05:31,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:31 WrapperNode [2021-12-17 07:05:31,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 07:05:31,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 07:05:31,252 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 07:05:31,253 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 07:05:31,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:31" (1/1) ... [2021-12-17 07:05:31,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:31" (1/1) ... [2021-12-17 07:05:31,277 INFO L137 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2021-12-17 07:05:31,277 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 07:05:31,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 07:05:31,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 07:05:31,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 07:05:31,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:31" (1/1) ... [2021-12-17 07:05:31,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:31" (1/1) ... [2021-12-17 07:05:31,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:31" (1/1) ... [2021-12-17 07:05:31,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:31" (1/1) ... [2021-12-17 07:05:31,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:31" (1/1) ... [2021-12-17 07:05:31,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:31" (1/1) ... [2021-12-17 07:05:31,296 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:31" (1/1) ... [2021-12-17 07:05:31,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 07:05:31,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 07:05:31,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 07:05:31,298 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 07:05:31,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:31" (1/1) ... [2021-12-17 07:05:31,304 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:05:31,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 07:05:31,323 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 07:05:31,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 07:05:31,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 07:05:31,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 07:05:31,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 07:05:31,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 07:05:31,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-17 07:05:31,360 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-17 07:05:31,396 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 07:05:31,398 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 07:05:31,462 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 07:05:31,476 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 07:05:31,477 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 07:05:31,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:05:31 BoogieIcfgContainer [2021-12-17 07:05:31,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 07:05:31,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 07:05:31,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 07:05:31,508 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 07:05:31,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 07:05:31" (1/3) ... [2021-12-17 07:05:31,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce2669d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:05:31, skipping insertion in model container [2021-12-17 07:05:31,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:31" (2/3) ... [2021-12-17 07:05:31,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce2669d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:05:31, skipping insertion in model container [2021-12-17 07:05:31,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:05:31" (3/3) ... [2021-12-17 07:05:31,510 INFO L111 eAbstractionObserver]: Analyzing ICFG zonotope_2.c [2021-12-17 07:05:31,514 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 07:05:31,514 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 07:05:31,568 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 07:05:31,573 INFO L339 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=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 07:05:31,573 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 07:05:31,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 07:05:31,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-17 07:05:31,586 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:05:31,587 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:05:31,587 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:05:31,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:05:31,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1815999968, now seen corresponding path program 1 times [2021-12-17 07:05:31,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 07:05:31,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275787763] [2021-12-17 07:05:31,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:05:31,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 07:05:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:05:31,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:05:31,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 07:05:31,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275787763] [2021-12-17 07:05:31,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275787763] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:05:31,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:05:31,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 07:05:31,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600527967] [2021-12-17 07:05:31,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:05:31,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 07:05:31,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 07:05:31,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 07:05:31,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 07:05:31,702 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:05:31,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:05:31,713 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2021-12-17 07:05:31,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 07:05:31,715 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-17 07:05:31,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:05:31,719 INFO L225 Difference]: With dead ends: 32 [2021-12-17 07:05:31,719 INFO L226 Difference]: Without dead ends: 13 [2021-12-17 07:05:31,721 INFO L932 BasicCegarLoop]: 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 [2021-12-17 07:05:31,723 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:05:31,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 07:05:31,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-12-17 07:05:31,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-12-17 07:05:31,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 07:05:31,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-12-17 07:05:31,755 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2021-12-17 07:05:31,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:05:31,765 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-12-17 07:05:31,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:05:31,765 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-12-17 07:05:31,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-17 07:05:31,766 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:05:31,766 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:05:31,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 07:05:31,766 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:05:31,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:05:31,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1808611800, now seen corresponding path program 1 times [2021-12-17 07:05:31,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 07:05:31,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347768497] [2021-12-17 07:05:31,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:05:31,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 07:05:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:05:31,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:05:31,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 07:05:31,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347768497] [2021-12-17 07:05:31,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347768497] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:05:31,795 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:05:31,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 07:05:31,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918757396] [2021-12-17 07:05:31,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:05:31,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 07:05:31,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 07:05:31,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 07:05:31,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 07:05:31,797 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:05:31,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:05:31,807 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2021-12-17 07:05:31,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 07:05:31,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-17 07:05:31,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:05:31,808 INFO L225 Difference]: With dead ends: 24 [2021-12-17 07:05:31,808 INFO L226 Difference]: Without dead ends: 17 [2021-12-17 07:05:31,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 07:05:31,810 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:05:31,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 07:05:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-12-17 07:05:31,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2021-12-17 07:05:31,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 07:05:31,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-12-17 07:05:31,822 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2021-12-17 07:05:31,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:05:31,822 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-12-17 07:05:31,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:05:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2021-12-17 07:05:31,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-17 07:05:31,824 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:05:31,825 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:05:31,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 07:05:31,825 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:05:31,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:05:31,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1810339678, now seen corresponding path program 1 times [2021-12-17 07:05:31,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 07:05:31,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351558288] [2021-12-17 07:05:31,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:05:31,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 07:05:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 07:05:31,846 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 07:05:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 07:05:31,887 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 07:05:31,887 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 07:05:31,888 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 07:05:31,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 07:05:31,893 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-12-17 07:05:31,896 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 07:05:31,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 07:05:31 BoogieIcfgContainer [2021-12-17 07:05:31,914 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 07:05:31,915 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 07:05:31,915 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 07:05:31,915 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 07:05:31,916 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:05:31" (3/4) ... [2021-12-17 07:05:31,918 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-17 07:05:31,918 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 07:05:31,918 INFO L158 Benchmark]: Toolchain (without parser) took 864.07ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 55.5MB in the beginning and 81.1MB in the end (delta: -25.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:05:31,919 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 88.1MB. Free memory was 45.2MB in the beginning and 45.2MB in the end (delta: 39.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:05:31,919 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.36ms. Allocated memory is still 88.1MB. Free memory was 55.2MB in the beginning and 64.6MB in the end (delta: -9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 07:05:31,919 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.36ms. Allocated memory is still 88.1MB. Free memory was 64.6MB in the beginning and 63.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 07:05:31,919 INFO L158 Benchmark]: Boogie Preprocessor took 18.66ms. Allocated memory is still 88.1MB. Free memory was 63.2MB in the beginning and 62.2MB in the end (delta: 996.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:05:31,921 INFO L158 Benchmark]: RCFGBuilder took 181.74ms. Allocated memory is still 88.1MB. Free memory was 62.2MB in the beginning and 53.4MB in the end (delta: 8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 07:05:31,922 INFO L158 Benchmark]: TraceAbstraction took 421.42ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 53.0MB in the beginning and 81.6MB in the end (delta: -28.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:05:31,922 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 113.2MB. Free memory was 81.6MB in the beginning and 81.1MB in the end (delta: 564.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:05:31,923 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 88.1MB. Free memory was 45.2MB in the beginning and 45.2MB in the end (delta: 39.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.36ms. Allocated memory is still 88.1MB. Free memory was 55.2MB in the beginning and 64.6MB in the end (delta: -9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.36ms. Allocated memory is still 88.1MB. Free memory was 64.6MB in the beginning and 63.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.66ms. Allocated memory is still 88.1MB. Free memory was 63.2MB in the beginning and 62.2MB in the end (delta: 996.5kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 181.74ms. Allocated memory is still 88.1MB. Free memory was 62.2MB in the beginning and 53.4MB in the end (delta: 8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 421.42ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 53.0MB in the beginning and 81.6MB in the end (delta: -28.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 113.2MB. Free memory was 81.6MB in the beginning and 81.1MB in the end (delta: 564.6kB). 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: 10]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 25, overapproximation of someBinaryArithmeticFLOAToperation at line 22. Possible FailurePath: [L14] float x = 12.f; [L15] float x1 = 12.f; [L16] float y = 16.f; [L17] float y1 = 16.f; [L18] int i; [L19] i = 0 VAL [i=0, x=12, x1=12, y=16, y1=16] [L19] COND TRUE i < 100000 [L20] x = x1 [L21] y = y1 [L22] x1 = 3.f * x / 4.f + y / 4.f [L23] y1 = x / 4.f + 3.f * y / 4.f VAL [i=0, x=12, y=16] [L25] CALL __VERIFIER_assert(x1 >= 0.f && x1 <= 100.f) VAL [\old(cond)=0] [L10] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L10] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 34 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 14 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 [2021-12-17 07:05:31,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/zonotope_2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 07:05:33,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 07:05:33,687 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 07:05:33,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 07:05:33,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 07:05:33,710 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 07:05:33,711 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 07:05:33,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 07:05:33,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 07:05:33,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 07:05:33,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 07:05:33,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 07:05:33,725 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 07:05:33,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 07:05:33,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 07:05:33,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 07:05:33,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 07:05:33,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 07:05:33,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 07:05:33,738 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 07:05:33,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 07:05:33,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 07:05:33,743 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 07:05:33,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 07:05:33,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 07:05:33,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 07:05:33,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 07:05:33,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 07:05:33,752 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 07:05:33,753 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 07:05:33,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 07:05:33,753 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 07:05:33,754 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 07:05:33,756 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 07:05:33,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 07:05:33,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 07:05:33,758 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 07:05:33,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 07:05:33,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 07:05:33,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 07:05:33,759 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 07:05:33,760 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-17 07:05:33,780 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 07:05:33,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 07:05:33,781 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 07:05:33,781 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 07:05:33,782 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 07:05:33,782 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 07:05:33,783 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 07:05:33,783 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 07:05:33,783 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 07:05:33,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 07:05:33,784 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 07:05:33,784 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 07:05:33,784 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 07:05:33,785 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 07:05:33,785 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 07:05:33,785 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 07:05:33,785 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-17 07:05:33,785 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-17 07:05:33,785 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-17 07:05:33,785 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 07:05:33,786 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 07:05:33,786 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 07:05:33,786 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 07:05:33,786 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 07:05:33,786 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 07:05:33,786 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 07:05:33,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:05:33,787 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 07:05:33,787 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 07:05:33,787 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 07:05:33,787 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-17 07:05:33,787 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-17 07:05:33,788 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 07:05:33,788 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 07:05:33,788 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 07:05:33,788 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 07:05:33,788 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-17 07:05:33,788 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 [2021-12-17 07:05:34,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 07:05:34,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 07:05:34,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 07:05:34,074 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 07:05:34,075 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 07:05:34,076 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/zonotope_2.c [2021-12-17 07:05:34,119 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d691caf31/525d6d68047640579b7c0c457b6c0675/FLAGf8caf2f32 [2021-12-17 07:05:34,476 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 07:05:34,477 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/zonotope_2.c [2021-12-17 07:05:34,481 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d691caf31/525d6d68047640579b7c0c457b6c0675/FLAGf8caf2f32 [2021-12-17 07:05:34,903 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d691caf31/525d6d68047640579b7c0c457b6c0675 [2021-12-17 07:05:34,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 07:05:34,908 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 07:05:34,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 07:05:34,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 07:05:34,912 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 07:05:34,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:05:34" (1/1) ... [2021-12-17 07:05:34,914 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1abddf61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:34, skipping insertion in model container [2021-12-17 07:05:34,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:05:34" (1/1) ... [2021-12-17 07:05:34,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 07:05:34,933 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 07:05:35,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2021-12-17 07:05:35,085 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:05:35,095 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 07:05:35,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2021-12-17 07:05:35,150 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:05:35,163 INFO L208 MainTranslator]: Completed translation [2021-12-17 07:05:35,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:35 WrapperNode [2021-12-17 07:05:35,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 07:05:35,165 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 07:05:35,165 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 07:05:35,165 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 07:05:35,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:35" (1/1) ... [2021-12-17 07:05:35,182 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:35" (1/1) ... [2021-12-17 07:05:35,196 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2021-12-17 07:05:35,197 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 07:05:35,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 07:05:35,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 07:05:35,198 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 07:05:35,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:35" (1/1) ... [2021-12-17 07:05:35,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:35" (1/1) ... [2021-12-17 07:05:35,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:35" (1/1) ... [2021-12-17 07:05:35,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:35" (1/1) ... [2021-12-17 07:05:35,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:35" (1/1) ... [2021-12-17 07:05:35,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:35" (1/1) ... [2021-12-17 07:05:35,230 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:35" (1/1) ... [2021-12-17 07:05:35,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 07:05:35,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 07:05:35,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 07:05:35,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 07:05:35,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:35" (1/1) ... [2021-12-17 07:05:35,243 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:05:35,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 07:05:35,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 07:05:35,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 07:05:35,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 07:05:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 07:05:35,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 07:05:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-17 07:05:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-17 07:05:35,300 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-17 07:05:35,360 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 07:05:35,362 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 07:05:37,552 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 07:05:37,556 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 07:05:37,557 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 07:05:37,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:05:37 BoogieIcfgContainer [2021-12-17 07:05:37,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 07:05:37,559 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 07:05:37,560 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 07:05:37,562 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 07:05:37,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 07:05:34" (1/3) ... [2021-12-17 07:05:37,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d89a9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:05:37, skipping insertion in model container [2021-12-17 07:05:37,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:35" (2/3) ... [2021-12-17 07:05:37,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d89a9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:05:37, skipping insertion in model container [2021-12-17 07:05:37,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:05:37" (3/3) ... [2021-12-17 07:05:37,564 INFO L111 eAbstractionObserver]: Analyzing ICFG zonotope_2.c [2021-12-17 07:05:37,568 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 07:05:37,568 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 07:05:37,598 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 07:05:37,602 INFO L339 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=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 07:05:37,603 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 07:05:37,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 07:05:37,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-17 07:05:37,616 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:05:37,616 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:05:37,616 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:05:37,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:05:37,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1815999968, now seen corresponding path program 1 times [2021-12-17 07:05:37,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:05:37,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495449359] [2021-12-17 07:05:37,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:05:37,629 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:05:37,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:05:37,631 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:05:37,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-17 07:05:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:05:37,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-17 07:05:37,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:05:37,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:05:37,746 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:05:37,747 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:05:37,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495449359] [2021-12-17 07:05:37,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495449359] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:05:37,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:05:37,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 07:05:37,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204127653] [2021-12-17 07:05:37,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:05:37,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 07:05:37,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:05:37,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 07:05:37,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 07:05:37,771 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:05:37,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:05:37,783 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2021-12-17 07:05:37,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 07:05:37,784 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-17 07:05:37,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:05:37,789 INFO L225 Difference]: With dead ends: 32 [2021-12-17 07:05:37,789 INFO L226 Difference]: Without dead ends: 13 [2021-12-17 07:05:37,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 07:05:37,795 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:05:37,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 07:05:37,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-12-17 07:05:37,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-12-17 07:05:37,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 07:05:37,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-12-17 07:05:37,824 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2021-12-17 07:05:37,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:05:37,825 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-12-17 07:05:37,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:05:37,825 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-12-17 07:05:37,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-17 07:05:37,826 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:05:37,826 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:05:37,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-17 07:05:38,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:05:38,034 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:05:38,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:05:38,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1808611800, now seen corresponding path program 1 times [2021-12-17 07:05:38,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:05:38,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637587771] [2021-12-17 07:05:38,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:05:38,036 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:05:38,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:05:38,037 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:05:38,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-17 07:05:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:05:38,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 07:05:38,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:05:38,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:05:38,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:05:38,133 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:05:38,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637587771] [2021-12-17 07:05:38,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637587771] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:05:38,134 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:05:38,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 07:05:38,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077866285] [2021-12-17 07:05:38,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:05:38,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 07:05:38,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:05:38,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 07:05:38,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 07:05:38,136 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:05:40,263 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:05:40,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:05:40,317 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2021-12-17 07:05:40,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 07:05:40,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-17 07:05:40,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:05:40,319 INFO L225 Difference]: With dead ends: 21 [2021-12-17 07:05:40,319 INFO L226 Difference]: Without dead ends: 14 [2021-12-17 07:05:40,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 07:05:40,320 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-17 07:05:40,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-17 07:05:40,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-12-17 07:05:40,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-12-17 07:05:40,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 07:05:40,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-12-17 07:05:40,324 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2021-12-17 07:05:40,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:05:40,324 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-12-17 07:05:40,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:05:40,325 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2021-12-17 07:05:40,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-17 07:05:40,325 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:05:40,325 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:05:40,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-17 07:05:40,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:05:40,536 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:05:40,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:05:40,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1810339678, now seen corresponding path program 1 times [2021-12-17 07:05:40,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:05:40,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324988638] [2021-12-17 07:05:40,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:05:40,537 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:05:40,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:05:40,538 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:05:40,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-17 07:05:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:05:40,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-17 07:05:40,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:05:40,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:05:40,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:05:40,932 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:05:40,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324988638] [2021-12-17 07:05:40,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324988638] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:05:40,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:05:40,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 07:05:40,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741758491] [2021-12-17 07:05:40,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:05:40,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 07:05:40,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:05:40,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 07:05:40,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-17 07:05:40,933 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:05:41,981 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:05:43,478 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:05:45,982 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:05:48,190 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:05:50,194 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:05:50,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:05:50,194 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2021-12-17 07:05:50,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 07:05:50,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-17 07:05:50,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:05:50,245 INFO L225 Difference]: With dead ends: 31 [2021-12-17 07:05:50,245 INFO L226 Difference]: Without dead ends: 29 [2021-12-17 07:05:50,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-17 07:05:50,246 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2021-12-17 07:05:50,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 50 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 3 Unknown, 0 Unchecked, 9.1s Time] [2021-12-17 07:05:50,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-17 07:05:50,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-12-17 07:05:50,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 07:05:50,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-17 07:05:50,252 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 7 [2021-12-17 07:05:50,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:05:50,253 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-17 07:05:50,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:05:50,253 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-17 07:05:50,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 07:05:50,253 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:05:50,254 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:05:50,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-17 07:05:50,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:05:50,463 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:05:50,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:05:50,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1269539930, now seen corresponding path program 1 times [2021-12-17 07:05:50,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:05:50,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961414808] [2021-12-17 07:05:50,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:05:50,464 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:05:50,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:05:50,469 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:05:50,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-17 07:05:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:05:50,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-17 07:05:50,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:05:50,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:05:50,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 07:06:01,236 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-12-17 07:06:03,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:06:03,184 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:06:03,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961414808] [2021-12-17 07:06:03,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [961414808] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-17 07:06:03,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 07:06:03,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2021-12-17 07:06:03,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734400449] [2021-12-17 07:06:03,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:06:03,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 07:06:03,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:06:03,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 07:06:03,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=68, Unknown=1, NotChecked=16, Total=110 [2021-12-17 07:06:03,186 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 07:06:36,452 WARN L227 SmtUtils]: Spent 17.96s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 07:06:38,543 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:06:40,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:06:40,761 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2021-12-17 07:06:40,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 07:06:40,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-12-17 07:06:40,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:06:40,763 INFO L225 Difference]: With dead ends: 33 [2021-12-17 07:06:40,763 INFO L226 Difference]: Without dead ends: 29 [2021-12-17 07:06:40,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 39.5s TimeCoverageRelationStatistics Valid=33, Invalid=96, Unknown=7, NotChecked=20, Total=156 [2021-12-17 07:06:40,767 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-17 07:06:40,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 59 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 1 Unknown, 12 Unchecked, 2.3s Time] [2021-12-17 07:06:40,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-17 07:06:40,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-17 07:06:40,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 07:06:40,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2021-12-17 07:06:40,773 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 12 [2021-12-17 07:06:40,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:06:40,774 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2021-12-17 07:06:40,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 07:06:40,774 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2021-12-17 07:06:40,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-17 07:06:40,774 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:06:40,775 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:06:40,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-17 07:06:40,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:06:40,979 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:06:40,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:06:40,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1102679400, now seen corresponding path program 1 times [2021-12-17 07:06:40,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:06:40,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161678972] [2021-12-17 07:06:40,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:06:40,980 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:06:40,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:06:40,982 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:06:40,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-17 07:06:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:06:41,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 07:06:41,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:06:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 07:06:41,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 07:06:41,319 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 07:06:41,319 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:06:41,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161678972] [2021-12-17 07:06:41,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161678972] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 07:06:41,319 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 07:06:41,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-17 07:06:41,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639411748] [2021-12-17 07:06:41,319 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 07:06:41,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 07:06:41,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:06:41,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 07:06:41,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-17 07:06:41,320 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 07:06:43,416 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:06:45,574 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:06:45,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:06:45,661 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2021-12-17 07:06:45,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 07:06:45,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2021-12-17 07:06:45,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:06:45,662 INFO L225 Difference]: With dead ends: 40 [2021-12-17 07:06:45,662 INFO L226 Difference]: Without dead ends: 30 [2021-12-17 07:06:45,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-17 07:06:45,663 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2021-12-17 07:06:45,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2021-12-17 07:06:45,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-17 07:06:45,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-12-17 07:06:45,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 07:06:45,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-12-17 07:06:45,668 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2021-12-17 07:06:45,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:06:45,669 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-12-17 07:06:45,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 07:06:45,669 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-12-17 07:06:45,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-17 07:06:45,670 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:06:45,670 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:06:45,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-17 07:06:45,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:06:45,876 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:06:45,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:06:45,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1100951522, now seen corresponding path program 1 times [2021-12-17 07:06:45,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:06:45,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709245850] [2021-12-17 07:06:45,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:06:45,877 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:06:45,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:06:45,877 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:06:45,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-17 07:06:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:06:46,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-17 07:06:46,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:06:46,560 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 07:06:46,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 07:06:56,780 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-12-17 07:07:30,591 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-12-17 07:07:32,661 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-12-17 07:07:32,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2021-12-17 07:07:32,677 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:07:32,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709245850] [2021-12-17 07:07:32,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709245850] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 07:07:32,677 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 07:07:32,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2021-12-17 07:07:32,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571261781] [2021-12-17 07:07:32,677 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 07:07:32,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-17 07:07:32,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:07:32,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-17 07:07:32,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=84, Unknown=3, NotChecked=38, Total=156 [2021-12-17 07:07:32,678 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 07:07:34,063 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:07:36,172 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:07:38,329 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (= |c_ULTIMATE.start_main_~y1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-12-17 07:07:41,061 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)))) (and (fp.geq .cse0 (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse4) .cse2))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) .cse2) (fp.div c_currentRoundingMode .cse4 .cse2))) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))))) is different from true [2021-12-17 07:07:43,404 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:07:43,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:07:43,523 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2021-12-17 07:07:43,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 07:07:43,527 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2021-12-17 07:07:43,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:07:43,528 INFO L225 Difference]: With dead ends: 42 [2021-12-17 07:07:43,528 INFO L226 Difference]: Without dead ends: 40 [2021-12-17 07:07:43,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=53, Invalid=140, Unknown=5, NotChecked=108, Total=306 [2021-12-17 07:07:43,529 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2021-12-17 07:07:43,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 78 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 2 Unknown, 56 Unchecked, 5.8s Time] [2021-12-17 07:07:43,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-17 07:07:43,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2021-12-17 07:07:43,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 07:07:43,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2021-12-17 07:07:43,542 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 19 [2021-12-17 07:07:43,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:07:43,542 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2021-12-17 07:07:43,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 07:07:43,542 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2021-12-17 07:07:43,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-17 07:07:43,543 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:07:43,543 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-17 07:07:43,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-17 07:07:43,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:07:43,748 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:07:43,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:07:43,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1943528346, now seen corresponding path program 2 times [2021-12-17 07:07:43,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:07:43,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2116259823] [2021-12-17 07:07:43,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 07:07:43,749 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:07:43,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:07:43,750 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:07:43,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-17 07:07:43,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 07:07:43,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 07:07:43,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-17 07:07:44,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:07:44,608 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 07:07:44,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 07:07:55,019 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-12-17 07:07:57,051 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-12-17 07:08:32,141 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-12-17 07:08:34,223 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-12-17 07:08:34,238 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 3 not checked. [2021-12-17 07:08:34,238 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:08:34,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2116259823] [2021-12-17 07:08:34,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2116259823] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 07:08:34,238 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 07:08:34,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2021-12-17 07:08:34,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708634451] [2021-12-17 07:08:34,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 07:08:34,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-17 07:08:34,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:08:34,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-17 07:08:34,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=83, Unknown=4, NotChecked=38, Total=156 [2021-12-17 07:08:34,239 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 07:08:36,265 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:08:38,372 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:08:40,626 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq .cse0 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (= |c_ULTIMATE.start_main_~y1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 16.0)))) is different from true [2021-12-17 07:08:43,364 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse4) .cse2))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) .cse2) (fp.div c_currentRoundingMode .cse4 .cse2))) (fp.geq .cse0 (_ +zero 8 24))))) is different from true [2021-12-17 07:08:45,761 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:08:45,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:08:45,867 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2021-12-17 07:08:45,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 07:08:45,873 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2021-12-17 07:08:45,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:08:45,873 INFO L225 Difference]: With dead ends: 40 [2021-12-17 07:08:45,874 INFO L226 Difference]: Without dead ends: 38 [2021-12-17 07:08:45,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=53, Invalid=139, Unknown=6, NotChecked=108, Total=306 [2021-12-17 07:08:45,874 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2021-12-17 07:08:45,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 81 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 3 Unknown, 59 Unchecked, 6.6s Time] [2021-12-17 07:08:45,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-17 07:08:45,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-12-17 07:08:45,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 07:08:45,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2021-12-17 07:08:45,879 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 24 [2021-12-17 07:08:45,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:08:45,879 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2021-12-17 07:08:45,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 07:08:45,880 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2021-12-17 07:08:45,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-17 07:08:45,880 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:08:45,880 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2021-12-17 07:08:45,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-17 07:08:46,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:08:46,081 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:08:46,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:08:46,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1358239522, now seen corresponding path program 3 times [2021-12-17 07:08:46,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:08:46,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559792948] [2021-12-17 07:08:46,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 07:08:46,083 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:08:46,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:08:46,084 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:08:46,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-17 07:08:46,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-17 07:08:46,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 07:08:46,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-17 07:08:46,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:08:48,333 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-17 07:08:48,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 07:08:58,760 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-12-17 07:09:00,790 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2021-12-17 07:09:35,592 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-12-17 07:09:37,673 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-12-17 07:10:14,146 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-12-17 07:10:16,271 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2021-12-17 07:10:16,296 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 8 not checked. [2021-12-17 07:10:16,296 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:10:16,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559792948] [2021-12-17 07:10:16,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [559792948] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 07:10:16,296 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 07:10:16,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2021-12-17 07:10:16,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652826795] [2021-12-17 07:10:16,296 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 07:10:16,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-17 07:10:16,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:10:16,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-17 07:10:16,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=101, Unknown=6, NotChecked=66, Total=210 [2021-12-17 07:10:16,297 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-17 07:10:18,325 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:10:20,540 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:10:22,693 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:10:24,951 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3)))))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (fp.geq .cse0 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~y1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-12-17 07:10:27,086 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3)))))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (fp.geq .cse0 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~y1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2021-12-17 07:10:29,183 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))) .cse1) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~y1~0#1|) .cse1)) .cse1)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse1))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) .cse1) (fp.div c_currentRoundingMode .cse3 .cse1))) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse4 (_ +zero 8 24))))) is different from true [2021-12-17 07:10:32,492 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse5) .cse2) (fp.div c_currentRoundingMode .cse6 .cse2))) (.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse5 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse6) .cse2))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2))) (fp.geq .cse4 (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) .cse2))) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0))))) is different from true [2021-12-17 07:10:34,932 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:10:35,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:10:35,108 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2021-12-17 07:10:35,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 07:10:35,109 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 31 [2021-12-17 07:10:35,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:10:35,110 INFO L225 Difference]: With dead ends: 55 [2021-12-17 07:10:35,110 INFO L226 Difference]: Without dead ends: 53 [2021-12-17 07:10:35,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=61, Invalid=163, Unknown=10, NotChecked=186, Total=420 [2021-12-17 07:10:35,111 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 8 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:10:35,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 78 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 35 Invalid, 4 Unknown, 98 Unchecked, 9.0s Time] [2021-12-17 07:10:35,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-17 07:10:35,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2021-12-17 07:10:35,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-17 07:10:35,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2021-12-17 07:10:35,116 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 31 [2021-12-17 07:10:35,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:10:35,116 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2021-12-17 07:10:35,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-17 07:10:35,116 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2021-12-17 07:10:35,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-17 07:10:35,117 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:10:35,117 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2021-12-17 07:10:35,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-12-17 07:10:35,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:10:35,323 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:10:35,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:10:35,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1721810214, now seen corresponding path program 4 times [2021-12-17 07:10:35,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:10:35,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810963682] [2021-12-17 07:10:35,324 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 07:10:35,324 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:10:35,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:10:35,329 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:10:35,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-17 07:10:35,681 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 07:10:35,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 07:10:35,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-17 07:10:35,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:10:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-17 07:10:38,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 07:10:48,968 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-12-17 07:10:50,998 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-12-17 07:11:25,296 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-12-17 07:11:27,379 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-12-17 07:12:03,871 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3)) .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3))) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-12-17 07:12:06,008 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3)) .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3))) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2021-12-17 07:12:06,041 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 10 not checked. [2021-12-17 07:12:06,041 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:12:06,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810963682] [2021-12-17 07:12:06,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810963682] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 07:12:06,041 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 07:12:06,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2021-12-17 07:12:06,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833720184] [2021-12-17 07:12:06,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 07:12:06,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-17 07:12:06,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:12:06,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-17 07:12:06,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=101, Unknown=6, NotChecked=66, Total=210 [2021-12-17 07:12:06,042 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2021-12-17 07:12:08,080 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:12:10,248 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:12:12,679 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3)) .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3))) .cse3)))))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (fp.geq .cse0 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~y1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-12-17 07:12:14,823 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3)) .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3))) .cse3)))))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (fp.geq .cse0 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~y1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2021-12-17 07:12:16,916 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 16.0))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq .cse0 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse4) .cse2))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) .cse2) (fp.div c_currentRoundingMode .cse4 .cse2)))))) is different from false [2021-12-17 07:12:19,000 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 16.0))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq .cse0 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse4) .cse2))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) .cse2) (fp.div c_currentRoundingMode .cse4 .cse2)))))) is different from true [2021-12-17 07:12:21,962 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse5) .cse3) (fp.div c_currentRoundingMode .cse6 .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse5 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse6) .cse3))) (.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3))) (fp.geq .cse0 (_ +zero 8 24))))) is different from true [2021-12-17 07:12:24,474 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:12:24,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:12:24,644 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2021-12-17 07:12:24,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 07:12:24,646 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 36 [2021-12-17 07:12:24,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:12:24,646 INFO L225 Difference]: With dead ends: 59 [2021-12-17 07:12:24,646 INFO L226 Difference]: Without dead ends: 55 [2021-12-17 07:12:24,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=61, Invalid=162, Unknown=11, NotChecked=186, Total=420 [2021-12-17 07:12:24,647 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 15 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:12:24,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 101 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 3 Unknown, 100 Unchecked, 7.0s Time] [2021-12-17 07:12:24,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-17 07:12:24,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2021-12-17 07:12:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-17 07:12:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2021-12-17 07:12:24,652 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 36 [2021-12-17 07:12:24,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:12:24,653 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2021-12-17 07:12:24,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2021-12-17 07:12:24,653 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2021-12-17 07:12:24,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-17 07:12:24,654 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:12:24,654 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2021-12-17 07:12:24,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-12-17 07:12:24,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:12:24,860 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:12:24,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:12:24,860 INFO L85 PathProgramCache]: Analyzing trace with hash 461079576, now seen corresponding path program 2 times [2021-12-17 07:12:24,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:12:24,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319763436] [2021-12-17 07:12:24,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 07:12:24,861 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:12:24,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:12:24,861 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:12:24,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-17 07:12:25,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 07:12:25,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 07:12:25,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 07:12:25,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:12:25,602 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-17 07:12:25,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 07:12:26,096 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-17 07:12:26,096 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:12:26,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319763436] [2021-12-17 07:12:26,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319763436] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 07:12:26,096 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 07:12:26,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-17 07:12:26,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210492447] [2021-12-17 07:12:26,096 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 07:12:26,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 07:12:26,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:12:26,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 07:12:26,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-17 07:12:26,097 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 7 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2021-12-17 07:12:28,219 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:12:30,447 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:12:32,665 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:12:34,891 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:12:35,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:12:35,567 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2021-12-17 07:12:35,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 07:12:35,567 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 7 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 43 [2021-12-17 07:12:35,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:12:35,568 INFO L225 Difference]: With dead ends: 72 [2021-12-17 07:12:35,568 INFO L226 Difference]: Without dead ends: 62 [2021-12-17 07:12:35,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2021-12-17 07:12:35,569 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 12 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:12:35,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 65 Invalid, 4 Unknown, 0 Unchecked, 9.0s Time] [2021-12-17 07:12:35,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-17 07:12:35,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-12-17 07:12:35,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-17 07:12:35,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2021-12-17 07:12:35,581 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 43 [2021-12-17 07:12:35,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:12:35,581 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2021-12-17 07:12:35,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 7 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2021-12-17 07:12:35,581 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2021-12-17 07:12:35,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-17 07:12:35,582 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:12:35,582 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1] [2021-12-17 07:12:35,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-17 07:12:35,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:12:35,796 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:12:35,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:12:35,797 INFO L85 PathProgramCache]: Analyzing trace with hash 462807454, now seen corresponding path program 5 times [2021-12-17 07:12:35,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:12:35,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069104407] [2021-12-17 07:12:35,797 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 07:12:35,797 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:12:35,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:12:35,798 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:12:35,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-17 07:12:36,349 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-12-17 07:12:36,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 07:12:36,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-17 07:12:36,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:12:43,308 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-17 07:12:43,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 07:12:53,082 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-12-17 07:12:55,120 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2021-12-17 07:13:29,705 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-12-17 07:13:31,789 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-12-17 07:14:08,246 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-12-17 07:14:10,387 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2021-12-17 07:14:48,303 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse6 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse5) .cse3) (fp.div c_currentRoundingMode .cse6 .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse5 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse6) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3))))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-12-17 07:14:50,504 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse6 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse5) .cse3) (fp.div c_currentRoundingMode .cse6 .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse5 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse6) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3))))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2021-12-17 07:14:50,533 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 18 not checked. [2021-12-17 07:14:50,533 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:14:50,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069104407] [2021-12-17 07:14:50,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069104407] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 07:14:50,533 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 07:14:50,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2021-12-17 07:14:50,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011423889] [2021-12-17 07:14:50,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 07:14:50,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-17 07:14:50,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:14:50,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-17 07:14:50,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=119, Unknown=10, NotChecked=100, Total=272 [2021-12-17 07:14:50,535 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 8 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2021-12-17 07:14:52,590 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:14:54,786 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:14:57,221 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:14:59,886 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse6 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse5) .cse3) (fp.div c_currentRoundingMode .cse6 .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse5 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse6) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3))))))) (and (fp.geq .cse0 (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (= |c_ULTIMATE.start_main_~y1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-12-17 07:15:02,082 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse6 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse5) .cse3) (fp.div c_currentRoundingMode .cse6 .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse5 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse6) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3))))))) (and (fp.geq .cse0 (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (= |c_ULTIMATE.start_main_~y1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2021-12-17 07:15:04,211 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse4 (let ((.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))) (.cse6 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~y1~0#1|) .cse1)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse5) .cse1) (fp.div c_currentRoundingMode .cse6 .cse1))) .cse1) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse5 .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse6) .cse1)) .cse1))))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse1))) (fp.geq .cse4 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) .cse1) (fp.div c_currentRoundingMode .cse3 .cse1))) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0))))) is different from false [2021-12-17 07:15:06,368 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse4 (let ((.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))) (.cse6 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~y1~0#1|) .cse1)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse5) .cse1) (fp.div c_currentRoundingMode .cse6 .cse1))) .cse1) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse5 .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse6) .cse1)) .cse1))))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse1))) (fp.geq .cse4 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) .cse1) (fp.div c_currentRoundingMode .cse3 .cse1))) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0))))) is different from true [2021-12-17 07:15:08,628 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse5) .cse2) (fp.div c_currentRoundingMode .cse6 .cse2))) (.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse5 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse6) .cse2))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) .cse2))) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse4 (_ +zero 8 24))))) is different from false [2021-12-17 07:15:10,727 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse5) .cse2) (fp.div c_currentRoundingMode .cse6 .cse2))) (.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse5 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse6) .cse2))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) .cse2))) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse4 (_ +zero 8 24))))) is different from true [2021-12-17 07:15:13,666 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse7 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse8 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse7) .cse3) (fp.div c_currentRoundingMode .cse8 .cse3))) (.cse6 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse7 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse8) .cse3)))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse5) .cse3) (fp.div c_currentRoundingMode .cse6 .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse5 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse6) .cse3)))) (and (fp.geq .cse0 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3))))))) is different from true [2021-12-17 07:15:16,365 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:15:16,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:15:16,485 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2021-12-17 07:15:16,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 07:15:16,490 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 8 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 43 [2021-12-17 07:15:16,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:15:16,491 INFO L225 Difference]: With dead ends: 74 [2021-12-17 07:15:16,491 INFO L226 Difference]: Without dead ends: 72 [2021-12-17 07:15:16,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 39.8s TimeCoverageRelationStatistics Valid=69, Invalid=186, Unknown=17, NotChecked=280, Total=552 [2021-12-17 07:15:16,492 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2021-12-17 07:15:16,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 102 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 4 Unknown, 139 Unchecked, 9.3s Time] [2021-12-17 07:15:16,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-17 07:15:16,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2021-12-17 07:15:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 46 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-17 07:15:16,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2021-12-17 07:15:16,497 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 43 [2021-12-17 07:15:16,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:15:16,497 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2021-12-17 07:15:16,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 8 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2021-12-17 07:15:16,497 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2021-12-17 07:15:16,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-17 07:15:16,498 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:15:16,498 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1] [2021-12-17 07:15:16,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-17 07:15:16,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:15:16,699 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:15:16,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:15:16,699 INFO L85 PathProgramCache]: Analyzing trace with hash -325991910, now seen corresponding path program 6 times [2021-12-17 07:15:16,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:15:16,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011575138] [2021-12-17 07:15:16,700 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-17 07:15:16,700 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:15:16,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:15:16,701 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:15:16,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-17 07:15:17,215 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-12-17 07:15:17,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 07:15:17,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-17 07:15:17,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:15:29,184 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 18 proven. 35 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-17 07:15:29,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 07:15:49,646 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (_ +zero 8 24)))) (not (fp.leq .cse4 .cse1)) (not (fp.geq .cse4 (_ +zero 8 24)))))) is different from false [2021-12-17 07:15:51,704 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (_ +zero 8 24)))) (not (fp.leq .cse4 .cse1)) (not (fp.geq .cse4 (_ +zero 8 24)))))) is different from true [2021-12-17 07:17:01,492 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~x1~0#1|) .cse4) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse4))) (.cse6 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~y1~0#1|) .cse4)))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse3) .cse4) (fp.div c_currentRoundingMode .cse6 .cse4))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (not (fp.geq .cse0 (_ +zero 8 24))) (not (fp.leq .cse0 .cse1)) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse3 .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse6) .cse4)))) (and (fp.leq .cse2 .cse1) (fp.geq .cse2 (_ +zero 8 24)))))))) is different from false [2021-12-17 07:17:03,621 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~x1~0#1|) .cse4) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse4))) (.cse6 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~y1~0#1|) .cse4)))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse3) .cse4) (fp.div c_currentRoundingMode .cse6 .cse4))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (not (fp.geq .cse0 (_ +zero 8 24))) (not (fp.leq .cse0 .cse1)) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse3 .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse6) .cse4)))) (and (fp.leq .cse2 .cse1) (fp.geq .cse2 (_ +zero 8 24)))))))) is different from true [2021-12-17 07:18:16,499 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse7 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse8 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse7) .cse3) (fp.div c_currentRoundingMode .cse8 .cse3))) (.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse7 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse8) .cse3)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse6 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse2) .cse3) (fp.div c_currentRoundingMode .cse5 .cse3)))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse5) .cse3)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 .cse1))) (not (fp.leq .cse6 .cse1)) (not (fp.geq .cse6 (_ +zero 8 24)))))))) is different from false [2021-12-17 07:18:18,684 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse7 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse8 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse7) .cse3) (fp.div c_currentRoundingMode .cse8 .cse3))) (.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse7 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse8) .cse3)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse6 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse2) .cse3) (fp.div c_currentRoundingMode .cse5 .cse3)))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse5) .cse3)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 .cse1))) (not (fp.leq .cse6 .cse1)) (not (fp.geq .cse6 (_ +zero 8 24)))))))) is different from true [2021-12-17 07:19:34,434 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse9 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse10 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (let ((.cse7 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse9) .cse3) (fp.div c_currentRoundingMode .cse10 .cse3))) (.cse8 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse9 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse10) .cse3)))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse7) .cse3) (fp.div c_currentRoundingMode .cse8 .cse3))) (.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse7 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse8) .cse3)))) (let ((.cse6 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse2) .cse3) (fp.div c_currentRoundingMode .cse5 .cse3))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse5) .cse3)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 .cse1))) (not (fp.geq .cse6 (_ +zero 8 24))) (not (fp.leq .cse6 .cse1)))))))) is different from false [2021-12-17 07:19:36,687 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse9 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse10 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (let ((.cse7 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse9) .cse3) (fp.div c_currentRoundingMode .cse10 .cse3))) (.cse8 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse9 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse10) .cse3)))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse7) .cse3) (fp.div c_currentRoundingMode .cse8 .cse3))) (.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse7 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse8) .cse3)))) (let ((.cse6 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse2) .cse3) (fp.div c_currentRoundingMode .cse5 .cse3))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse5) .cse3)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 .cse1))) (not (fp.geq .cse6 (_ +zero 8 24))) (not (fp.leq .cse6 .cse1)))))))) is different from true [2021-12-17 07:19:36,708 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 66 trivial. 21 not checked. [2021-12-17 07:19:36,708 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:19:36,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011575138] [2021-12-17 07:19:36,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011575138] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 07:19:36,708 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 07:19:36,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2021-12-17 07:19:36,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546712047] [2021-12-17 07:19:36,709 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 07:19:36,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-17 07:19:36,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:19:36,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-17 07:19:36,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=240, Unknown=12, NotChecked=140, Total=462 [2021-12-17 07:19:36,710 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand has 22 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 19 states have internal predecessors, (35), 10 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2021-12-17 07:19:38,800 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:19:41,066 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:19:43,668 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse9 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse10 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (let ((.cse7 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse9) .cse3) (fp.div c_currentRoundingMode .cse10 .cse3))) (.cse8 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse9 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse10) .cse3)))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse7) .cse3) (fp.div c_currentRoundingMode .cse8 .cse3))) (.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse7 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse8) .cse3)))) (let ((.cse6 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse2) .cse3) (fp.div c_currentRoundingMode .cse5 .cse3))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse5) .cse3)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 .cse1))) (not (fp.geq .cse6 (_ +zero 8 24))) (not (fp.leq .cse6 .cse1)))))))) (= |c_ULTIMATE.start_main_~y1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 16.0))) is different from true [2021-12-17 07:19:45,875 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse1))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) .cse1) (fp.div c_currentRoundingMode .cse3 .cse1))) (let ((.cse9 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))) (.cse10 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~y1~0#1|) .cse1)))) (let ((.cse6 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse9) .cse1) (fp.div c_currentRoundingMode .cse10 .cse1))) (.cse7 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse9 .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse10) .cse1)))) (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse8 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse6) .cse1) (fp.div c_currentRoundingMode .cse7 .cse1)))) (or (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse6 .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse7) .cse1)))) (and (fp.geq .cse4 (_ +zero 8 24)) (fp.leq .cse4 .cse5))) (not (fp.leq .cse8 .cse5)) (not (fp.geq .cse8 (_ +zero 8 24))))))))) is different from true [2021-12-17 07:19:48,380 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse9 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse10 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse9) .cse2) (fp.div c_currentRoundingMode .cse10 .cse2))) (.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse9 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse10) .cse2)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) .cse2))) (let ((.cse7 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) (.cse8 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse7) .cse2) (fp.div c_currentRoundingMode .cse8 .cse2))) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (not (fp.geq .cse4 (_ +zero 8 24))) (not (fp.leq .cse4 .cse5)) (let ((.cse6 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse7 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse8) .cse2)))) (and (fp.leq .cse6 .cse5) (fp.geq .cse6 (_ +zero 8 24)))))))))) is different from false [2021-12-17 07:19:50,512 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse9 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse10 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse9) .cse2) (fp.div c_currentRoundingMode .cse10 .cse2))) (.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse9 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse10) .cse2)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) .cse2))) (let ((.cse7 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) (.cse8 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse7) .cse2) (fp.div c_currentRoundingMode .cse8 .cse2))) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (not (fp.geq .cse4 (_ +zero 8 24))) (not (fp.leq .cse4 .cse5)) (let ((.cse6 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse7 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse8) .cse2)))) (and (fp.leq .cse6 .cse5) (fp.geq .cse6 (_ +zero 8 24)))))))))) is different from true [2021-12-17 07:19:52,577 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse9 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse10 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse7 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse9) .cse2) (fp.div c_currentRoundingMode .cse10 .cse2))) (.cse8 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse9 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse10) .cse2)))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse7) .cse2) (fp.div c_currentRoundingMode .cse8 .cse2))) (.cse6 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse7 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse8) .cse2)))) (and (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (_ +zero 8 24)))) (not (fp.leq .cse4 .cse1)) (not (fp.geq .cse4 (_ +zero 8 24))))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse5) .cse2) (fp.div c_currentRoundingMode .cse6 .cse2))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse5 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse6) .cse2))))))) is different from false [2021-12-17 07:19:54,645 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse9 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse10 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse7 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse9) .cse2) (fp.div c_currentRoundingMode .cse10 .cse2))) (.cse8 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse9 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse10) .cse2)))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse7) .cse2) (fp.div c_currentRoundingMode .cse8 .cse2))) (.cse6 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse7 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse8) .cse2)))) (and (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (_ +zero 8 24)))) (not (fp.leq .cse4 .cse1)) (not (fp.geq .cse4 (_ +zero 8 24))))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse5) .cse2) (fp.div c_currentRoundingMode .cse6 .cse2))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse5 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse6) .cse2))))))) is different from true [2021-12-17 07:19:57,438 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:19:58,879 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:20:00,249 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:20:02,049 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:20:04,060 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:20:07,027 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:20:07,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:20:07,764 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2021-12-17 07:20:07,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-17 07:20:07,771 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 19 states have internal predecessors, (35), 10 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Word has length 48 [2021-12-17 07:20:07,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:20:07,773 INFO L225 Difference]: With dead ends: 76 [2021-12-17 07:20:07,773 INFO L226 Difference]: Without dead ends: 74 [2021-12-17 07:20:07,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 42.6s TimeCoverageRelationStatistics Valid=121, Invalid=399, Unknown=18, NotChecked=392, Total=930 [2021-12-17 07:20:07,774 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 25 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 13 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2021-12-17 07:20:07,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 73 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 154 Invalid, 4 Unknown, 150 Unchecked, 17.2s Time] [2021-12-17 07:20:07,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-12-17 07:20:07,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-12-17 07:20:07,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 49 states have internal predecessors, (50), 15 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-17 07:20:07,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2021-12-17 07:20:07,786 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 48 [2021-12-17 07:20:07,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:20:07,786 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2021-12-17 07:20:07,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 19 states have internal predecessors, (35), 10 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2021-12-17 07:20:07,786 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2021-12-17 07:20:07,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-17 07:20:07,789 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:20:07,789 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1] [2021-12-17 07:20:07,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-17 07:20:07,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:20:07,995 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:20:07,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:20:07,996 INFO L85 PathProgramCache]: Analyzing trace with hash -642663842, now seen corresponding path program 7 times [2021-12-17 07:20:07,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:20:07,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711289509] [2021-12-17 07:20:07,996 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-17 07:20:07,996 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:20:07,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:20:07,997 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:20:07,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-17 07:20:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:20:08,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-17 07:20:08,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... Killed by 15