java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/floats-esbmc-regression/digits_bad_while_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 15:54:03,190 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 15:54:03,192 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 15:54:03,205 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 15:54:03,205 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 15:54:03,206 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 15:54:03,208 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 15:54:03,210 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 15:54:03,212 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 15:54:03,212 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 15:54:03,213 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 15:54:03,214 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 15:54:03,215 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 15:54:03,216 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 15:54:03,217 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 15:54:03,218 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 15:54:03,219 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 15:54:03,221 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 15:54:03,223 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 15:54:03,224 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 15:54:03,226 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 15:54:03,227 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 15:54:03,230 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 15:54:03,230 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 15:54:03,230 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 15:54:03,231 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 15:54:03,232 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 15:54:03,233 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 15:54:03,234 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 15:54:03,235 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 15:54:03,235 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 15:54:03,236 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 15:54:03,236 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 15:54:03,237 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 15:54:03,238 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 15:54:03,239 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 15:54:03,239 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-19 15:54:03,255 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 15:54:03,255 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 15:54:03,256 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 15:54:03,256 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 15:54:03,257 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 15:54:03,257 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 15:54:03,257 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 15:54:03,257 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 15:54:03,258 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 15:54:03,258 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 15:54:03,258 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 15:54:03,258 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 15:54:03,258 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 15:54:03,259 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 15:54:03,259 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 15:54:03,259 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 15:54:03,259 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 15:54:03,259 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 15:54:03,259 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 15:54:03,260 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 15:54:03,260 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 15:54:03,260 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 15:54:03,260 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 15:54:03,260 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 15:54:03,261 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 15:54:03,261 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 15:54:03,261 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 15:54:03,261 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 15:54:03,261 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 15:54:03,262 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 15:54:03,262 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 15:54:03,262 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 15:54:03,314 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 15:54:03,328 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 15:54:03,333 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 15:54:03,335 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 15:54:03,335 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 15:54:03,336 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-esbmc-regression/digits_bad_while_false-unreach-call.i [2018-09-19 15:54:03,710 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f266872b2/b209c9700a0243bbb4d63ac75ace3c97/FLAGb27062f14 [2018-09-19 15:54:03,904 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 15:54:03,904 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/digits_bad_while_false-unreach-call.i [2018-09-19 15:54:03,912 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f266872b2/b209c9700a0243bbb4d63ac75ace3c97/FLAGb27062f14 [2018-09-19 15:54:03,930 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f266872b2/b209c9700a0243bbb4d63ac75ace3c97 [2018-09-19 15:54:03,944 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 15:54:03,950 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 15:54:03,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 15:54:03,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 15:54:03,957 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 15:54:03,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:54:03" (1/1) ... [2018-09-19 15:54:03,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474e9d86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:54:03, skipping insertion in model container [2018-09-19 15:54:03,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:54:03" (1/1) ... [2018-09-19 15:54:03,974 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 15:54:04,173 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:54:04,194 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 15:54:04,206 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:54:04,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:54:04 WrapperNode [2018-09-19 15:54:04,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 15:54:04,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 15:54:04,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 15:54:04,224 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 15:54:04,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:54:04" (1/1) ... [2018-09-19 15:54:04,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:54:04" (1/1) ... [2018-09-19 15:54:04,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:54:04" (1/1) ... [2018-09-19 15:54:04,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:54:04" (1/1) ... [2018-09-19 15:54:04,249 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:54:04" (1/1) ... [2018-09-19 15:54:04,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:54:04" (1/1) ... [2018-09-19 15:54:04,256 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:54:04" (1/1) ... [2018-09-19 15:54:04,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 15:54:04,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 15:54:04,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 15:54:04,260 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 15:54:04,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:54:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 15:54:04,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 15:54:04,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 15:54:04,339 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-19 15:54:04,339 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 15:54:04,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 15:54:04,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-19 15:54:04,339 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 15:54:04,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 15:54:04,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 15:54:06,745 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 15:54:06,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:54:06 BoogieIcfgContainer [2018-09-19 15:54:06,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 15:54:06,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 15:54:06,749 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 15:54:06,761 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 15:54:06,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 03:54:03" (1/3) ... [2018-09-19 15:54:06,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca3f7ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:54:06, skipping insertion in model container [2018-09-19 15:54:06,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:54:04" (2/3) ... [2018-09-19 15:54:06,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca3f7ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:54:06, skipping insertion in model container [2018-09-19 15:54:06,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:54:06" (3/3) ... [2018-09-19 15:54:06,765 INFO L112 eAbstractionObserver]: Analyzing ICFG digits_bad_while_false-unreach-call.i [2018-09-19 15:54:06,777 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 15:54:06,788 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 15:54:06,858 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 15:54:06,859 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 15:54:06,859 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 15:54:06,860 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 15:54:06,860 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 15:54:06,860 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 15:54:06,860 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 15:54:06,860 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 15:54:06,861 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 15:54:06,880 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-09-19 15:54:06,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-19 15:54:06,887 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:54:06,888 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:54:06,890 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:54:06,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1871509567, now seen corresponding path program 1 times [2018-09-19 15:54:06,902 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:54:06,903 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 15:54:06,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-19 15:54:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:54:06,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:54:06,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:54:06,994 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:54:07,007 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:54:07,007 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 15:54:07,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 15:54:07,024 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 15:54:07,024 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 15:54:07,027 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-09-19 15:54:07,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:54:07,047 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-09-19 15:54:07,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 15:54:07,050 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-09-19 15:54:07,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:54:07,062 INFO L225 Difference]: With dead ends: 31 [2018-09-19 15:54:07,062 INFO L226 Difference]: Without dead ends: 12 [2018-09-19 15:54:07,065 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 15:54:07,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-19 15:54:07,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-19 15:54:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-19 15:54:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-19 15:54:07,104 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-09-19 15:54:07,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:54:07,104 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-19 15:54:07,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 15:54:07,105 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-19 15:54:07,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-19 15:54:07,107 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:54:07,108 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:54:07,108 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:54:07,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1861991801, now seen corresponding path program 1 times [2018-09-19 15:54:07,109 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:54:07,109 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-19 15:54:07,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:54:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:54:07,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:54:07,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:54:07,211 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:54:07,221 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:54:07,221 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-19 15:54:07,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-19 15:54:07,224 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-19 15:54:07,224 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 15:54:07,224 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-09-19 15:54:09,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:54:09,528 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-19 15:54:09,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-19 15:54:09,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-09-19 15:54:09,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:54:09,531 INFO L225 Difference]: With dead ends: 19 [2018-09-19 15:54:09,532 INFO L226 Difference]: Without dead ends: 14 [2018-09-19 15:54:09,533 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 15:54:09,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-19 15:54:09,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-19 15:54:09,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-19 15:54:09,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-19 15:54:09,538 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-09-19 15:54:09,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:54:09,538 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-19 15:54:09,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-19 15:54:09,539 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-19 15:54:09,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-19 15:54:09,539 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:54:09,540 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:54:09,540 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:54:09,540 INFO L82 PathProgramCache]: Analyzing trace with hash -661808769, now seen corresponding path program 1 times [2018-09-19 15:54:09,541 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:54:09,541 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-19 15:54:09,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:54:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:54:10,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:54:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:54:10,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:54:14,488 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:54:14,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-09-19 15:54:14,583 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:54:14,583 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-09-19 15:54:14,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 15:54:14,584 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 15:54:14,584 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=12, Unknown=1, NotChecked=6, Total=30 [2018-09-19 15:54:14,585 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 6 states. [2018-09-19 15:54:16,684 WARN L819 $PredicateComparison]: unable to prove that (and (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) (= ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))) c_main_~x~0)) is different from true [2018-09-19 15:54:23,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:54:23,177 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-19 15:54:23,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 15:54:23,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-09-19 15:54:23,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:54:23,263 INFO L225 Difference]: With dead ends: 21 [2018-09-19 15:54:23,263 INFO L226 Difference]: Without dead ends: 16 [2018-09-19 15:54:23,263 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=13, Invalid=13, Unknown=2, NotChecked=14, Total=42 [2018-09-19 15:54:23,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-19 15:54:23,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-19 15:54:23,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-19 15:54:23,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-19 15:54:23,269 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-09-19 15:54:23,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:54:23,269 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-19 15:54:23,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 15:54:23,269 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-19 15:54:23,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-19 15:54:23,270 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:54:23,270 INFO L376 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:54:23,271 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:54:23,271 INFO L82 PathProgramCache]: Analyzing trace with hash 622365701, now seen corresponding path program 2 times [2018-09-19 15:54:23,271 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:54:23,272 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-19 15:54:23,280 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-09-19 15:54:24,547 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-19 15:54:24,547 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:54:24,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:54:24,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:54:24,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:54:27,015 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:54:29,094 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:54:31,248 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:54:33,392 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:54:33,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-09-19 15:54:33,448 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:54:33,449 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-09-19 15:54:33,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-19 15:54:33,450 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-19 15:54:33,450 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=18, Unknown=4, NotChecked=18, Total=56 [2018-09-19 15:54:33,451 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 8 states. [2018-09-19 15:54:35,607 WARN L819 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) (= ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))) c_main_~x~0)) is different from true [2018-09-19 15:54:37,697 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:54:40,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:54:40,038 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-19 15:54:40,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-19 15:54:40,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-09-19 15:54:40,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:54:40,041 INFO L225 Difference]: With dead ends: 23 [2018-09-19 15:54:40,041 INFO L226 Difference]: Without dead ends: 18 [2018-09-19 15:54:40,042 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=20, Invalid=20, Unknown=6, NotChecked=44, Total=90 [2018-09-19 15:54:40,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-19 15:54:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-09-19 15:54:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-19 15:54:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-09-19 15:54:40,053 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-09-19 15:54:40,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:54:40,054 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-09-19 15:54:40,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-19 15:54:40,054 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-09-19 15:54:40,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-19 15:54:40,055 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:54:40,055 INFO L376 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:54:40,055 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:54:40,056 INFO L82 PathProgramCache]: Analyzing trace with hash 2058417419, now seen corresponding path program 3 times [2018-09-19 15:54:40,056 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:54:40,059 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-19 15:54:40,069 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-09-19 15:54:42,134 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-19 15:54:42,134 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:54:42,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:54:42,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:54:42,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:54:44,697 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:54:46,782 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:54:48,940 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:54:51,088 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:54:53,326 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:54:55,567 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:54:55,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2018-09-19 15:54:55,651 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:54:55,651 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-09-19 15:54:55,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 15:54:55,652 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 15:54:55,652 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=27, Unknown=6, NotChecked=36, Total=90 [2018-09-19 15:54:55,653 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 10 states. [2018-09-19 15:54:57,918 WARN L819 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) (= ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))) c_main_~x~0)) is different from true [2018-09-19 15:55:00,093 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (not (fp.eq (let ((.cse2 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))) ((_ to_fp 15 113) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:55:02,198 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:55:12,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:55:12,640 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-19 15:55:12,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 15:55:12,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-09-19 15:55:12,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:55:12,744 INFO L225 Difference]: With dead ends: 25 [2018-09-19 15:55:12,745 INFO L226 Difference]: Without dead ends: 20 [2018-09-19 15:55:12,745 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=27, Invalid=30, Unknown=9, NotChecked=90, Total=156 [2018-09-19 15:55:12,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-19 15:55:12,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-19 15:55:12,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-19 15:55:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-09-19 15:55:12,752 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-09-19 15:55:12,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:55:12,752 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-09-19 15:55:12,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 15:55:12,753 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-09-19 15:55:12,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-19 15:55:12,753 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:55:12,753 INFO L376 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:55:12,754 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:55:12,754 INFO L82 PathProgramCache]: Analyzing trace with hash -875350895, now seen corresponding path program 4 times [2018-09-19 15:55:12,755 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:55:12,755 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-19 15:55:12,760 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-19 15:55:15,309 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-19 15:55:15,310 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:55:15,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:55:15,880 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:55:15,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:55:17,996 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:55:20,067 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:55:22,227 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:55:24,386 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:55:26,646 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:55:28,879 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:55:31,182 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:55:33,489 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:55:33,515 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 20 not checked. [2018-09-19 15:55:33,573 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:55:33,573 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-09-19 15:55:33,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 15:55:33,574 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 15:55:33,574 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=38, Unknown=8, NotChecked=60, Total=132 [2018-09-19 15:55:33,578 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 12 states. [2018-09-19 15:55:35,915 WARN L819 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) (= ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))) c_main_~x~0)) is different from true [2018-09-19 15:55:38,156 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (not (fp.eq (let ((.cse2 (let ((.cse3 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))) ((_ to_fp 15 113) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:55:40,327 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (not (fp.eq (let ((.cse3 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))) ((_ to_fp 15 113) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:55:42,408 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:55:56,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:55:56,369 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-19 15:55:56,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-19 15:55:56,474 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-09-19 15:55:56,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:55:56,475 INFO L225 Difference]: With dead ends: 27 [2018-09-19 15:55:56,475 INFO L226 Difference]: Without dead ends: 22 [2018-09-19 15:55:56,476 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=34, Invalid=42, Unknown=12, NotChecked=152, Total=240 [2018-09-19 15:55:56,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-19 15:55:56,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-09-19 15:55:56,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-19 15:55:56,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-09-19 15:55:56,483 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-09-19 15:55:56,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:55:56,484 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-09-19 15:55:56,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 15:55:56,484 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-09-19 15:55:56,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-19 15:55:56,485 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:55:56,485 INFO L376 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:55:56,486 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:55:56,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1566812823, now seen corresponding path program 5 times [2018-09-19 15:55:56,486 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:55:56,487 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-19 15:55:56,492 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-09-19 15:56:02,760 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-19 15:56:02,760 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:56:03,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:56:03,592 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:56:03,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:56:05,707 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:56:07,781 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:56:09,949 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (fp.eq c_main_~x~0 .cse0) (not (fp.eq (let ((.cse2 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse1 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse2) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse1 .cse2) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse1)))))) .cse0)))) is different from false [2018-09-19 15:56:12,112 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (fp.eq c_main_~x~0 .cse0) (not (fp.eq (let ((.cse2 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse1 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse2) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse1 .cse2) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse1)))))) .cse0)))) is different from true [2018-09-19 15:56:14,350 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse2 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0))))) (.cse3 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) .cse3)) (fp.eq .cse2 .cse3) (fp.eq c_main_~x~0 .cse3)))) is different from false [2018-09-19 15:56:16,581 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse2 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0))))) (.cse3 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) .cse3)) (fp.eq .cse2 .cse3) (fp.eq c_main_~x~0 .cse3)))) is different from true [2018-09-19 15:56:18,900 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse4 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (let ((.cse2 (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))) (.cse3 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) .cse3)) (fp.eq .cse4 .cse3) (fp.eq .cse2 .cse3))))) is different from false [2018-09-19 15:56:21,256 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse4 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (let ((.cse2 (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))) (.cse3 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) .cse3)) (fp.eq .cse4 .cse3) (fp.eq .cse2 .cse3))))) is different from true [2018-09-19 15:56:23,652 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse4 (let ((.cse5 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse5 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (let ((.cse0 (fp.sub RNE (fp.mul RNE .cse4 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))) (.cse1 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (fp.eq .cse0 .cse1) (not (fp.eq (let ((.cse2 (fp.sub RNE (fp.mul RNE .cse0 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))) .cse1)) (fp.eq .cse4 .cse1))))) is different from false [2018-09-19 15:56:26,057 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse4 (let ((.cse5 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse5 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (let ((.cse0 (fp.sub RNE (fp.mul RNE .cse4 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))) (.cse1 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (fp.eq .cse0 .cse1) (not (fp.eq (let ((.cse2 (fp.sub RNE (fp.mul RNE .cse0 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))) .cse1)) (fp.eq .cse4 .cse1))))) is different from true [2018-09-19 15:56:26,089 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 30 not checked. [2018-09-19 15:56:26,165 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:56:26,165 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-09-19 15:56:26,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 15:56:26,166 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 15:56:26,166 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=51, Unknown=10, NotChecked=90, Total=182 [2018-09-19 15:56:26,167 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 14 states. [2018-09-19 15:56:28,625 WARN L819 $PredicateComparison]: unable to prove that (and (let ((.cse3 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse4 (let ((.cse5 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse5 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (let ((.cse0 (fp.sub RNE (fp.mul RNE .cse4 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))) (.cse1 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (fp.eq .cse0 .cse1) (not (fp.eq (let ((.cse2 (fp.sub RNE (fp.mul RNE .cse0 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))) .cse1)) (fp.eq .cse4 .cse1))))) (= ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))) c_main_~x~0)) is different from true [2018-09-19 15:56:30,987 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (let ((.cse5 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (let ((.cse3 (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))) (.cse4 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (not (fp.eq (let ((.cse2 (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))) .cse4)) (fp.eq .cse5 .cse4) (fp.eq .cse3 .cse4)))))) is different from true [2018-09-19 15:56:33,249 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (let ((.cse2 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0))))) (.cse3 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) .cse3)) (fp.eq .cse2 .cse3) (fp.eq c_main_~x~0 .cse3))) (= (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))) c_main_~x~0))) is different from true [2018-09-19 15:56:35,433 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (let ((.cse4 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (fp.eq c_main_~x~0 .cse4) (not (fp.eq (let ((.cse5 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))) .cse4)))))) is different from true [2018-09-19 15:56:37,532 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:56:52,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:56:52,095 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-19 15:56:52,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-19 15:56:52,207 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-09-19 15:56:52,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:56:52,208 INFO L225 Difference]: With dead ends: 29 [2018-09-19 15:56:52,208 INFO L226 Difference]: Without dead ends: 24 [2018-09-19 15:56:52,209 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.1s TimeCoverageRelationStatistics Valid=41, Invalid=56, Unknown=15, NotChecked=230, Total=342 [2018-09-19 15:56:52,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-19 15:56:52,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-19 15:56:52,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-19 15:56:52,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-09-19 15:56:52,217 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-09-19 15:56:52,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:56:52,217 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-09-19 15:56:52,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 15:56:52,218 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-09-19 15:56:52,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-19 15:56:52,219 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:56:52,219 INFO L376 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:56:52,219 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:56:52,219 INFO L82 PathProgramCache]: Analyzing trace with hash -860965091, now seen corresponding path program 6 times [2018-09-19 15:56:52,220 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:56:52,220 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-09-19 15:56:52,224 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2018-09-19 15:56:56,616 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-19 15:56:56,617 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 15:56:57,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:56:57,399 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:56:57,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:56:59,518 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:57:01,598 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:57:03,762 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:57:05,917 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:57:08,174 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) .cse3)) (fp.eq c_main_~x~0 .cse3))) is different from false [2018-09-19 15:57:10,415 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) .cse3)) (fp.eq c_main_~x~0 .cse3))) is different from true [2018-09-19 15:57:12,746 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse3 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0))))) (.cse4 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) .cse4)) (fp.eq .cse3 .cse4)))) is different from false [2018-09-19 15:57:15,087 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse3 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0))))) (.cse4 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) .cse4)) (fp.eq .cse3 .cse4)))) is different from true [2018-09-19 15:57:17,514 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse3 (let ((.cse5 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5)))))) (.cse4 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) .cse4)) (fp.eq .cse3 .cse4)))) is different from false [2018-09-19 15:57:19,943 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse3 (let ((.cse5 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5)))))) (.cse4 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) .cse4)) (fp.eq .cse3 .cse4)))) is different from true [2018-09-19 15:57:22,499 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse5 (let ((.cse6 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse6 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse6))))))) (fp.sub RNE (fp.mul RNE .cse5 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5)))))) (.cse1 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (fp.eq .cse0 .cse1) (not (fp.eq (let ((.cse2 (let ((.cse4 (fp.sub RNE (fp.mul RNE .cse0 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) (fp.sub RNE (fp.mul RNE .cse4 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))) .cse1))))) is different from false [2018-09-19 15:57:25,005 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse5 (let ((.cse6 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse6 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse6))))))) (fp.sub RNE (fp.mul RNE .cse5 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5)))))) (.cse1 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (fp.eq .cse0 .cse1) (not (fp.eq (let ((.cse2 (let ((.cse4 (fp.sub RNE (fp.mul RNE .cse0 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) (fp.sub RNE (fp.mul RNE .cse4 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))) .cse1))))) is different from true [2018-09-19 15:57:25,042 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 42 not checked. [2018-09-19 15:57:25,125 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:57:25,125 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-09-19 15:57:25,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-19 15:57:25,126 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-19 15:57:25,127 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=66, Unknown=12, NotChecked=126, Total=240 [2018-09-19 15:57:25,127 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 16 states. [2018-09-19 15:57:27,657 WARN L819 $PredicateComparison]: unable to prove that (and (let ((.cse3 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse5 (let ((.cse6 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse6 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse6))))))) (fp.sub RNE (fp.mul RNE .cse5 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5)))))) (.cse1 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (fp.eq .cse0 .cse1) (not (fp.eq (let ((.cse2 (let ((.cse4 (fp.sub RNE (fp.mul RNE .cse0 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) (fp.sub RNE (fp.mul RNE .cse4 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse3) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))) .cse1))))) (= ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))) c_main_~x~0)) is different from true [2018-09-19 15:57:30,104 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (let ((.cse4 (let ((.cse6 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse6 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse6)))))) (.cse5 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (not (fp.eq (let ((.cse2 (let ((.cse3 (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4)))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))) .cse5)) (fp.eq .cse4 .cse5))))) is different from true [2018-09-19 15:57:32,469 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (let ((.cse3 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0))))) (.cse4 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) .cse4)) (fp.eq .cse3 .cse4))) (= (let ((.cse5 (let ((.cse6 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse6 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse6))))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))) c_main_~x~0))) is different from true [2018-09-19 15:57:34,741 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (let ((.cse6 ((_ to_fp 15 113) RNE (_ bv0 32)))) (or (not (fp.eq (let ((.cse4 (let ((.cse5 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))) .cse6)) (fp.eq c_main_~x~0 .cse6))))) is different from true [2018-09-19 15:57:36,919 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (not (fp.eq (let ((.cse5 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))) ((_ to_fp 15 113) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:57:39,009 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse0) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) (= c_main_~x~0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse5 .cse0) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse0) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse0) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse0) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse1 .cse0) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse1)))))))) is different from true [2018-09-19 15:57:54,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:57:54,777 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-19 15:57:54,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-19 15:57:54,939 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-09-19 15:57:54,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:57:54,941 INFO L225 Difference]: With dead ends: 31 [2018-09-19 15:57:54,941 INFO L226 Difference]: Without dead ends: 26 [2018-09-19 15:57:54,942 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.7s TimeCoverageRelationStatistics Valid=48, Invalid=72, Unknown=18, NotChecked=324, Total=462 [2018-09-19 15:57:54,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-19 15:57:54,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-19 15:57:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-19 15:57:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-19 15:57:54,956 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-09-19 15:57:54,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:57:54,956 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-19 15:57:54,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-19 15:57:54,956 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-19 15:57:54,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-19 15:57:54,957 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:57:54,957 INFO L376 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:57:54,958 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:57:54,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1788298717, now seen corresponding path program 7 times [2018-09-19 15:57:54,958 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:57:54,959 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 15:57:54,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-09-19 15:57:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:58:00,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:58:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:58:00,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 15:58:02,770 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:58:04,849 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 ((_ to_fp 15 113) RNE (_ bv10 32))) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:58:07,042 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:58:09,196 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:58:11,441 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:58:13,713 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:58:16,084 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:58:18,457 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:58:20,882 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:58:23,346 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:58:25,876 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:58:28,407 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:58:31,022 WARN L797 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse6 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse6))))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from false [2018-09-19 15:58:33,634 WARN L819 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse6 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse6))))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) is different from true [2018-09-19 15:58:33,677 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 56 not checked. [2018-09-19 15:58:33,765 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 15:58:33,765 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-09-19 15:58:33,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-19 15:58:33,766 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-19 15:58:33,766 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=83, Unknown=14, NotChecked=168, Total=306 [2018-09-19 15:58:33,767 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 18 states. [2018-09-19 15:58:36,403 WARN L819 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse6 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse6))))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) (= ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))) c_main_~x~0)) is different from true [2018-09-19 15:58:38,949 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (not (fp.eq (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse6 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse6))))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))) ((_ to_fp 15 113) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:58:41,403 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (not (fp.eq (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) (= (let ((.cse5 (let ((.cse6 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse6 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse6))))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))) c_main_~x~0))) is different from true [2018-09-19 15:58:43,772 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (not (fp.eq (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) ((_ to_fp 15 113) RNE (_ bv0 32)))) (= (let ((.cse4 (let ((.cse5 (let ((.cse6 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse6 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse6))))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))) c_main_~x~0))) is different from true [2018-09-19 15:58:46,045 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (not (fp.eq (let ((.cse5 (let ((.cse6 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse6 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse6))))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))) ((_ to_fp 15 113) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:58:48,228 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= c_main_~x~0 (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0)))))) (not (fp.eq (let ((.cse6 (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))))) (fp.sub RNE (fp.mul RNE .cse6 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse6))))) ((_ to_fp 15 113) RNE (_ bv0 32)))))) is different from true [2018-09-19 15:58:50,325 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) RNE (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 ((_ to_fp 15 113) RNE (fp.div RNE ((_ to_fp 11 53) RNE 1.0) ((_ to_fp 11 53) RNE 7.0))))) (fp.sub RNE (fp.mul RNE .cse6 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse6))))))) (fp.sub RNE (fp.mul RNE .cse5 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse5))))))) (fp.sub RNE (fp.mul RNE .cse4 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse4))))))) (fp.sub RNE (fp.mul RNE .cse3 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse3))))))) (fp.sub RNE (fp.mul RNE .cse2 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse2))))))) (fp.sub RNE (fp.mul RNE .cse0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ .cse0))))) c_main_~x~0) (not (fp.eq (fp.sub RNE (fp.mul RNE c_main_~x~0 .cse1) ((_ to_fp 15 113) RNE (bvmul (_ bv10 32) ((_ fp.to_sbv 32) RTZ c_main_~x~0)))) ((_ to_fp 15 113) RNE (_ bv0 32)))))) is different from true Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown