/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-benchs/water_pid_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 40ef5092 Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-benchs/water_pid_true-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7fd08b3e226d625ffd75458b50e3f94c29ac1e83 .............................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-benchs/water_pid_true-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7fd08b3e226d625ffd75458b50e3f94c29ac1e83 ................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. --- Real Ultimate output --- This is Ultimate 0.1.23-40ef509 [2018-09-20 14:21:47,174 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 14:21:47,176 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 14:21:47,192 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 14:21:47,193 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 14:21:47,194 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 14:21:47,196 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 14:21:47,203 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 14:21:47,205 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 14:21:47,206 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 14:21:47,207 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 14:21:47,208 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 14:21:47,209 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 14:21:47,210 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 14:21:47,211 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 14:21:47,212 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 14:21:47,213 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 14:21:47,215 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 14:21:47,218 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 14:21:47,220 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 14:21:47,221 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 14:21:47,222 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 14:21:47,225 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 14:21:47,226 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 14:21:47,226 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 14:21:47,227 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 14:21:47,229 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 14:21:47,230 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 14:21:47,231 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 14:21:47,232 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 14:21:47,233 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 14:21:47,233 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 14:21:47,234 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 14:21:47,234 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 14:21:47,235 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 14:21:47,236 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 14:21:47,236 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-20 14:21:47,254 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 14:21:47,254 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 14:21:47,255 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 14:21:47,255 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 14:21:47,256 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 14:21:47,257 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 14:21:47,257 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 14:21:47,257 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 14:21:47,257 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 14:21:47,258 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-20 14:21:47,258 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 14:21:47,258 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 14:21:47,258 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 14:21:47,258 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 14:21:47,260 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 14:21:47,260 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 14:21:47,260 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 14:21:47,260 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 14:21:47,261 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 14:21:47,261 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 14:21:47,261 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 14:21:47,261 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 14:21:47,262 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 14:21:47,262 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 14:21:47,262 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 14:21:47,262 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 14:21:47,262 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-20 14:21:47,263 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 14:21:47,263 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-20 14:21:47,263 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7fd08b3e226d625ffd75458b50e3f94c29ac1e83 [2018-09-20 14:21:47,333 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 14:21:47,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 14:21:47,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 14:21:47,367 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 14:21:47,368 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 14:21:47,369 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/water_pid_true-unreach-call_true-termination.c [2018-09-20 14:21:47,728 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/540365299/523d37be33804ea4ab819636ce2f7b31/FLAGc43d1e9cc [2018-09-20 14:21:47,894 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 14:21:47,895 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/water_pid_true-unreach-call_true-termination.c [2018-09-20 14:21:47,902 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/540365299/523d37be33804ea4ab819636ce2f7b31/FLAGc43d1e9cc [2018-09-20 14:21:47,920 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/540365299/523d37be33804ea4ab819636ce2f7b31 [2018-09-20 14:21:47,924 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 14:21:47,928 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 14:21:47,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 14:21:47,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 14:21:47,936 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 14:21:47,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 02:21:47" (1/1) ... [2018-09-20 14:21:47,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5020092e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:21:47, skipping insertion in model container [2018-09-20 14:21:47,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 02:21:47" (1/1) ... [2018-09-20 14:21:47,953 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 14:21:48,173 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 14:21:48,195 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 14:21:48,205 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 14:21:48,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:21:48 WrapperNode [2018-09-20 14:21:48,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 14:21:48,221 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 14:21:48,221 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 14:21:48,221 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 14:21:48,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:21:48" (1/1) ... [2018-09-20 14:21:48,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:21:48" (1/1) ... [2018-09-20 14:21:48,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:21:48" (1/1) ... [2018-09-20 14:21:48,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:21:48" (1/1) ... [2018-09-20 14:21:48,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:21:48" (1/1) ... [2018-09-20 14:21:48,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:21:48" (1/1) ... [2018-09-20 14:21:48,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:21:48" (1/1) ... [2018-09-20 14:21:48,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 14:21:48,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 14:21:48,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 14:21:48,260 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 14:21:48,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:21:48" (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-20 14:21:48,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 14:21:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 14:21:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-20 14:21:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure y [2018-09-20 14:21:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 14:21:48,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 14:21:48,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-20 14:21:48,348 INFO L130 BoogieDeclarations]: Found specification of procedure y [2018-09-20 14:21:48,349 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 14:21:48,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 14:21:48,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 14:21:48,723 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 14:21:48,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:21:48 BoogieIcfgContainer [2018-09-20 14:21:48,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 14:21:48,726 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 14:21:48,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 14:21:48,746 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 14:21:48,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 02:21:47" (1/3) ... [2018-09-20 14:21:48,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616258b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 02:21:48, skipping insertion in model container [2018-09-20 14:21:48,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:21:48" (2/3) ... [2018-09-20 14:21:48,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616258b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 02:21:48, skipping insertion in model container [2018-09-20 14:21:48,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:21:48" (3/3) ... [2018-09-20 14:21:48,750 INFO L112 eAbstractionObserver]: Analyzing ICFG water_pid_true-unreach-call_true-termination.c [2018-09-20 14:21:48,777 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 14:21:48,795 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 14:21:48,891 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 14:21:48,892 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 14:21:48,893 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 14:21:48,893 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 14:21:48,893 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 14:21:48,893 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 14:21:48,893 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 14:21:48,894 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 14:21:48,894 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 14:21:48,941 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-09-20 14:21:48,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-20 14:21:48,959 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:21:48,961 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:21:48,966 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:21:48,973 INFO L82 PathProgramCache]: Analyzing trace with hash 220960723, now seen corresponding path program 1 times [2018-09-20 14:21:48,976 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 14:21:48,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 14:21:49,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 14:21:49,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:21:49,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 14:21:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 14:21:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 14:21:49,179 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-20 14:21:49,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 02:21:49 BoogieIcfgContainer [2018-09-20 14:21:49,215 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 14:21:49,216 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 14:21:49,216 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 14:21:49,216 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 14:21:49,217 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:21:48" (3/4) ... [2018-09-20 14:21:49,222 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-09-20 14:21:49,222 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 14:21:49,223 INFO L168 Benchmark]: Toolchain (without parser) took 1298.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -127.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 14:21:49,225 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 14:21:49,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.18 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-20 14:21:49,227 INFO L168 Benchmark]: Boogie Preprocessor took 38.14 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 14:21:49,228 INFO L168 Benchmark]: RCFGBuilder took 465.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2018-09-20 14:21:49,230 INFO L168 Benchmark]: TraceAbstraction took 489.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-09-20 14:21:49,231 INFO L168 Benchmark]: Witness Printer took 6.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 14:21:49,237 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 291.18 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.14 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 465.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 489.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * Witness Printer took 6.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of to_real at line 29, overapproximation of someBinaryArithmeticDOUBLEoperation at line 39. Possible FailurePath: [L10] static NUM yn = 0; [L12] NUM ui = 0; VAL [\old(ui)=9, \old(yn)=5] [L22] NUM yi, yc; [L23] NUM K; [L24] NUM T; [L25] NUM taui; [L26] NUM taud; [L27] NUM ei, sumej, epi; [L28] int i; [L29] T = 1 [L30] taui = 1 [L31] taud = 1 [L32] K = .5 [L33] yc = .5 VAL [\old(ui)=2, \old(yn)=8, K=1/2, ui=2, yc=1/2, yn=8] [L34] CALL, EXPR y(0) VAL [\old(i)=0, \old(ui)=2, \old(yn)=8, ui=2, yn=8] [L16] yn += ui [L17] RET return yn; VAL [\old(i)=0, \old(ui)=2, \old(yn)=8, \result=6, i=0, ui=2, yn=6] [L34] EXPR y(0) VAL [\old(ui)=2, \old(yn)=8, K=1/2, ui=2, y(0)=6, yc=1/2, yn=6] [L34] yi = y(0) [L35] epi = yc-yi [L36] sumej = epi [L37] i=0 VAL [\old(ui)=2, \old(yn)=8, epi=7, i=0, K=1/2, sumej=7, ui=2, yc=1/2, yi=6, yn=6] [L37] COND TRUE i<120 VAL [\old(ui)=2, \old(yn)=8, epi=7, i=0, K=1/2, sumej=7, ui=2, yc=1/2, yi=6, yn=6] [L38] CALL, EXPR y(i) VAL [\old(i)=0, \old(ui)=2, \old(yn)=6, ui=2, yn=6] [L16] yn += ui [L17] RET return yn; VAL [\old(i)=0, \old(ui)=2, \old(yn)=6, \result=3, i=0, ui=2, yn=3] [L38] EXPR y(i) VAL [\old(ui)=2, \old(yn)=8, epi=7, i=0, K=1/2, sumej=7, ui=2, y(i)=3, yc=1/2, yi=6, yn=3] [L38] yi = y(i) [L39] ei = yc-yi [L40] sumej = sumej+ei [L41] ui = K*(ei+sumej*T/taui+taud/T*(ei-epi)) [L42] epi = ei VAL [\old(ui)=2, \old(yn)=8, ei=4, epi=4, i=0, K=1/2, yc=1/2, yi=3, yn=3] [L44] CALL __VERIFIER_assert(epi >= -1. && epi <= 1.) VAL [\old(cond)=0, \old(ui)=2, \old(yn)=8, yn=3] [L6] COND TRUE !(cond) VAL [\old(cond)=0, \old(ui)=2, \old(yn)=8, cond=0, yn=3] [L6] __VERIFIER_error() VAL [\old(cond)=0, \old(ui)=2, \old(yn)=8, cond=0, yn=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 1 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-40ef509 [2018-09-20 14:21:51,689 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 14:21:51,691 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 14:21:51,704 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 14:21:51,705 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 14:21:51,706 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 14:21:51,708 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 14:21:51,710 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 14:21:51,711 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 14:21:51,713 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 14:21:51,714 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 14:21:51,714 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 14:21:51,715 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 14:21:51,716 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 14:21:51,718 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 14:21:51,719 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 14:21:51,720 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 14:21:51,722 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 14:21:51,724 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 14:21:51,726 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 14:21:51,727 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 14:21:51,729 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 14:21:51,732 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 14:21:51,732 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 14:21:51,732 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 14:21:51,733 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 14:21:51,735 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 14:21:51,736 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 14:21:51,737 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 14:21:51,738 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 14:21:51,738 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 14:21:51,739 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 14:21:51,740 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 14:21:51,740 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 14:21:51,741 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 14:21:51,742 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 14:21:51,743 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-20 14:21:51,774 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 14:21:51,774 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 14:21:51,777 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 14:21:51,777 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 14:21:51,778 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 14:21:51,778 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 14:21:51,778 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 14:21:51,779 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 14:21:51,779 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 14:21:51,779 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 14:21:51,779 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 14:21:51,779 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 14:21:51,780 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 14:21:51,781 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 14:21:51,781 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-20 14:21:51,781 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-20 14:21:51,781 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 14:21:51,781 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 14:21:51,781 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 14:21:51,782 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 14:21:51,782 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 14:21:51,782 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 14:21:51,782 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 14:21:51,784 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 14:21:51,784 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 14:21:51,784 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 14:21:51,784 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 14:21:51,784 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-20 14:21:51,785 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 14:21:51,785 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-20 14:21:51,785 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-20 14:21:51,785 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7fd08b3e226d625ffd75458b50e3f94c29ac1e83 [2018-09-20 14:21:51,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 14:21:51,894 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 14:21:51,899 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 14:21:51,901 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 14:21:51,902 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 14:21:51,903 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/water_pid_true-unreach-call_true-termination.c [2018-09-20 14:21:52,324 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d2e68dc6/375f7cc1d6404850a498ac5553739063/FLAG767a80d16 [2018-09-20 14:21:52,509 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 14:21:52,510 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/water_pid_true-unreach-call_true-termination.c [2018-09-20 14:21:52,517 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d2e68dc6/375f7cc1d6404850a498ac5553739063/FLAG767a80d16 [2018-09-20 14:21:52,534 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d2e68dc6/375f7cc1d6404850a498ac5553739063 [2018-09-20 14:21:52,537 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 14:21:52,541 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 14:21:52,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 14:21:52,543 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 14:21:52,550 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 14:21:52,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 02:21:52" (1/1) ... [2018-09-20 14:21:52,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@312a656a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:21:52, skipping insertion in model container [2018-09-20 14:21:52,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 02:21:52" (1/1) ... [2018-09-20 14:21:52,567 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 14:21:52,813 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 14:21:52,844 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 14:21:52,861 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 14:21:52,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:21:52 WrapperNode [2018-09-20 14:21:52,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 14:21:52,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 14:21:52,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 14:21:52,892 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 14:21:52,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:21:52" (1/1) ... [2018-09-20 14:21:52,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:21:52" (1/1) ... [2018-09-20 14:21:52,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:21:52" (1/1) ... [2018-09-20 14:21:52,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:21:52" (1/1) ... [2018-09-20 14:21:52,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:21:52" (1/1) ... [2018-09-20 14:21:52,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:21:52" (1/1) ... [2018-09-20 14:21:52,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:21:52" (1/1) ... [2018-09-20 14:21:52,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 14:21:52,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 14:21:52,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 14:21:52,956 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 14:21:52,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:21:52" (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-20 14:21:53,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 14:21:53,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 14:21:53,044 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-20 14:21:53,044 INFO L138 BoogieDeclarations]: Found implementation of procedure y [2018-09-20 14:21:53,044 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 14:21:53,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 14:21:53,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-20 14:21:53,045 INFO L130 BoogieDeclarations]: Found specification of procedure y [2018-09-20 14:21:53,045 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 14:21:53,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 14:21:53,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 14:21:56,656 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 14:21:56,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:21:56 BoogieIcfgContainer [2018-09-20 14:21:56,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 14:21:56,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 14:21:56,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 14:21:56,673 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 14:21:56,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 02:21:52" (1/3) ... [2018-09-20 14:21:56,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab31ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 02:21:56, skipping insertion in model container [2018-09-20 14:21:56,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:21:52" (2/3) ... [2018-09-20 14:21:56,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab31ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 02:21:56, skipping insertion in model container [2018-09-20 14:21:56,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:21:56" (3/3) ... [2018-09-20 14:21:56,681 INFO L112 eAbstractionObserver]: Analyzing ICFG water_pid_true-unreach-call_true-termination.c [2018-09-20 14:21:56,705 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 14:21:56,716 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 14:21:56,781 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 14:21:56,782 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 14:21:56,782 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 14:21:56,782 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 14:21:56,782 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 14:21:56,783 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 14:21:56,783 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 14:21:56,783 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 14:21:56,783 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 14:21:56,802 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-09-20 14:21:56,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-20 14:21:56,810 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:21:56,811 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:21:56,814 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:21:56,821 INFO L82 PathProgramCache]: Analyzing trace with hash 220960723, now seen corresponding path program 1 times [2018-09-20 14:21:56,826 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:21:56,826 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) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-20 14:21:56,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:22:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:22:01,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:22:01,899 WARN L178 SmtUtils]: Spent 392.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-20 14:22:02,721 WARN L178 SmtUtils]: Spent 490.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-20 14:22:03,277 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 5 [2018-09-20 14:22:03,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 14:22:03,497 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:22:03,558 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:22:03,559 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-20 14:22:03,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-20 14:22:03,575 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-20 14:22:03,576 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-09-20 14:22:03,579 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 11 states. [2018-09-20 14:22:04,590 WARN L178 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-09-20 14:22:05,363 WARN L178 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-09-20 14:22:05,940 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2018-09-20 14:22:18,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:22:18,566 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2018-09-20 14:22:18,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-20 14:22:18,578 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-09-20 14:22:18,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:22:18,595 INFO L225 Difference]: With dead ends: 73 [2018-09-20 14:22:18,595 INFO L226 Difference]: Without dead ends: 40 [2018-09-20 14:22:18,603 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-09-20 14:22:18,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-20 14:22:18,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2018-09-20 14:22:18,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-20 14:22:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-09-20 14:22:18,683 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 22 [2018-09-20 14:22:18,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:22:18,684 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-09-20 14:22:18,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-20 14:22:18,684 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-09-20 14:22:18,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-20 14:22:18,687 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:22:18,688 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:22:18,688 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:22:18,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1878853563, now seen corresponding path program 1 times [2018-09-20 14:22:18,689 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:22:18,689 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) [2018-09-20 14:22:18,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-20 14:22:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:22:25,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:22:26,708 WARN L178 SmtUtils]: Spent 688.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-20 14:22:26,872 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-20 14:22:28,378 WARN L178 SmtUtils]: Spent 987.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-20 14:22:28,691 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-20 14:22:47,915 WARN L178 SmtUtils]: Spent 8.55 s on a formula simplification that was a NOOP. DAG size: 27 [2018-09-20 14:22:50,041 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) RNE (_ bv0 32)))) (let ((.cse4 (fp.add RNE .cse5 .cse5))) (and (= c_~ui~0 (let ((.cse0 ((_ to_fp 11 53) RNE (/ 1.0 2.0)))) (fp.mul RNE .cse0 (let ((.cse3 ((_ to_fp 11 53) RNE (_ bv1 32))) (.cse1 (fp.sub RNE .cse0 c_~yn~0)) (.cse2 (fp.sub RNE .cse0 .cse4))) (fp.add RNE (fp.add RNE .cse1 (fp.div RNE (fp.mul RNE (fp.add RNE .cse2 .cse1) .cse3) .cse3)) (fp.mul RNE (fp.div RNE .cse3 .cse3) (fp.sub RNE .cse1 .cse2))))))) (= c_~yn~0 (fp.add RNE .cse4 .cse5))))) is different from true [2018-09-20 14:22:52,252 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 11 53) RNE (_ bv0 32))) (.cse3 ((_ to_fp 11 53) RNE (_ bv1 32)))) (let ((.cse0 ((_ to_fp 11 53) RNE (/ 1.0 2.0))) (.cse4 (fp.div RNE .cse3 .cse3)) (.cse5 (fp.add RNE .cse6 .cse6))) (and (= c_main_~yc~0 .cse0) (= c_~ui~0 (fp.mul RNE .cse0 (let ((.cse1 (fp.sub RNE .cse0 c_~yn~0)) (.cse2 (fp.sub RNE .cse0 .cse5))) (fp.add RNE (fp.add RNE .cse1 (fp.div RNE (fp.mul RNE (fp.add RNE .cse2 .cse1) .cse3) .cse3)) (fp.mul RNE .cse4 (fp.sub RNE .cse1 .cse2)))))) (= c_~yn~0 (fp.add RNE .cse5 .cse6)) (= c_~ui~0 (fp.mul RNE .cse0 (let ((.cse7 (fp.sub RNE c_main_~yc~0 c_~yn~0)) (.cse8 (fp.sub RNE c_main_~yc~0 .cse5))) (fp.add RNE (fp.add RNE .cse7 (fp.div RNE (fp.mul RNE (fp.add RNE .cse8 .cse7) .cse3) .cse3)) (fp.mul RNE .cse4 (fp.sub RNE .cse7 .cse8))))))))) is different from false [2018-09-20 14:22:59,840 WARN L178 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 29 [2018-09-20 14:23:08,715 WARN L178 SmtUtils]: Spent 4.48 s on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2018-09-20 14:23:16,369 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 1 times theorem prover too weak. 3 trivial. 5 not checked. [2018-09-20 14:23:16,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 14:23:37,587 WARN L178 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 10 [2018-09-20 14:23:38,703 WARN L178 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 9 [2018-09-20 14:23:39,447 WARN L178 SmtUtils]: Spent 743.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-09-20 14:23:41,211 WARN L178 SmtUtils]: Spent 1.76 s on a formula simplification that was a NOOP. DAG size: 15 [2018-09-20 14:23:43,290 WARN L178 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 13 [2018-09-20 14:23:45,317 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub RNE c_main_~yc~0 (fp.add RNE c_~yn~0 c_~ui~0))) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-09-20 14:23:47,776 WARN L819 $PredicateComparison]: unable to prove that (and (forall ((v_main_~yc~0_BEFORE_CALL_7 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_7 (fp.add RNE |c_old(~yn~0)| c_~ui~0))) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 (fp.neg .cse1))) (fp.leq (fp.sub RNE v_main_~yc~0_BEFORE_CALL_7 |c_y_#res|) .cse1)))) (forall ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse2 (fp.sub RNE v_prenex_1 (fp.add RNE |c_old(~yn~0)| c_~ui~0))) (.cse4 (fp.neg .cse3))) (or (not (fp.leq .cse2 .cse3)) (not (fp.geq .cse2 .cse4)) (fp.geq (fp.sub RNE v_prenex_1 |c_y_#res|) .cse4)))))) is different from true [2018-09-20 14:23:49,901 WARN L819 $PredicateComparison]: unable to prove that (and (forall ((v_main_~yc~0_BEFORE_CALL_7 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_7 (fp.add RNE |c_old(~yn~0)| c_~ui~0))) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 (fp.neg .cse1))) (fp.leq (fp.sub RNE v_main_~yc~0_BEFORE_CALL_7 (fp.add RNE c_~yn~0 c_~ui~0)) .cse1)))) (forall ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (fp.sub RNE v_prenex_1 (fp.add RNE |c_old(~yn~0)| c_~ui~0))) (.cse2 (fp.neg .cse4))) (or (fp.geq (fp.sub RNE v_prenex_1 (fp.add RNE c_~yn~0 c_~ui~0)) .cse2) (not (fp.leq .cse3 .cse4)) (not (fp.geq .cse3 .cse2))))))) is different from true [2018-09-20 14:23:52,973 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub RNE c_main_~yc~0 (fp.add RNE c_~yn~0 (fp.mul RNE c_main_~K~0 (let ((.cse2 (fp.sub RNE c_main_~yc~0 |c_main_#t~ret2|))) (fp.add RNE (fp.add RNE .cse2 (fp.div RNE (fp.mul RNE (fp.add RNE c_main_~sumej~0 .cse2) c_main_~T~0) c_main_~taui~0)) (fp.mul RNE (fp.div RNE c_main_~taud~0 c_main_~T~0) (fp.sub RNE .cse2 c_main_~epi~0)))))))) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2018-09-20 14:23:56,022 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub RNE c_main_~yc~0 (fp.add RNE c_~yn~0 (fp.mul RNE c_main_~K~0 (let ((.cse2 (fp.sub RNE c_main_~yc~0 |c_main_#t~ret2|))) (fp.add RNE (fp.add RNE .cse2 (fp.div RNE (fp.mul RNE (fp.add RNE c_main_~sumej~0 .cse2) c_main_~T~0) c_main_~taui~0)) (fp.mul RNE (fp.div RNE c_main_~taud~0 c_main_~T~0) (fp.sub RNE .cse2 c_main_~epi~0)))))))) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2018-09-20 14:23:57,400 WARN L178 SmtUtils]: Spent 1.38 s on a formula simplification that was a NOOP. DAG size: 9 [2018-09-20 14:23:58,283 WARN L178 SmtUtils]: Spent 882.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-09-20 14:23:59,694 WARN L178 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 15 [2018-09-20 14:24:01,445 WARN L178 SmtUtils]: Spent 1.75 s on a formula simplification that was a NOOP. DAG size: 13 [2018-09-20 14:24:04,503 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub RNE c_main_~yc~0 (let ((.cse2 (fp.add RNE c_~yn~0 c_~ui~0))) (fp.add RNE .cse2 (fp.mul RNE c_main_~K~0 (let ((.cse3 (fp.sub RNE c_main_~yc~0 .cse2))) (fp.add RNE (fp.add RNE .cse3 (fp.div RNE (fp.mul RNE (fp.add RNE c_main_~sumej~0 .cse3) c_main_~T~0) c_main_~taui~0)) (fp.mul RNE (fp.div RNE c_main_~taud~0 c_main_~T~0) (fp.sub RNE .cse3 c_main_~epi~0))))))))) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2018-09-20 14:24:07,548 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub RNE c_main_~yc~0 (let ((.cse2 (fp.add RNE c_~yn~0 c_~ui~0))) (fp.add RNE .cse2 (fp.mul RNE c_main_~K~0 (let ((.cse3 (fp.sub RNE c_main_~yc~0 .cse2))) (fp.add RNE (fp.add RNE .cse3 (fp.div RNE (fp.mul RNE (fp.add RNE c_main_~sumej~0 .cse3) c_main_~T~0) c_main_~taui~0)) (fp.mul RNE (fp.div RNE c_main_~taud~0 c_main_~T~0) (fp.sub RNE .cse3 c_main_~epi~0))))))))) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2018-09-20 14:24:10,686 WARN L819 $PredicateComparison]: unable to prove that (and (forall ((v_main_~epi~0_BEFORE_CALL_4 (_ FloatingPoint 11 53)) (v_main_~taud~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~K~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~taui~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~sumej~0_BEFORE_CALL_2 (_ FloatingPoint 11 53)) (v_main_~T~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~yc~0_BEFORE_CALL_9 (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div RNE v_main_~taud~0_BEFORE_CALL_3 v_main_~T~0_BEFORE_CALL_3))) (let ((.cse0 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_9 (let ((.cse4 (fp.add RNE |c_old(~yn~0)| c_~ui~0))) (fp.add RNE .cse4 (fp.mul RNE v_main_~K~0_BEFORE_CALL_3 (let ((.cse5 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_9 .cse4))) (fp.add RNE (fp.add RNE .cse5 (fp.div RNE (fp.mul RNE (fp.add RNE v_main_~sumej~0_BEFORE_CALL_2 .cse5) v_main_~T~0_BEFORE_CALL_3) v_main_~taui~0_BEFORE_CALL_3)) (fp.mul RNE .cse3 (fp.sub RNE .cse5 v_main_~epi~0_BEFORE_CALL_4))))))))) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (or (not (fp.geq .cse0 (fp.neg .cse1))) (not (fp.leq .cse0 .cse1)) (fp.leq (fp.sub RNE v_main_~yc~0_BEFORE_CALL_9 (fp.add RNE c_~yn~0 (fp.mul RNE v_main_~K~0_BEFORE_CALL_3 (let ((.cse2 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_9 |c_y_#res|))) (fp.add RNE (fp.add RNE .cse2 (fp.div RNE (fp.mul RNE (fp.add RNE v_main_~sumej~0_BEFORE_CALL_2 .cse2) v_main_~T~0_BEFORE_CALL_3) v_main_~taui~0_BEFORE_CALL_3)) (fp.mul RNE .cse3 (fp.sub RNE .cse2 v_main_~epi~0_BEFORE_CALL_4))))))) .cse1))))) (forall ((v_prenex_6 (_ FloatingPoint 11 53)) (v_prenex_7 (_ FloatingPoint 11 53)) (v_prenex_4 (_ FloatingPoint 11 53)) (v_prenex_5 (_ FloatingPoint 11 53)) (v_prenex_2 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53)) (v_prenex_8 (_ FloatingPoint 11 53))) (let ((.cse9 (fp.div RNE v_prenex_3 v_prenex_7)) (.cse10 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse7 (fp.neg .cse10)) (.cse6 (fp.sub RNE v_prenex_8 (let ((.cse11 (fp.add RNE |c_old(~yn~0)| c_~ui~0))) (fp.add RNE .cse11 (fp.mul RNE v_prenex_4 (let ((.cse12 (fp.sub RNE v_prenex_8 .cse11))) (fp.add RNE (fp.add RNE .cse12 (fp.div RNE (fp.mul RNE (fp.add RNE v_prenex_6 .cse12) v_prenex_7) v_prenex_5)) (fp.mul RNE .cse9 (fp.sub RNE .cse12 v_prenex_2)))))))))) (or (not (fp.geq .cse6 .cse7)) (fp.geq (fp.sub RNE v_prenex_8 (fp.add RNE c_~yn~0 (fp.mul RNE v_prenex_4 (let ((.cse8 (fp.sub RNE v_prenex_8 |c_y_#res|))) (fp.add RNE (fp.add RNE .cse8 (fp.div RNE (fp.mul RNE (fp.add RNE v_prenex_6 .cse8) v_prenex_7) v_prenex_5)) (fp.mul RNE .cse9 (fp.sub RNE .cse8 v_prenex_2))))))) .cse7) (not (fp.leq .cse6 .cse10))))))) is different from true [2018-09-20 14:24:13,806 WARN L819 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_6 (_ FloatingPoint 11 53)) (v_prenex_7 (_ FloatingPoint 11 53)) (v_prenex_4 (_ FloatingPoint 11 53)) (v_prenex_5 (_ FloatingPoint 11 53)) (v_prenex_2 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53)) (v_prenex_8 (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div RNE v_prenex_3 v_prenex_7)) (.cse5 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (fp.neg .cse5)) (.cse4 (fp.sub RNE v_prenex_8 (let ((.cse6 (fp.add RNE |c_old(~yn~0)| c_~ui~0))) (fp.add RNE .cse6 (fp.mul RNE v_prenex_4 (let ((.cse7 (fp.sub RNE v_prenex_8 .cse6))) (fp.add RNE (fp.add RNE .cse7 (fp.div RNE (fp.mul RNE (fp.add RNE v_prenex_6 .cse7) v_prenex_7) v_prenex_5)) (fp.mul RNE .cse2 (fp.sub RNE .cse7 v_prenex_2)))))))))) (or (fp.geq (fp.sub RNE v_prenex_8 (let ((.cse0 (fp.add RNE c_~yn~0 c_~ui~0))) (fp.add RNE .cse0 (fp.mul RNE v_prenex_4 (let ((.cse1 (fp.sub RNE v_prenex_8 .cse0))) (fp.add RNE (fp.add RNE .cse1 (fp.div RNE (fp.mul RNE (fp.add RNE v_prenex_6 .cse1) v_prenex_7) v_prenex_5)) (fp.mul RNE .cse2 (fp.sub RNE .cse1 v_prenex_2)))))))) .cse3) (not (fp.geq .cse4 .cse3)) (not (fp.leq .cse4 .cse5)))))) (forall ((v_main_~epi~0_BEFORE_CALL_4 (_ FloatingPoint 11 53)) (v_main_~taud~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~K~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~taui~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~sumej~0_BEFORE_CALL_2 (_ FloatingPoint 11 53)) (v_main_~T~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~yc~0_BEFORE_CALL_9 (_ FloatingPoint 11 53))) (let ((.cse12 (fp.div RNE v_main_~taud~0_BEFORE_CALL_3 v_main_~T~0_BEFORE_CALL_3))) (let ((.cse8 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_9 (let ((.cse13 (fp.add RNE |c_old(~yn~0)| c_~ui~0))) (fp.add RNE .cse13 (fp.mul RNE v_main_~K~0_BEFORE_CALL_3 (let ((.cse14 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_9 .cse13))) (fp.add RNE (fp.add RNE .cse14 (fp.div RNE (fp.mul RNE (fp.add RNE v_main_~sumej~0_BEFORE_CALL_2 .cse14) v_main_~T~0_BEFORE_CALL_3) v_main_~taui~0_BEFORE_CALL_3)) (fp.mul RNE .cse12 (fp.sub RNE .cse14 v_main_~epi~0_BEFORE_CALL_4))))))))) (.cse9 ((_ to_fp 11 53) RNE 1.0))) (or (not (fp.geq .cse8 (fp.neg .cse9))) (fp.leq (fp.sub RNE v_main_~yc~0_BEFORE_CALL_9 (let ((.cse10 (fp.add RNE c_~yn~0 c_~ui~0))) (fp.add RNE .cse10 (fp.mul RNE v_main_~K~0_BEFORE_CALL_3 (let ((.cse11 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_9 .cse10))) (fp.add RNE (fp.add RNE .cse11 (fp.div RNE (fp.mul RNE (fp.add RNE v_main_~sumej~0_BEFORE_CALL_2 .cse11) v_main_~T~0_BEFORE_CALL_3) v_main_~taui~0_BEFORE_CALL_3)) (fp.mul RNE .cse12 (fp.sub RNE .cse11 v_main_~epi~0_BEFORE_CALL_4)))))))) .cse9) (not (fp.leq .cse8 .cse9))))))) is different from true [2018-09-20 14:24:16,907 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub RNE c_main_~yc~0 (let ((.cse2 (fp.add RNE c_~yn~0 c_~ui~0))) (fp.add RNE .cse2 (fp.mul RNE c_main_~K~0 (let ((.cse3 (fp.sub RNE c_main_~yc~0 .cse2)) (.cse4 (fp.sub RNE c_main_~yc~0 |c_main_#t~ret0|))) (fp.add RNE (fp.add RNE .cse3 (fp.div RNE (fp.mul RNE (fp.add RNE .cse4 .cse3) c_main_~T~0) c_main_~taui~0)) (fp.mul RNE (fp.div RNE c_main_~taud~0 c_main_~T~0) (fp.sub RNE .cse3 .cse4))))))))) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-09-20 14:24:19,998 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub RNE c_main_~yc~0 (let ((.cse2 (fp.add RNE c_~yn~0 c_~ui~0))) (fp.add RNE .cse2 (fp.mul RNE c_main_~K~0 (let ((.cse3 (fp.sub RNE c_main_~yc~0 .cse2)) (.cse4 (fp.sub RNE c_main_~yc~0 |c_main_#t~ret0|))) (fp.add RNE (fp.add RNE .cse3 (fp.div RNE (fp.mul RNE (fp.add RNE .cse4 .cse3) c_main_~T~0) c_main_~taui~0)) (fp.mul RNE (fp.div RNE c_main_~taud~0 c_main_~T~0) (fp.sub RNE .cse3 .cse4))))))))) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2018-09-20 14:24:20,601 WARN L178 SmtUtils]: Spent 602.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-09-20 14:24:21,264 WARN L178 SmtUtils]: Spent 661.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-09-20 14:24:23,967 WARN L178 SmtUtils]: Spent 2.70 s on a formula simplification that was a NOOP. DAG size: 15 [2018-09-20 14:24:24,838 WARN L178 SmtUtils]: Spent 870.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-20 14:24:27,946 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub RNE c_main_~yc~0 (let ((.cse5 (fp.add RNE c_~yn~0 c_~ui~0))) (let ((.cse2 (fp.add RNE .cse5 c_~ui~0))) (fp.add RNE .cse2 (fp.mul RNE c_main_~K~0 (let ((.cse3 (fp.sub RNE c_main_~yc~0 .cse2)) (.cse4 (fp.sub RNE c_main_~yc~0 .cse5))) (fp.add RNE (fp.add RNE .cse3 (fp.div RNE (fp.mul RNE (fp.add RNE .cse4 .cse3) c_main_~T~0) c_main_~taui~0)) (fp.mul RNE (fp.div RNE c_main_~taud~0 c_main_~T~0) (fp.sub RNE .cse3 .cse4)))))))))) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-09-20 14:24:31,050 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub RNE c_main_~yc~0 (let ((.cse5 (fp.add RNE c_~yn~0 c_~ui~0))) (let ((.cse2 (fp.add RNE .cse5 c_~ui~0))) (fp.add RNE .cse2 (fp.mul RNE c_main_~K~0 (let ((.cse3 (fp.sub RNE c_main_~yc~0 .cse2)) (.cse4 (fp.sub RNE c_main_~yc~0 .cse5))) (fp.add RNE (fp.add RNE .cse3 (fp.div RNE (fp.mul RNE (fp.add RNE .cse4 .cse3) c_main_~T~0) c_main_~taui~0)) (fp.mul RNE (fp.div RNE c_main_~taud~0 c_main_~T~0) (fp.sub RNE .cse3 .cse4)))))))))) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2018-09-20 14:24:34,206 WARN L819 $PredicateComparison]: unable to prove that (and (forall ((v_main_~taud~0_BEFORE_CALL_4 (_ FloatingPoint 11 53)) (v_main_~yc~0_BEFORE_CALL_10 (_ FloatingPoint 11 53)) (v_main_~T~0_BEFORE_CALL_4 (_ FloatingPoint 11 53)) (v_main_~taui~0_BEFORE_CALL_4 (_ FloatingPoint 11 53)) (v_main_~K~0_BEFORE_CALL_4 (_ FloatingPoint 11 53))) (let ((.cse5 (fp.div RNE v_main_~taud~0_BEFORE_CALL_4 v_main_~T~0_BEFORE_CALL_4))) (let ((.cse0 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_10 (let ((.cse9 (fp.add RNE |c_old(~yn~0)| c_~ui~0))) (let ((.cse6 (fp.add RNE .cse9 c_~ui~0))) (fp.add RNE .cse6 (fp.mul RNE v_main_~K~0_BEFORE_CALL_4 (let ((.cse7 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_10 .cse6)) (.cse8 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_10 .cse9))) (fp.add RNE (fp.add RNE .cse7 (fp.div RNE (fp.mul RNE (fp.add RNE .cse8 .cse7) v_main_~T~0_BEFORE_CALL_4) v_main_~taui~0_BEFORE_CALL_4)) (fp.mul RNE .cse5 (fp.sub RNE .cse7 .cse8)))))))))) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (or (not (fp.leq .cse0 .cse1)) (fp.leq (fp.sub RNE v_main_~yc~0_BEFORE_CALL_10 (let ((.cse2 (fp.add RNE c_~yn~0 c_~ui~0))) (fp.add RNE .cse2 (fp.mul RNE v_main_~K~0_BEFORE_CALL_4 (let ((.cse3 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_10 .cse2)) (.cse4 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_10 |c_y_#res|))) (fp.add RNE (fp.add RNE .cse3 (fp.div RNE (fp.mul RNE (fp.add RNE .cse4 .cse3) v_main_~T~0_BEFORE_CALL_4) v_main_~taui~0_BEFORE_CALL_4)) (fp.mul RNE .cse5 (fp.sub RNE .cse3 .cse4)))))))) .cse1) (not (fp.geq .cse0 (fp.neg .cse1))))))) (forall ((v_prenex_12 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse12 ((_ to_fp 11 53) RNE 1.0)) (.cse16 (fp.div RNE v_prenex_9 v_prenex_11))) (let ((.cse10 (fp.sub RNE v_prenex_10 (let ((.cse20 (fp.add RNE |c_old(~yn~0)| c_~ui~0))) (let ((.cse17 (fp.add RNE .cse20 c_~ui~0))) (fp.add RNE .cse17 (fp.mul RNE v_prenex_13 (let ((.cse18 (fp.sub RNE v_prenex_10 .cse17)) (.cse19 (fp.sub RNE v_prenex_10 .cse20))) (fp.add RNE (fp.add RNE .cse18 (fp.div RNE (fp.mul RNE (fp.add RNE .cse19 .cse18) v_prenex_11) v_prenex_12)) (fp.mul RNE .cse16 (fp.sub RNE .cse18 .cse19)))))))))) (.cse11 (fp.neg .cse12))) (or (not (fp.geq .cse10 .cse11)) (not (fp.leq .cse10 .cse12)) (fp.geq (fp.sub RNE v_prenex_10 (let ((.cse13 (fp.add RNE c_~yn~0 c_~ui~0))) (fp.add RNE .cse13 (fp.mul RNE v_prenex_13 (let ((.cse14 (fp.sub RNE v_prenex_10 .cse13)) (.cse15 (fp.sub RNE v_prenex_10 |c_y_#res|))) (fp.add RNE (fp.add RNE .cse14 (fp.div RNE (fp.mul RNE (fp.add RNE .cse15 .cse14) v_prenex_11) v_prenex_12)) (fp.mul RNE .cse16 (fp.sub RNE .cse14 .cse15)))))))) .cse11)))))) is different from true [2018-09-20 14:24:37,411 WARN L819 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_12 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse5 (fp.div RNE v_prenex_9 v_prenex_11)) (.cse7 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.neg .cse7)) (.cse0 (fp.sub RNE v_prenex_10 (let ((.cse11 (fp.add RNE |c_old(~yn~0)| c_~ui~0))) (let ((.cse8 (fp.add RNE .cse11 c_~ui~0))) (fp.add RNE .cse8 (fp.mul RNE v_prenex_13 (let ((.cse9 (fp.sub RNE v_prenex_10 .cse8)) (.cse10 (fp.sub RNE v_prenex_10 .cse11))) (fp.add RNE (fp.add RNE .cse9 (fp.div RNE (fp.mul RNE (fp.add RNE .cse10 .cse9) v_prenex_11) v_prenex_12)) (fp.mul RNE .cse5 (fp.sub RNE .cse9 .cse10))))))))))) (or (not (fp.geq .cse0 .cse1)) (fp.geq (fp.sub RNE v_prenex_10 (let ((.cse6 (fp.add RNE c_~yn~0 c_~ui~0))) (let ((.cse2 (fp.add RNE .cse6 c_~ui~0))) (fp.add RNE .cse2 (fp.mul RNE v_prenex_13 (let ((.cse3 (fp.sub RNE v_prenex_10 .cse2)) (.cse4 (fp.sub RNE v_prenex_10 .cse6))) (fp.add RNE (fp.add RNE .cse3 (fp.div RNE (fp.mul RNE (fp.add RNE .cse4 .cse3) v_prenex_11) v_prenex_12)) (fp.mul RNE .cse5 (fp.sub RNE .cse3 .cse4))))))))) .cse1) (not (fp.leq .cse0 .cse7)))))) (forall ((v_main_~taud~0_BEFORE_CALL_4 (_ FloatingPoint 11 53)) (v_main_~yc~0_BEFORE_CALL_10 (_ FloatingPoint 11 53)) (v_main_~T~0_BEFORE_CALL_4 (_ FloatingPoint 11 53)) (v_main_~taui~0_BEFORE_CALL_4 (_ FloatingPoint 11 53)) (v_main_~K~0_BEFORE_CALL_4 (_ FloatingPoint 11 53))) (let ((.cse17 (fp.div RNE v_main_~taud~0_BEFORE_CALL_4 v_main_~T~0_BEFORE_CALL_4))) (let ((.cse12 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_10 (let ((.cse22 (fp.add RNE |c_old(~yn~0)| c_~ui~0))) (let ((.cse19 (fp.add RNE .cse22 c_~ui~0))) (fp.add RNE .cse19 (fp.mul RNE v_main_~K~0_BEFORE_CALL_4 (let ((.cse20 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_10 .cse19)) (.cse21 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_10 .cse22))) (fp.add RNE (fp.add RNE .cse20 (fp.div RNE (fp.mul RNE (fp.add RNE .cse21 .cse20) v_main_~T~0_BEFORE_CALL_4) v_main_~taui~0_BEFORE_CALL_4)) (fp.mul RNE .cse17 (fp.sub RNE .cse20 .cse21)))))))))) (.cse13 ((_ to_fp 11 53) RNE 1.0))) (or (not (fp.leq .cse12 .cse13)) (fp.leq (fp.sub RNE v_main_~yc~0_BEFORE_CALL_10 (let ((.cse18 (fp.add RNE c_~yn~0 c_~ui~0))) (let ((.cse14 (fp.add RNE .cse18 c_~ui~0))) (fp.add RNE .cse14 (fp.mul RNE v_main_~K~0_BEFORE_CALL_4 (let ((.cse15 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_10 .cse14)) (.cse16 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_10 .cse18))) (fp.add RNE (fp.add RNE .cse15 (fp.div RNE (fp.mul RNE (fp.add RNE .cse16 .cse15) v_main_~T~0_BEFORE_CALL_4) v_main_~taui~0_BEFORE_CALL_4)) (fp.mul RNE .cse17 (fp.sub RNE .cse15 .cse16))))))))) .cse13) (not (fp.geq .cse12 (fp.neg .cse13)))))))) is different from true [2018-09-20 14:24:39,617 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) RNE (/ 1.0 2.0)))) (fp.sub RNE .cse2 (let ((.cse7 (fp.add RNE c_~yn~0 c_~ui~0))) (let ((.cse3 (fp.add RNE .cse7 c_~ui~0))) (fp.add RNE .cse3 (fp.mul RNE .cse2 (let ((.cse6 ((_ to_fp 11 53) RNE (_ bv1 32))) (.cse4 (fp.sub RNE .cse2 .cse3)) (.cse5 (fp.sub RNE .cse2 .cse7))) (fp.add RNE (fp.add RNE .cse4 (fp.div RNE (fp.mul RNE (fp.add RNE .cse5 .cse4) .cse6) .cse6)) (fp.mul RNE (fp.div RNE .cse6 .cse6) (fp.sub RNE .cse4 .cse5))))))))))) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-09-20 14:24:41,823 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) RNE (/ 1.0 2.0)))) (fp.sub RNE .cse2 (let ((.cse7 (fp.add RNE c_~yn~0 c_~ui~0))) (let ((.cse3 (fp.add RNE .cse7 c_~ui~0))) (fp.add RNE .cse3 (fp.mul RNE .cse2 (let ((.cse6 ((_ to_fp 11 53) RNE (_ bv1 32))) (.cse4 (fp.sub RNE .cse2 .cse3)) (.cse5 (fp.sub RNE .cse2 .cse7))) (fp.add RNE (fp.add RNE .cse4 (fp.div RNE (fp.mul RNE (fp.add RNE .cse5 .cse4) .cse6) .cse6)) (fp.mul RNE (fp.div RNE .cse6 .cse6) (fp.sub RNE .cse4 .cse5))))))))))) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2018-09-20 14:24:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2018-09-20 14:24:42,041 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 14:24:42,041 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-09-20 14:24:42,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-20 14:24:42,045 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-20 14:24:42,046 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=326, Unknown=33, NotChecked=686, Total=1122 [2018-09-20 14:24:42,047 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 34 states. [2018-09-20 14:24:46,922 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (_ bv0 32))) (.cse1 (let ((.cse3 ((_ to_fp 11 53) RNE (/ 1.0 2.0)))) (fp.sub RNE .cse3 (let ((.cse8 (fp.add RNE c_~yn~0 c_~ui~0))) (let ((.cse4 (fp.add RNE .cse8 c_~ui~0))) (fp.add RNE .cse4 (fp.mul RNE .cse3 (let ((.cse7 ((_ to_fp 11 53) RNE (_ bv1 32))) (.cse5 (fp.sub RNE .cse3 .cse4)) (.cse6 (fp.sub RNE .cse3 .cse8))) (fp.add RNE (fp.add RNE .cse5 (fp.div RNE (fp.mul RNE (fp.add RNE .cse6 .cse5) .cse7) .cse7)) (fp.mul RNE (fp.div RNE .cse7 .cse7) (fp.sub RNE .cse5 .cse6))))))))))) (.cse2 ((_ to_fp 11 53) RNE 1.0))) (and (= c_~yn~0 .cse0) (= c_~ui~0 .cse0) (fp.leq .cse1 .cse2) (fp.geq .cse1 (fp.neg .cse2)))) is different from true [2018-09-20 14:24:49,211 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 1.0 2.0))) (.cse4 ((_ to_fp 11 53) RNE (_ bv0 32))) (.cse2 (fp.sub RNE c_main_~yc~0 (let ((.cse8 (fp.add RNE c_~yn~0 c_~ui~0))) (let ((.cse5 (fp.add RNE .cse8 c_~ui~0))) (fp.add RNE .cse5 (fp.mul RNE c_main_~K~0 (let ((.cse6 (fp.sub RNE c_main_~yc~0 .cse5)) (.cse7 (fp.sub RNE c_main_~yc~0 .cse8))) (fp.add RNE (fp.add RNE .cse6 (fp.div RNE (fp.mul RNE (fp.add RNE .cse7 .cse6) c_main_~T~0) c_main_~taui~0)) (fp.mul RNE (fp.div RNE c_main_~taud~0 c_main_~T~0) (fp.sub RNE .cse6 .cse7)))))))))) (.cse3 ((_ to_fp 11 53) RNE 1.0)) (.cse1 ((_ to_fp 11 53) RNE (_ bv1 32)))) (and (= c_main_~yc~0 .cse0) (= .cse1 c_main_~T~0) (= c_main_~K~0 .cse0) (fp.leq .cse2 .cse3) (= c_~yn~0 .cse4) (= c_~ui~0 .cse4) (= .cse1 c_main_~taud~0) (fp.geq .cse2 (fp.neg .cse3)) (= .cse1 c_main_~taui~0))) is different from false [2018-09-20 14:24:52,326 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 1.0 2.0))) (.cse4 ((_ to_fp 11 53) RNE (_ bv0 32))) (.cse2 (fp.sub RNE c_main_~yc~0 (let ((.cse8 (fp.add RNE c_~yn~0 c_~ui~0))) (let ((.cse5 (fp.add RNE .cse8 c_~ui~0))) (fp.add RNE .cse5 (fp.mul RNE c_main_~K~0 (let ((.cse6 (fp.sub RNE c_main_~yc~0 .cse5)) (.cse7 (fp.sub RNE c_main_~yc~0 .cse8))) (fp.add RNE (fp.add RNE .cse6 (fp.div RNE (fp.mul RNE (fp.add RNE .cse7 .cse6) c_main_~T~0) c_main_~taui~0)) (fp.mul RNE (fp.div RNE c_main_~taud~0 c_main_~T~0) (fp.sub RNE .cse6 .cse7)))))))))) (.cse3 ((_ to_fp 11 53) RNE 1.0)) (.cse1 ((_ to_fp 11 53) RNE (_ bv1 32)))) (and (= c_main_~yc~0 .cse0) (= .cse1 c_main_~T~0) (= c_main_~K~0 .cse0) (fp.leq .cse2 .cse3) (= c_~yn~0 .cse4) (= c_~ui~0 .cse4) (= .cse1 c_main_~taud~0) (fp.geq .cse2 (fp.neg .cse3)) (= .cse1 c_main_~taui~0))) is different from true [2018-09-20 14:24:55,460 WARN L819 $PredicateComparison]: unable to prove that (and (= |c_old(~yn~0)| c_~yn~0) (= c_~ui~0 ((_ to_fp 11 53) RNE (_ bv0 32))) (forall ((v_prenex_12 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse5 (fp.div RNE v_prenex_9 v_prenex_11)) (.cse7 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.neg .cse7)) (.cse0 (fp.sub RNE v_prenex_10 (let ((.cse11 (fp.add RNE |c_old(~yn~0)| c_~ui~0))) (let ((.cse8 (fp.add RNE .cse11 c_~ui~0))) (fp.add RNE .cse8 (fp.mul RNE v_prenex_13 (let ((.cse9 (fp.sub RNE v_prenex_10 .cse8)) (.cse10 (fp.sub RNE v_prenex_10 .cse11))) (fp.add RNE (fp.add RNE .cse9 (fp.div RNE (fp.mul RNE (fp.add RNE .cse10 .cse9) v_prenex_11) v_prenex_12)) (fp.mul RNE .cse5 (fp.sub RNE .cse9 .cse10))))))))))) (or (not (fp.geq .cse0 .cse1)) (fp.geq (fp.sub RNE v_prenex_10 (let ((.cse6 (fp.add RNE c_~yn~0 c_~ui~0))) (let ((.cse2 (fp.add RNE .cse6 c_~ui~0))) (fp.add RNE .cse2 (fp.mul RNE v_prenex_13 (let ((.cse3 (fp.sub RNE v_prenex_10 .cse2)) (.cse4 (fp.sub RNE v_prenex_10 .cse6))) (fp.add RNE (fp.add RNE .cse3 (fp.div RNE (fp.mul RNE (fp.add RNE .cse4 .cse3) v_prenex_11) v_prenex_12)) (fp.mul RNE .cse5 (fp.sub RNE .cse3 .cse4))))))))) .cse1) (not (fp.leq .cse0 .cse7)))))) (forall ((v_main_~taud~0_BEFORE_CALL_4 (_ FloatingPoint 11 53)) (v_main_~yc~0_BEFORE_CALL_10 (_ FloatingPoint 11 53)) (v_main_~T~0_BEFORE_CALL_4 (_ FloatingPoint 11 53)) (v_main_~taui~0_BEFORE_CALL_4 (_ FloatingPoint 11 53)) (v_main_~K~0_BEFORE_CALL_4 (_ FloatingPoint 11 53))) (let ((.cse17 (fp.div RNE v_main_~taud~0_BEFORE_CALL_4 v_main_~T~0_BEFORE_CALL_4))) (let ((.cse12 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_10 (let ((.cse22 (fp.add RNE |c_old(~yn~0)| c_~ui~0))) (let ((.cse19 (fp.add RNE .cse22 c_~ui~0))) (fp.add RNE .cse19 (fp.mul RNE v_main_~K~0_BEFORE_CALL_4 (let ((.cse20 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_10 .cse19)) (.cse21 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_10 .cse22))) (fp.add RNE (fp.add RNE .cse20 (fp.div RNE (fp.mul RNE (fp.add RNE .cse21 .cse20) v_main_~T~0_BEFORE_CALL_4) v_main_~taui~0_BEFORE_CALL_4)) (fp.mul RNE .cse17 (fp.sub RNE .cse20 .cse21)))))))))) (.cse13 ((_ to_fp 11 53) RNE 1.0))) (or (not (fp.leq .cse12 .cse13)) (fp.leq (fp.sub RNE v_main_~yc~0_BEFORE_CALL_10 (let ((.cse18 (fp.add RNE c_~yn~0 c_~ui~0))) (let ((.cse14 (fp.add RNE .cse18 c_~ui~0))) (fp.add RNE .cse14 (fp.mul RNE v_main_~K~0_BEFORE_CALL_4 (let ((.cse15 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_10 .cse14)) (.cse16 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_10 .cse18))) (fp.add RNE (fp.add RNE .cse15 (fp.div RNE (fp.mul RNE (fp.add RNE .cse16 .cse15) v_main_~T~0_BEFORE_CALL_4) v_main_~taui~0_BEFORE_CALL_4)) (fp.mul RNE .cse17 (fp.sub RNE .cse15 .cse16))))))))) .cse13) (not (fp.geq .cse12 (fp.neg .cse13)))))))) is different from true [2018-09-20 14:24:58,743 WARN L819 $PredicateComparison]: unable to prove that (and (= c_~yn~0 (fp.add RNE |c_old(~yn~0)| c_~ui~0)) (forall ((v_main_~taud~0_BEFORE_CALL_4 (_ FloatingPoint 11 53)) (v_main_~yc~0_BEFORE_CALL_10 (_ FloatingPoint 11 53)) (v_main_~T~0_BEFORE_CALL_4 (_ FloatingPoint 11 53)) (v_main_~taui~0_BEFORE_CALL_4 (_ FloatingPoint 11 53)) (v_main_~K~0_BEFORE_CALL_4 (_ FloatingPoint 11 53))) (let ((.cse5 (fp.div RNE v_main_~taud~0_BEFORE_CALL_4 v_main_~T~0_BEFORE_CALL_4))) (let ((.cse0 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_10 (let ((.cse9 (fp.add RNE |c_old(~yn~0)| c_~ui~0))) (let ((.cse6 (fp.add RNE .cse9 c_~ui~0))) (fp.add RNE .cse6 (fp.mul RNE v_main_~K~0_BEFORE_CALL_4 (let ((.cse7 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_10 .cse6)) (.cse8 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_10 .cse9))) (fp.add RNE (fp.add RNE .cse7 (fp.div RNE (fp.mul RNE (fp.add RNE .cse8 .cse7) v_main_~T~0_BEFORE_CALL_4) v_main_~taui~0_BEFORE_CALL_4)) (fp.mul RNE .cse5 (fp.sub RNE .cse7 .cse8)))))))))) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (or (not (fp.leq .cse0 .cse1)) (fp.leq (fp.sub RNE v_main_~yc~0_BEFORE_CALL_10 (let ((.cse2 (fp.add RNE c_~yn~0 c_~ui~0))) (fp.add RNE .cse2 (fp.mul RNE v_main_~K~0_BEFORE_CALL_4 (let ((.cse3 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_10 .cse2)) (.cse4 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_10 |c_y_#res|))) (fp.add RNE (fp.add RNE .cse3 (fp.div RNE (fp.mul RNE (fp.add RNE .cse4 .cse3) v_main_~T~0_BEFORE_CALL_4) v_main_~taui~0_BEFORE_CALL_4)) (fp.mul RNE .cse5 (fp.sub RNE .cse3 .cse4)))))))) .cse1) (not (fp.geq .cse0 (fp.neg .cse1))))))) (forall ((v_prenex_12 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse12 ((_ to_fp 11 53) RNE 1.0)) (.cse16 (fp.div RNE v_prenex_9 v_prenex_11))) (let ((.cse10 (fp.sub RNE v_prenex_10 (let ((.cse20 (fp.add RNE |c_old(~yn~0)| c_~ui~0))) (let ((.cse17 (fp.add RNE .cse20 c_~ui~0))) (fp.add RNE .cse17 (fp.mul RNE v_prenex_13 (let ((.cse18 (fp.sub RNE v_prenex_10 .cse17)) (.cse19 (fp.sub RNE v_prenex_10 .cse20))) (fp.add RNE (fp.add RNE .cse18 (fp.div RNE (fp.mul RNE (fp.add RNE .cse19 .cse18) v_prenex_11) v_prenex_12)) (fp.mul RNE .cse16 (fp.sub RNE .cse18 .cse19)))))))))) (.cse11 (fp.neg .cse12))) (or (not (fp.geq .cse10 .cse11)) (not (fp.leq .cse10 .cse12)) (fp.geq (fp.sub RNE v_prenex_10 (let ((.cse13 (fp.add RNE c_~yn~0 c_~ui~0))) (fp.add RNE .cse13 (fp.mul RNE v_prenex_13 (let ((.cse14 (fp.sub RNE v_prenex_10 .cse13)) (.cse15 (fp.sub RNE v_prenex_10 |c_y_#res|))) (fp.add RNE (fp.add RNE .cse14 (fp.div RNE (fp.mul RNE (fp.add RNE .cse15 .cse14) v_prenex_11) v_prenex_12)) (fp.mul RNE .cse16 (fp.sub RNE .cse14 .cse15)))))))) .cse11))))) (= c_~yn~0 |c_y_#res|) (= c_~ui~0 ((_ to_fp 11 53) RNE (_ bv0 32)))) is different from true [2018-09-20 14:25:00,916 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 1.0 2.0))) (.cse1 ((_ to_fp 11 53) RNE (_ bv0 32))) (.cse3 (fp.sub RNE c_main_~yc~0 (let ((.cse5 (fp.add RNE c_~yn~0 c_~ui~0))) (fp.add RNE .cse5 (fp.mul RNE c_main_~K~0 (let ((.cse6 (fp.sub RNE c_main_~yc~0 .cse5)) (.cse7 (fp.sub RNE c_main_~yc~0 |c_main_#t~ret0|))) (fp.add RNE (fp.add RNE .cse6 (fp.div RNE (fp.mul RNE (fp.add RNE .cse7 .cse6) c_main_~T~0) c_main_~taui~0)) (fp.mul RNE (fp.div RNE c_main_~taud~0 c_main_~T~0) (fp.sub RNE .cse6 .cse7))))))))) (.cse4 ((_ to_fp 11 53) RNE 1.0)) (.cse2 ((_ to_fp 11 53) RNE (_ bv1 32)))) (and (= c_main_~yc~0 .cse0) (= c_~yn~0 (fp.add RNE .cse1 c_~ui~0)) (= .cse2 c_main_~T~0) (= c_main_~K~0 .cse0) (= |c_main_#t~ret0| c_~yn~0) (= c_~ui~0 .cse1) (= .cse2 c_main_~taud~0) (fp.leq .cse3 .cse4) (fp.geq .cse3 (fp.neg .cse4)) (= .cse2 c_main_~taui~0))) is different from false [2018-09-20 14:25:04,009 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 1.0 2.0))) (.cse1 ((_ to_fp 11 53) RNE (_ bv0 32))) (.cse3 (fp.sub RNE c_main_~yc~0 (let ((.cse5 (fp.add RNE c_~yn~0 c_~ui~0))) (fp.add RNE .cse5 (fp.mul RNE c_main_~K~0 (let ((.cse6 (fp.sub RNE c_main_~yc~0 .cse5)) (.cse7 (fp.sub RNE c_main_~yc~0 |c_main_#t~ret0|))) (fp.add RNE (fp.add RNE .cse6 (fp.div RNE (fp.mul RNE (fp.add RNE .cse7 .cse6) c_main_~T~0) c_main_~taui~0)) (fp.mul RNE (fp.div RNE c_main_~taud~0 c_main_~T~0) (fp.sub RNE .cse6 .cse7))))))))) (.cse4 ((_ to_fp 11 53) RNE 1.0)) (.cse2 ((_ to_fp 11 53) RNE (_ bv1 32)))) (and (= c_main_~yc~0 .cse0) (= c_~yn~0 (fp.add RNE .cse1 c_~ui~0)) (= .cse2 c_main_~T~0) (= c_main_~K~0 .cse0) (= |c_main_#t~ret0| c_~yn~0) (= c_~ui~0 .cse1) (= .cse2 c_main_~taud~0) (fp.leq .cse3 .cse4) (fp.geq .cse3 (fp.neg .cse4)) (= .cse2 c_main_~taui~0))) is different from true [2018-09-20 14:25:06,687 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 1.0 2.0))) (.cse3 ((_ to_fp 11 53) RNE (_ bv0 32))) (.cse1 (fp.sub RNE c_main_~yc~0 (let ((.cse5 (fp.add RNE c_~yn~0 c_~ui~0))) (fp.add RNE .cse5 (fp.mul RNE c_main_~K~0 (let ((.cse6 (fp.sub RNE c_main_~yc~0 .cse5))) (fp.add RNE (fp.add RNE .cse6 (fp.div RNE (fp.mul RNE (fp.add RNE c_main_~sumej~0 .cse6) c_main_~T~0) c_main_~taui~0)) (fp.mul RNE (fp.div RNE c_main_~taud~0 c_main_~T~0) (fp.sub RNE .cse6 c_main_~epi~0))))))))) (.cse2 ((_ to_fp 11 53) RNE 1.0)) (.cse4 ((_ to_fp 11 53) RNE (_ bv1 32)))) (and (= c_main_~yc~0 .cse0) (fp.geq .cse1 (fp.neg .cse2)) (= c_main_~sumej~0 c_main_~epi~0) (= c_~yn~0 (fp.add RNE .cse3 c_~ui~0)) (= .cse4 c_main_~T~0) (= c_main_~K~0 .cse0) (= (fp.sub RNE c_main_~yc~0 c_~yn~0) c_main_~epi~0) (= c_~ui~0 .cse3) (= .cse4 c_main_~taud~0) (fp.leq .cse1 .cse2) (= .cse4 c_main_~taui~0))) is different from false [2018-09-20 14:25:09,741 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE (/ 1.0 2.0))) (.cse3 ((_ to_fp 11 53) RNE (_ bv0 32))) (.cse1 (fp.sub RNE c_main_~yc~0 (let ((.cse5 (fp.add RNE c_~yn~0 c_~ui~0))) (fp.add RNE .cse5 (fp.mul RNE c_main_~K~0 (let ((.cse6 (fp.sub RNE c_main_~yc~0 .cse5))) (fp.add RNE (fp.add RNE .cse6 (fp.div RNE (fp.mul RNE (fp.add RNE c_main_~sumej~0 .cse6) c_main_~T~0) c_main_~taui~0)) (fp.mul RNE (fp.div RNE c_main_~taud~0 c_main_~T~0) (fp.sub RNE .cse6 c_main_~epi~0))))))))) (.cse2 ((_ to_fp 11 53) RNE 1.0)) (.cse4 ((_ to_fp 11 53) RNE (_ bv1 32)))) (and (= c_main_~yc~0 .cse0) (fp.geq .cse1 (fp.neg .cse2)) (= c_main_~sumej~0 c_main_~epi~0) (= c_~yn~0 (fp.add RNE .cse3 c_~ui~0)) (= .cse4 c_main_~T~0) (= c_main_~K~0 .cse0) (= (fp.sub RNE c_main_~yc~0 c_~yn~0) c_main_~epi~0) (= c_~ui~0 .cse3) (= .cse4 c_main_~taud~0) (fp.leq .cse1 .cse2) (= .cse4 c_main_~taui~0))) is different from true [2018-09-20 14:25:12,861 WARN L819 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_6 (_ FloatingPoint 11 53)) (v_prenex_7 (_ FloatingPoint 11 53)) (v_prenex_4 (_ FloatingPoint 11 53)) (v_prenex_5 (_ FloatingPoint 11 53)) (v_prenex_2 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53)) (v_prenex_8 (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div RNE v_prenex_3 v_prenex_7)) (.cse5 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (fp.neg .cse5)) (.cse4 (fp.sub RNE v_prenex_8 (let ((.cse6 (fp.add RNE |c_old(~yn~0)| c_~ui~0))) (fp.add RNE .cse6 (fp.mul RNE v_prenex_4 (let ((.cse7 (fp.sub RNE v_prenex_8 .cse6))) (fp.add RNE (fp.add RNE .cse7 (fp.div RNE (fp.mul RNE (fp.add RNE v_prenex_6 .cse7) v_prenex_7) v_prenex_5)) (fp.mul RNE .cse2 (fp.sub RNE .cse7 v_prenex_2)))))))))) (or (fp.geq (fp.sub RNE v_prenex_8 (let ((.cse0 (fp.add RNE c_~yn~0 c_~ui~0))) (fp.add RNE .cse0 (fp.mul RNE v_prenex_4 (let ((.cse1 (fp.sub RNE v_prenex_8 .cse0))) (fp.add RNE (fp.add RNE .cse1 (fp.div RNE (fp.mul RNE (fp.add RNE v_prenex_6 .cse1) v_prenex_7) v_prenex_5)) (fp.mul RNE .cse2 (fp.sub RNE .cse1 v_prenex_2)))))))) .cse3) (not (fp.geq .cse4 .cse3)) (not (fp.leq .cse4 .cse5)))))) (forall ((v_main_~epi~0_BEFORE_CALL_4 (_ FloatingPoint 11 53)) (v_main_~taud~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~K~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~taui~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~sumej~0_BEFORE_CALL_2 (_ FloatingPoint 11 53)) (v_main_~T~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~yc~0_BEFORE_CALL_9 (_ FloatingPoint 11 53))) (let ((.cse12 (fp.div RNE v_main_~taud~0_BEFORE_CALL_3 v_main_~T~0_BEFORE_CALL_3))) (let ((.cse8 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_9 (let ((.cse13 (fp.add RNE |c_old(~yn~0)| c_~ui~0))) (fp.add RNE .cse13 (fp.mul RNE v_main_~K~0_BEFORE_CALL_3 (let ((.cse14 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_9 .cse13))) (fp.add RNE (fp.add RNE .cse14 (fp.div RNE (fp.mul RNE (fp.add RNE v_main_~sumej~0_BEFORE_CALL_2 .cse14) v_main_~T~0_BEFORE_CALL_3) v_main_~taui~0_BEFORE_CALL_3)) (fp.mul RNE .cse12 (fp.sub RNE .cse14 v_main_~epi~0_BEFORE_CALL_4))))))))) (.cse9 ((_ to_fp 11 53) RNE 1.0))) (or (not (fp.geq .cse8 (fp.neg .cse9))) (fp.leq (fp.sub RNE v_main_~yc~0_BEFORE_CALL_9 (let ((.cse10 (fp.add RNE c_~yn~0 c_~ui~0))) (fp.add RNE .cse10 (fp.mul RNE v_main_~K~0_BEFORE_CALL_3 (let ((.cse11 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_9 .cse10))) (fp.add RNE (fp.add RNE .cse11 (fp.div RNE (fp.mul RNE (fp.add RNE v_main_~sumej~0_BEFORE_CALL_2 .cse11) v_main_~T~0_BEFORE_CALL_3) v_main_~taui~0_BEFORE_CALL_3)) (fp.mul RNE .cse12 (fp.sub RNE .cse11 v_main_~epi~0_BEFORE_CALL_4)))))))) .cse9) (not (fp.leq .cse8 .cse9)))))) (= |c_old(~yn~0)| c_~yn~0) (= c_~ui~0 ((_ to_fp 11 53) RNE (_ bv0 32)))) is different from true [2018-09-20 14:25:16,044 WARN L819 $PredicateComparison]: unable to prove that (and (forall ((v_main_~epi~0_BEFORE_CALL_4 (_ FloatingPoint 11 53)) (v_main_~taud~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~K~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~taui~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~sumej~0_BEFORE_CALL_2 (_ FloatingPoint 11 53)) (v_main_~T~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~yc~0_BEFORE_CALL_9 (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div RNE v_main_~taud~0_BEFORE_CALL_3 v_main_~T~0_BEFORE_CALL_3))) (let ((.cse0 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_9 (let ((.cse4 (fp.add RNE |c_old(~yn~0)| c_~ui~0))) (fp.add RNE .cse4 (fp.mul RNE v_main_~K~0_BEFORE_CALL_3 (let ((.cse5 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_9 .cse4))) (fp.add RNE (fp.add RNE .cse5 (fp.div RNE (fp.mul RNE (fp.add RNE v_main_~sumej~0_BEFORE_CALL_2 .cse5) v_main_~T~0_BEFORE_CALL_3) v_main_~taui~0_BEFORE_CALL_3)) (fp.mul RNE .cse3 (fp.sub RNE .cse5 v_main_~epi~0_BEFORE_CALL_4))))))))) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (or (not (fp.geq .cse0 (fp.neg .cse1))) (not (fp.leq .cse0 .cse1)) (fp.leq (fp.sub RNE v_main_~yc~0_BEFORE_CALL_9 (fp.add RNE c_~yn~0 (fp.mul RNE v_main_~K~0_BEFORE_CALL_3 (let ((.cse2 (fp.sub RNE v_main_~yc~0_BEFORE_CALL_9 |c_y_#res|))) (fp.add RNE (fp.add RNE .cse2 (fp.div RNE (fp.mul RNE (fp.add RNE v_main_~sumej~0_BEFORE_CALL_2 .cse2) v_main_~T~0_BEFORE_CALL_3) v_main_~taui~0_BEFORE_CALL_3)) (fp.mul RNE .cse3 (fp.sub RNE .cse2 v_main_~epi~0_BEFORE_CALL_4))))))) .cse1))))) (= c_~yn~0 (fp.add RNE |c_old(~yn~0)| c_~ui~0)) (= c_~yn~0 |c_y_#res|) (= c_~ui~0 ((_ to_fp 11 53) RNE (_ bv0 32))) (forall ((v_prenex_6 (_ FloatingPoint 11 53)) (v_prenex_7 (_ FloatingPoint 11 53)) (v_prenex_4 (_ FloatingPoint 11 53)) (v_prenex_5 (_ FloatingPoint 11 53)) (v_prenex_2 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53)) (v_prenex_8 (_ FloatingPoint 11 53))) (let ((.cse9 (fp.div RNE v_prenex_3 v_prenex_7)) (.cse10 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse7 (fp.neg .cse10)) (.cse6 (fp.sub RNE v_prenex_8 (let ((.cse11 (fp.add RNE |c_old(~yn~0)| c_~ui~0))) (fp.add RNE .cse11 (fp.mul RNE v_prenex_4 (let ((.cse12 (fp.sub RNE v_prenex_8 .cse11))) (fp.add RNE (fp.add RNE .cse12 (fp.div RNE (fp.mul RNE (fp.add RNE v_prenex_6 .cse12) v_prenex_7) v_prenex_5)) (fp.mul RNE .cse9 (fp.sub RNE .cse12 v_prenex_2)))))))))) (or (not (fp.geq .cse6 .cse7)) (fp.geq (fp.sub RNE v_prenex_8 (fp.add RNE c_~yn~0 (fp.mul RNE v_prenex_4 (let ((.cse8 (fp.sub RNE v_prenex_8 |c_y_#res|))) (fp.add RNE (fp.add RNE .cse8 (fp.div RNE (fp.mul RNE (fp.add RNE v_prenex_6 .cse8) v_prenex_7) v_prenex_5)) (fp.mul RNE .cse9 (fp.sub RNE .cse8 v_prenex_2))))))) .cse7) (not (fp.leq .cse6 .cse10))))))) is different from true [2018-09-20 14:25:18,113 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) RNE (_ bv0 32)))) (let ((.cse3 (fp.sub RNE c_main_~yc~0 (fp.add RNE c_~yn~0 (fp.mul RNE c_main_~K~0 (let ((.cse6 (fp.sub RNE c_main_~yc~0 |c_main_#t~ret2|))) (fp.add RNE (fp.add RNE .cse6 (fp.div RNE (fp.mul RNE (fp.add RNE c_main_~sumej~0 .cse6) c_main_~T~0) c_main_~taui~0)) (fp.mul RNE (fp.div RNE c_main_~taud~0 c_main_~T~0) (fp.sub RNE .cse6 c_main_~epi~0)))))))) (.cse4 ((_ to_fp 11 53) RNE 1.0)) (.cse1 (fp.add RNE .cse5 .cse5)) (.cse0 ((_ to_fp 11 53) RNE (/ 1.0 2.0))) (.cse2 ((_ to_fp 11 53) RNE (_ bv1 32)))) (and (= c_main_~yc~0 .cse0) (= c_main_~sumej~0 c_main_~epi~0) (= (fp.sub RNE c_main_~yc~0 .cse1) c_main_~epi~0) (= .cse2 c_main_~T~0) (fp.geq .cse3 (fp.neg .cse4)) (fp.leq .cse3 .cse4) (= c_~yn~0 (fp.add RNE .cse1 .cse5)) (= c_main_~K~0 .cse0) (= |c_main_#t~ret2| c_~yn~0) (= .cse2 c_main_~taud~0) (= .cse2 c_main_~taui~0)))) is different from false [2018-09-20 14:25:21,161 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) RNE (_ bv0 32)))) (let ((.cse3 (fp.sub RNE c_main_~yc~0 (fp.add RNE c_~yn~0 (fp.mul RNE c_main_~K~0 (let ((.cse6 (fp.sub RNE c_main_~yc~0 |c_main_#t~ret2|))) (fp.add RNE (fp.add RNE .cse6 (fp.div RNE (fp.mul RNE (fp.add RNE c_main_~sumej~0 .cse6) c_main_~T~0) c_main_~taui~0)) (fp.mul RNE (fp.div RNE c_main_~taud~0 c_main_~T~0) (fp.sub RNE .cse6 c_main_~epi~0)))))))) (.cse4 ((_ to_fp 11 53) RNE 1.0)) (.cse1 (fp.add RNE .cse5 .cse5)) (.cse0 ((_ to_fp 11 53) RNE (/ 1.0 2.0))) (.cse2 ((_ to_fp 11 53) RNE (_ bv1 32)))) (and (= c_main_~yc~0 .cse0) (= c_main_~sumej~0 c_main_~epi~0) (= (fp.sub RNE c_main_~yc~0 .cse1) c_main_~epi~0) (= .cse2 c_main_~T~0) (fp.geq .cse3 (fp.neg .cse4)) (fp.leq .cse3 .cse4) (= c_~yn~0 (fp.add RNE .cse1 .cse5)) (= c_main_~K~0 .cse0) (= |c_main_#t~ret2| c_~yn~0) (= .cse2 c_main_~taud~0) (= .cse2 c_main_~taui~0)))) is different from true [2018-09-20 14:25:27,662 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 11 53) RNE (_ bv0 32)))) (let ((.cse0 ((_ to_fp 11 53) RNE (/ 1.0 2.0))) (.cse7 (fp.add RNE .cse8 .cse8)) (.cse3 ((_ to_fp 11 53) RNE (_ bv1 32)))) (let ((.cse4 (fp.div RNE .cse3 .cse3)) (.cse2 (fp.sub RNE .cse0 .cse7)) (.cse6 (fp.add RNE .cse7 .cse8))) (and (= c_~ui~0 (fp.mul RNE .cse0 (let ((.cse1 (fp.sub RNE .cse0 c_~yn~0))) (fp.add RNE (fp.add RNE .cse1 (fp.div RNE (fp.mul RNE (fp.add RNE .cse2 .cse1) .cse3) .cse3)) (fp.mul RNE .cse4 (fp.sub RNE .cse1 .cse2)))))) (= c_~ui~0 (fp.mul RNE .cse0 (let ((.cse5 (fp.sub RNE .cse0 .cse6))) (fp.add RNE (fp.add RNE .cse5 (fp.div RNE (fp.mul RNE (fp.add RNE .cse2 .cse5) .cse3) .cse3)) (fp.mul RNE .cse4 (fp.sub RNE .cse5 .cse2)))))) (= c_~yn~0 .cse6) (= |c_old(~yn~0)| c_~yn~0))))) is different from true [2018-09-20 14:25:29,853 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 11 53) RNE (_ bv0 32))) (.cse5 ((_ to_fp 11 53) RNE (_ bv1 32)))) (let ((.cse1 (fp.sub RNE c_main_~yc~0 (fp.add RNE c_~yn~0 c_~ui~0))) (.cse2 ((_ to_fp 11 53) RNE 1.0)) (.cse0 ((_ to_fp 11 53) RNE (/ 1.0 2.0))) (.cse6 (fp.div RNE .cse5 .cse5)) (.cse7 (fp.add RNE .cse8 .cse8))) (and (= c_main_~yc~0 .cse0) (fp.leq .cse1 .cse2) (= c_~ui~0 (fp.mul RNE .cse0 (let ((.cse3 (fp.sub RNE .cse0 c_~yn~0)) (.cse4 (fp.sub RNE .cse0 .cse7))) (fp.add RNE (fp.add RNE .cse3 (fp.div RNE (fp.mul RNE (fp.add RNE .cse4 .cse3) .cse5) .cse5)) (fp.mul RNE .cse6 (fp.sub RNE .cse3 .cse4)))))) (= c_~yn~0 (fp.add RNE .cse7 .cse8)) (fp.geq .cse1 (fp.neg .cse2)) (= c_~ui~0 (fp.mul RNE .cse0 (let ((.cse9 (fp.sub RNE c_main_~yc~0 c_~yn~0)) (.cse10 (fp.sub RNE c_main_~yc~0 .cse7))) (fp.add RNE (fp.add RNE .cse9 (fp.div RNE (fp.mul RNE (fp.add RNE .cse10 .cse9) .cse5) .cse5)) (fp.mul RNE .cse6 (fp.sub RNE .cse9 .cse10))))))))) is different from false [2018-09-20 14:25:31,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-20 14:25:31,931 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:810) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:732) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:338) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:381) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:280) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.returnSuccessors(AbstractInterpolantAutomaton.java:280) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.returnSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.returnSuccessors(TotalizeNwa.java:308) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.returnSuccessors(ComplementDeterministicNwa.java:142) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.returnSuccessors(ProductNwa.java:284) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.returnSuccessorsGivenHier(ProductNwa.java:308) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addReturnsAndSuccessors(NestedWordAutomatonReachableStates.java:1124) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:958) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:674) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:603) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 43 more [2018-09-20 14:25:31,942 INFO L168 Benchmark]: Toolchain (without parser) took 219397.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 954.6 MB in the beginning and 890.4 MB in the end (delta: 64.1 MB). Peak memory consumption was 205.2 MB. Max. memory is 11.5 GB. [2018-09-20 14:25:31,943 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 14:25:31,946 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.62 ms. Allocated memory is still 1.0 GB. Free memory was 954.6 MB in the beginning and 943.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-20 14:25:31,947 INFO L168 Benchmark]: Boogie Preprocessor took 62.84 ms. Allocated memory is still 1.0 GB. Free memory is still 943.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 14:25:31,947 INFO L168 Benchmark]: RCFGBuilder took 3702.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2018-09-20 14:25:31,948 INFO L168 Benchmark]: TraceAbstraction took 215274.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 890.4 MB in the end (delta: 220.2 MB). Peak memory consumption was 220.2 MB. Max. memory is 11.5 GB. [2018-09-20 14:25:31,956 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 348.62 ms. Allocated memory is still 1.0 GB. Free memory was 954.6 MB in the beginning and 943.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.84 ms. Allocated memory is still 1.0 GB. Free memory is still 943.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 3702.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 215274.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 890.4 MB in the end (delta: 220.2 MB). Peak memory consumption was 220.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...