/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1230.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:32:50,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:32:50,530 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:32:50,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:32:50,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:32:50,544 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:32:50,545 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:32:50,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:32:50,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:32:50,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:32:50,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:32:50,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:32:50,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:32:50,553 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:32:50,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:32:50,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:32:50,556 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:32:50,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:32:50,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:32:50,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:32:50,562 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:32:50,563 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:32:50,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:32:50,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:32:50,567 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:32:50,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:32:50,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:32:50,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:32:50,569 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:32:50,569 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:32:50,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:32:50,570 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:32:50,571 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:32:50,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:32:50,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:32:50,573 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:32:50,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:32:50,574 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:32:50,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:32:50,575 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:32:50,576 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:32:50,577 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 00:32:50,585 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:32:50,586 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:32:50,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:32:50,587 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:32:50,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:32:50,588 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:32:50,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:32:50,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:32:50,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:32:50,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:32:50,588 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:32:50,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:32:50,589 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:32:50,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:32:50,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:32:50,590 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:32:50,590 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:32:50,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:32:50,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:32:50,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:32:50,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:32:50,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:32:50,591 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 00:32:50,898 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:32:50,920 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:32:50,923 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:32:50,925 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:32:50,925 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:32:50,927 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1230.c [2020-07-11 00:32:51,001 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/472328507/c754074231b747d8b0a1f77050d8d500/FLAG9dd00c74a [2020-07-11 00:32:51,461 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:32:51,462 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1230.c [2020-07-11 00:32:51,468 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/472328507/c754074231b747d8b0a1f77050d8d500/FLAG9dd00c74a [2020-07-11 00:32:51,882 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/472328507/c754074231b747d8b0a1f77050d8d500 [2020-07-11 00:32:51,890 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:32:51,892 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:32:51,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:32:51,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:32:51,898 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:32:51,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:32:51" (1/1) ... [2020-07-11 00:32:51,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dcf5463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:51, skipping insertion in model container [2020-07-11 00:32:51,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:32:51" (1/1) ... [2020-07-11 00:32:51,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:32:51,935 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:32:52,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:32:52,128 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:32:52,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:32:52,275 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:32:52,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:52 WrapperNode [2020-07-11 00:32:52,278 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:32:52,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:32:52,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:32:52,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:32:52,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:52" (1/1) ... [2020-07-11 00:32:52,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:52" (1/1) ... [2020-07-11 00:32:52,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:52" (1/1) ... [2020-07-11 00:32:52,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:52" (1/1) ... [2020-07-11 00:32:52,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:52" (1/1) ... [2020-07-11 00:32:52,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:52" (1/1) ... [2020-07-11 00:32:52,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:52" (1/1) ... [2020-07-11 00:32:52,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:32:52,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:32:52,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:32:52,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:32:52,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32: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 [2020-07-11 00:32:52,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:32:52,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:32:52,403 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2020-07-11 00:32:52,403 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2020-07-11 00:32:52,403 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_double [2020-07-11 00:32:52,403 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:32:52,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:32:52,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2020-07-11 00:32:52,404 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2020-07-11 00:32:52,404 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2020-07-11 00:32:52,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-11 00:32:52,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-11 00:32:52,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 00:32:52,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 00:32:52,405 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_double [2020-07-11 00:32:52,405 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:32:52,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:32:52,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:32:52,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-11 00:32:52,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 00:32:52,913 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:32:52,913 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-11 00:32:52,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:32:52 BoogieIcfgContainer [2020-07-11 00:32:52,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:32:52,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:32:52,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:32:52,923 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:32:52,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:32:51" (1/3) ... [2020-07-11 00:32:52,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aea7ec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:32:52, skipping insertion in model container [2020-07-11 00:32:52,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:52" (2/3) ... [2020-07-11 00:32:52,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aea7ec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:32:52, skipping insertion in model container [2020-07-11 00:32:52,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:32:52" (3/3) ... [2020-07-11 00:32:52,927 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1230.c [2020-07-11 00:32:52,938 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:32:52,947 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:32:52,961 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:32:52,984 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:32:52,984 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:32:52,985 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:32:52,985 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:32:52,985 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:32:52,985 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:32:52,985 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:32:52,986 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:32:53,003 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2020-07-11 00:32:53,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-11 00:32:53,017 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:32:53,019 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:32:53,019 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:32:53,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:32:53,026 INFO L82 PathProgramCache]: Analyzing trace with hash 6613302, now seen corresponding path program 1 times [2020-07-11 00:32:53,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:32:53,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2023184127] [2020-07-11 00:32:53,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:32:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:53,287 INFO L280 TraceCheckUtils]: 0: Hoare triple {110#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {82#true} is VALID [2020-07-11 00:32:53,288 INFO L280 TraceCheckUtils]: 1: Hoare triple {82#true} #valid := #valid[0 := 0]; {82#true} is VALID [2020-07-11 00:32:53,289 INFO L280 TraceCheckUtils]: 2: Hoare triple {82#true} assume 0 < #StackHeapBarrier; {82#true} is VALID [2020-07-11 00:32:53,289 INFO L280 TraceCheckUtils]: 3: Hoare triple {82#true} assume true; {82#true} is VALID [2020-07-11 00:32:53,289 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {82#true} {82#true} #114#return; {82#true} is VALID [2020-07-11 00:32:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:53,340 INFO L280 TraceCheckUtils]: 0: Hoare triple {111#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {82#true} is VALID [2020-07-11 00:32:53,340 INFO L280 TraceCheckUtils]: 1: Hoare triple {82#true} havoc ~msw~0; {82#true} is VALID [2020-07-11 00:32:53,341 INFO L280 TraceCheckUtils]: 2: Hoare triple {82#true} havoc ~lsw~0; {82#true} is VALID [2020-07-11 00:32:53,342 INFO L280 TraceCheckUtils]: 3: Hoare triple {82#true} assume !true; {83#false} is VALID [2020-07-11 00:32:53,343 INFO L280 TraceCheckUtils]: 4: Hoare triple {83#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {83#false} is VALID [2020-07-11 00:32:53,343 INFO L280 TraceCheckUtils]: 5: Hoare triple {83#false} #res := 2; {83#false} is VALID [2020-07-11 00:32:53,343 INFO L280 TraceCheckUtils]: 6: Hoare triple {83#false} assume true; {83#false} is VALID [2020-07-11 00:32:53,344 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {83#false} {82#true} #118#return; {83#false} is VALID [2020-07-11 00:32:53,345 INFO L280 TraceCheckUtils]: 0: Hoare triple {111#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {82#true} is VALID [2020-07-11 00:32:53,345 INFO L280 TraceCheckUtils]: 1: Hoare triple {82#true} ~y := #in~y; {82#true} is VALID [2020-07-11 00:32:53,347 INFO L263 TraceCheckUtils]: 2: Hoare triple {82#true} call #t~ret4 := __fpclassify_double(~x); {111#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:32:53,348 INFO L280 TraceCheckUtils]: 3: Hoare triple {111#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {82#true} is VALID [2020-07-11 00:32:53,349 INFO L280 TraceCheckUtils]: 4: Hoare triple {82#true} havoc ~msw~0; {82#true} is VALID [2020-07-11 00:32:53,349 INFO L280 TraceCheckUtils]: 5: Hoare triple {82#true} havoc ~lsw~0; {82#true} is VALID [2020-07-11 00:32:53,350 INFO L280 TraceCheckUtils]: 6: Hoare triple {82#true} assume !true; {83#false} is VALID [2020-07-11 00:32:53,350 INFO L280 TraceCheckUtils]: 7: Hoare triple {83#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {83#false} is VALID [2020-07-11 00:32:53,351 INFO L280 TraceCheckUtils]: 8: Hoare triple {83#false} #res := 2; {83#false} is VALID [2020-07-11 00:32:53,351 INFO L280 TraceCheckUtils]: 9: Hoare triple {83#false} assume true; {83#false} is VALID [2020-07-11 00:32:53,352 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {83#false} {82#true} #118#return; {83#false} is VALID [2020-07-11 00:32:53,352 INFO L280 TraceCheckUtils]: 11: Hoare triple {83#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {83#false} is VALID [2020-07-11 00:32:53,352 INFO L280 TraceCheckUtils]: 12: Hoare triple {83#false} assume 0 == #t~ret4; {83#false} is VALID [2020-07-11 00:32:53,353 INFO L280 TraceCheckUtils]: 13: Hoare triple {83#false} havoc #t~ret4; {83#false} is VALID [2020-07-11 00:32:53,353 INFO L280 TraceCheckUtils]: 14: Hoare triple {83#false} #res := ~y; {83#false} is VALID [2020-07-11 00:32:53,354 INFO L280 TraceCheckUtils]: 15: Hoare triple {83#false} assume true; {83#false} is VALID [2020-07-11 00:32:53,354 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {83#false} {82#true} #110#return; {83#false} is VALID [2020-07-11 00:32:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:53,370 INFO L280 TraceCheckUtils]: 0: Hoare triple {82#true} ~x := #in~x; {82#true} is VALID [2020-07-11 00:32:53,370 INFO L280 TraceCheckUtils]: 1: Hoare triple {82#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {82#true} is VALID [2020-07-11 00:32:53,370 INFO L280 TraceCheckUtils]: 2: Hoare triple {82#true} assume true; {82#true} is VALID [2020-07-11 00:32:53,371 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {82#true} {83#false} #112#return; {83#false} is VALID [2020-07-11 00:32:53,372 INFO L263 TraceCheckUtils]: 0: Hoare triple {82#true} call ULTIMATE.init(); {110#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 00:32:53,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {110#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {82#true} is VALID [2020-07-11 00:32:53,373 INFO L280 TraceCheckUtils]: 2: Hoare triple {82#true} #valid := #valid[0 := 0]; {82#true} is VALID [2020-07-11 00:32:53,373 INFO L280 TraceCheckUtils]: 3: Hoare triple {82#true} assume 0 < #StackHeapBarrier; {82#true} is VALID [2020-07-11 00:32:53,374 INFO L280 TraceCheckUtils]: 4: Hoare triple {82#true} assume true; {82#true} is VALID [2020-07-11 00:32:53,374 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {82#true} {82#true} #114#return; {82#true} is VALID [2020-07-11 00:32:53,374 INFO L263 TraceCheckUtils]: 6: Hoare triple {82#true} call #t~ret9 := main(); {82#true} is VALID [2020-07-11 00:32:53,375 INFO L280 TraceCheckUtils]: 7: Hoare triple {82#true} ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {82#true} is VALID [2020-07-11 00:32:53,375 INFO L280 TraceCheckUtils]: 8: Hoare triple {82#true} ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {82#true} is VALID [2020-07-11 00:32:53,377 INFO L263 TraceCheckUtils]: 9: Hoare triple {82#true} call #t~ret7 := fmin_double(~x~0, ~y~0); {111#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:32:53,378 INFO L280 TraceCheckUtils]: 10: Hoare triple {111#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {82#true} is VALID [2020-07-11 00:32:53,378 INFO L280 TraceCheckUtils]: 11: Hoare triple {82#true} ~y := #in~y; {82#true} is VALID [2020-07-11 00:32:53,381 INFO L263 TraceCheckUtils]: 12: Hoare triple {82#true} call #t~ret4 := __fpclassify_double(~x); {111#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:32:53,381 INFO L280 TraceCheckUtils]: 13: Hoare triple {111#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {82#true} is VALID [2020-07-11 00:32:53,381 INFO L280 TraceCheckUtils]: 14: Hoare triple {82#true} havoc ~msw~0; {82#true} is VALID [2020-07-11 00:32:53,382 INFO L280 TraceCheckUtils]: 15: Hoare triple {82#true} havoc ~lsw~0; {82#true} is VALID [2020-07-11 00:32:53,383 INFO L280 TraceCheckUtils]: 16: Hoare triple {82#true} assume !true; {83#false} is VALID [2020-07-11 00:32:53,384 INFO L280 TraceCheckUtils]: 17: Hoare triple {83#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {83#false} is VALID [2020-07-11 00:32:53,384 INFO L280 TraceCheckUtils]: 18: Hoare triple {83#false} #res := 2; {83#false} is VALID [2020-07-11 00:32:53,384 INFO L280 TraceCheckUtils]: 19: Hoare triple {83#false} assume true; {83#false} is VALID [2020-07-11 00:32:53,385 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {83#false} {82#true} #118#return; {83#false} is VALID [2020-07-11 00:32:53,385 INFO L280 TraceCheckUtils]: 21: Hoare triple {83#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {83#false} is VALID [2020-07-11 00:32:53,385 INFO L280 TraceCheckUtils]: 22: Hoare triple {83#false} assume 0 == #t~ret4; {83#false} is VALID [2020-07-11 00:32:53,386 INFO L280 TraceCheckUtils]: 23: Hoare triple {83#false} havoc #t~ret4; {83#false} is VALID [2020-07-11 00:32:53,386 INFO L280 TraceCheckUtils]: 24: Hoare triple {83#false} #res := ~y; {83#false} is VALID [2020-07-11 00:32:53,386 INFO L280 TraceCheckUtils]: 25: Hoare triple {83#false} assume true; {83#false} is VALID [2020-07-11 00:32:53,387 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {83#false} {82#true} #110#return; {83#false} is VALID [2020-07-11 00:32:53,387 INFO L280 TraceCheckUtils]: 27: Hoare triple {83#false} ~res~0 := #t~ret7; {83#false} is VALID [2020-07-11 00:32:53,387 INFO L280 TraceCheckUtils]: 28: Hoare triple {83#false} havoc #t~ret7; {83#false} is VALID [2020-07-11 00:32:53,388 INFO L263 TraceCheckUtils]: 29: Hoare triple {83#false} call #t~ret8 := isnan_double(~res~0); {82#true} is VALID [2020-07-11 00:32:53,388 INFO L280 TraceCheckUtils]: 30: Hoare triple {82#true} ~x := #in~x; {82#true} is VALID [2020-07-11 00:32:53,388 INFO L280 TraceCheckUtils]: 31: Hoare triple {82#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {82#true} is VALID [2020-07-11 00:32:53,389 INFO L280 TraceCheckUtils]: 32: Hoare triple {82#true} assume true; {82#true} is VALID [2020-07-11 00:32:53,389 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {82#true} {83#false} #112#return; {83#false} is VALID [2020-07-11 00:32:53,389 INFO L280 TraceCheckUtils]: 34: Hoare triple {83#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {83#false} is VALID [2020-07-11 00:32:53,390 INFO L280 TraceCheckUtils]: 35: Hoare triple {83#false} assume 0 == #t~ret8; {83#false} is VALID [2020-07-11 00:32:53,390 INFO L280 TraceCheckUtils]: 36: Hoare triple {83#false} havoc #t~ret8; {83#false} is VALID [2020-07-11 00:32:53,390 INFO L280 TraceCheckUtils]: 37: Hoare triple {83#false} assume !false; {83#false} is VALID [2020-07-11 00:32:53,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 00:32:53,396 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2023184127] [2020-07-11 00:32:53,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:32:53,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-11 00:32:53,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089735176] [2020-07-11 00:32:53,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2020-07-11 00:32:53,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:32:53,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 00:32:53,496 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:32:53,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 00:32:53,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:32:53,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 00:32:53,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 00:32:53,509 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2020-07-11 00:32:54,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:32:54,085 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2020-07-11 00:32:54,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 00:32:54,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2020-07-11 00:32:54,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:32:54,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 00:32:54,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2020-07-11 00:32:54,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 00:32:54,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2020-07-11 00:32:54,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 165 transitions. [2020-07-11 00:32:54,303 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:32:54,319 INFO L225 Difference]: With dead ends: 144 [2020-07-11 00:32:54,320 INFO L226 Difference]: Without dead ends: 72 [2020-07-11 00:32:54,324 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-11 00:32:54,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-11 00:32:54,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-07-11 00:32:54,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:32:54,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2020-07-11 00:32:54,440 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2020-07-11 00:32:54,440 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2020-07-11 00:32:54,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:32:54,449 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2020-07-11 00:32:54,449 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2020-07-11 00:32:54,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:32:54,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:32:54,452 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2020-07-11 00:32:54,452 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2020-07-11 00:32:54,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:32:54,459 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2020-07-11 00:32:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2020-07-11 00:32:54,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:32:54,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:32:54,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:32:54,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:32:54,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-11 00:32:54,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2020-07-11 00:32:54,469 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 38 [2020-07-11 00:32:54,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:32:54,470 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2020-07-11 00:32:54,471 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 00:32:54,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states and 79 transitions. [2020-07-11 00:32:54,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:32:54,589 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2020-07-11 00:32:54,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-11 00:32:54,591 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:32:54,591 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:32:54,592 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:32:54,592 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:32:54,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:32:54,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1569895040, now seen corresponding path program 1 times [2020-07-11 00:32:54,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:32:54,593 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [601263907] [2020-07-11 00:32:54,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:32:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:54,743 INFO L280 TraceCheckUtils]: 0: Hoare triple {743#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {701#true} is VALID [2020-07-11 00:32:54,743 INFO L280 TraceCheckUtils]: 1: Hoare triple {701#true} #valid := #valid[0 := 0]; {701#true} is VALID [2020-07-11 00:32:54,744 INFO L280 TraceCheckUtils]: 2: Hoare triple {701#true} assume 0 < #StackHeapBarrier; {701#true} is VALID [2020-07-11 00:32:54,744 INFO L280 TraceCheckUtils]: 3: Hoare triple {701#true} assume true; {701#true} is VALID [2020-07-11 00:32:54,744 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {701#true} {701#true} #114#return; {701#true} is VALID [2020-07-11 00:32:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:54,850 INFO L280 TraceCheckUtils]: 0: Hoare triple {744#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {701#true} is VALID [2020-07-11 00:32:54,851 INFO L280 TraceCheckUtils]: 1: Hoare triple {701#true} havoc ~msw~0; {701#true} is VALID [2020-07-11 00:32:54,851 INFO L280 TraceCheckUtils]: 2: Hoare triple {701#true} havoc ~lsw~0; {701#true} is VALID [2020-07-11 00:32:54,852 INFO L280 TraceCheckUtils]: 3: Hoare triple {701#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L20-2 {701#true} is VALID [2020-07-11 00:32:54,852 INFO L280 TraceCheckUtils]: 4: Hoare triple {701#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21 {701#true} is VALID [2020-07-11 00:32:54,852 INFO L280 TraceCheckUtils]: 5: Hoare triple {701#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L22 {701#true} is VALID [2020-07-11 00:32:54,853 INFO L280 TraceCheckUtils]: 6: Hoare triple {701#true} ~msw~0 := #t~mem0; {701#true} is VALID [2020-07-11 00:32:54,853 INFO L280 TraceCheckUtils]: 7: Hoare triple {701#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L23-1 {701#true} is VALID [2020-07-11 00:32:54,853 INFO L280 TraceCheckUtils]: 8: Hoare triple {701#true} havoc #t~mem0; {701#true} is VALID [2020-07-11 00:32:54,854 INFO L280 TraceCheckUtils]: 9: Hoare triple {701#true} havoc #t~union1; {701#true} is VALID [2020-07-11 00:32:54,854 INFO L280 TraceCheckUtils]: 10: Hoare triple {701#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L24 {701#true} is VALID [2020-07-11 00:32:54,854 INFO L280 TraceCheckUtils]: 11: Hoare triple {701#true} ~lsw~0 := #t~mem2; {701#true} is VALID [2020-07-11 00:32:54,855 INFO L280 TraceCheckUtils]: 12: Hoare triple {701#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L24-2 {701#true} is VALID [2020-07-11 00:32:54,855 INFO L280 TraceCheckUtils]: 13: Hoare triple {701#true} havoc #t~union3; {701#true} is VALID [2020-07-11 00:32:54,855 INFO L280 TraceCheckUtils]: 14: Hoare triple {701#true} havoc #t~mem2; {701#true} is VALID [2020-07-11 00:32:54,856 INFO L280 TraceCheckUtils]: 15: Hoare triple {701#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L21-1 {701#true} is VALID [2020-07-11 00:32:54,856 INFO L280 TraceCheckUtils]: 16: Hoare triple {701#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {701#true} is VALID [2020-07-11 00:32:54,856 INFO L280 TraceCheckUtils]: 17: Hoare triple {701#true} goto; {701#true} is VALID [2020-07-11 00:32:54,857 INFO L280 TraceCheckUtils]: 18: Hoare triple {701#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {701#true} is VALID [2020-07-11 00:32:54,857 INFO L280 TraceCheckUtils]: 19: Hoare triple {701#true} #res := 2; {768#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-11 00:32:54,858 INFO L280 TraceCheckUtils]: 20: Hoare triple {768#(<= 2 |__fpclassify_double_#res|)} assume true; {768#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-11 00:32:54,859 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {768#(<= 2 |__fpclassify_double_#res|)} {701#true} #118#return; {767#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-11 00:32:54,861 INFO L280 TraceCheckUtils]: 0: Hoare triple {744#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {701#true} is VALID [2020-07-11 00:32:54,861 INFO L280 TraceCheckUtils]: 1: Hoare triple {701#true} ~y := #in~y; {701#true} is VALID [2020-07-11 00:32:54,862 INFO L263 TraceCheckUtils]: 2: Hoare triple {701#true} call #t~ret4 := __fpclassify_double(~x); {744#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:32:54,863 INFO L280 TraceCheckUtils]: 3: Hoare triple {744#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {701#true} is VALID [2020-07-11 00:32:54,863 INFO L280 TraceCheckUtils]: 4: Hoare triple {701#true} havoc ~msw~0; {701#true} is VALID [2020-07-11 00:32:54,863 INFO L280 TraceCheckUtils]: 5: Hoare triple {701#true} havoc ~lsw~0; {701#true} is VALID [2020-07-11 00:32:54,864 INFO L280 TraceCheckUtils]: 6: Hoare triple {701#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L20-2 {701#true} is VALID [2020-07-11 00:32:54,864 INFO L280 TraceCheckUtils]: 7: Hoare triple {701#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21 {701#true} is VALID [2020-07-11 00:32:54,864 INFO L280 TraceCheckUtils]: 8: Hoare triple {701#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L22 {701#true} is VALID [2020-07-11 00:32:54,864 INFO L280 TraceCheckUtils]: 9: Hoare triple {701#true} ~msw~0 := #t~mem0; {701#true} is VALID [2020-07-11 00:32:54,865 INFO L280 TraceCheckUtils]: 10: Hoare triple {701#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L23-1 {701#true} is VALID [2020-07-11 00:32:54,865 INFO L280 TraceCheckUtils]: 11: Hoare triple {701#true} havoc #t~mem0; {701#true} is VALID [2020-07-11 00:32:54,865 INFO L280 TraceCheckUtils]: 12: Hoare triple {701#true} havoc #t~union1; {701#true} is VALID [2020-07-11 00:32:54,866 INFO L280 TraceCheckUtils]: 13: Hoare triple {701#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L24 {701#true} is VALID [2020-07-11 00:32:54,866 INFO L280 TraceCheckUtils]: 14: Hoare triple {701#true} ~lsw~0 := #t~mem2; {701#true} is VALID [2020-07-11 00:32:54,866 INFO L280 TraceCheckUtils]: 15: Hoare triple {701#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L24-2 {701#true} is VALID [2020-07-11 00:32:54,867 INFO L280 TraceCheckUtils]: 16: Hoare triple {701#true} havoc #t~union3; {701#true} is VALID [2020-07-11 00:32:54,867 INFO L280 TraceCheckUtils]: 17: Hoare triple {701#true} havoc #t~mem2; {701#true} is VALID [2020-07-11 00:32:54,867 INFO L280 TraceCheckUtils]: 18: Hoare triple {701#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L21-1 {701#true} is VALID [2020-07-11 00:32:54,867 INFO L280 TraceCheckUtils]: 19: Hoare triple {701#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {701#true} is VALID [2020-07-11 00:32:54,868 INFO L280 TraceCheckUtils]: 20: Hoare triple {701#true} goto; {701#true} is VALID [2020-07-11 00:32:54,868 INFO L280 TraceCheckUtils]: 21: Hoare triple {701#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {701#true} is VALID [2020-07-11 00:32:54,869 INFO L280 TraceCheckUtils]: 22: Hoare triple {701#true} #res := 2; {768#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-11 00:32:54,870 INFO L280 TraceCheckUtils]: 23: Hoare triple {768#(<= 2 |__fpclassify_double_#res|)} assume true; {768#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-11 00:32:54,871 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {768#(<= 2 |__fpclassify_double_#res|)} {701#true} #118#return; {767#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-11 00:32:54,872 INFO L280 TraceCheckUtils]: 25: Hoare triple {767#(<= 2 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {767#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-11 00:32:54,872 INFO L280 TraceCheckUtils]: 26: Hoare triple {767#(<= 2 |fmin_double_#t~ret4|)} assume 0 == #t~ret4; {702#false} is VALID [2020-07-11 00:32:54,873 INFO L280 TraceCheckUtils]: 27: Hoare triple {702#false} havoc #t~ret4; {702#false} is VALID [2020-07-11 00:32:54,873 INFO L280 TraceCheckUtils]: 28: Hoare triple {702#false} #res := ~y; {702#false} is VALID [2020-07-11 00:32:54,873 INFO L280 TraceCheckUtils]: 29: Hoare triple {702#false} assume true; {702#false} is VALID [2020-07-11 00:32:54,874 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {702#false} {701#true} #110#return; {702#false} is VALID [2020-07-11 00:32:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:54,880 INFO L280 TraceCheckUtils]: 0: Hoare triple {701#true} ~x := #in~x; {701#true} is VALID [2020-07-11 00:32:54,881 INFO L280 TraceCheckUtils]: 1: Hoare triple {701#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {701#true} is VALID [2020-07-11 00:32:54,881 INFO L280 TraceCheckUtils]: 2: Hoare triple {701#true} assume true; {701#true} is VALID [2020-07-11 00:32:54,881 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {701#true} {702#false} #112#return; {702#false} is VALID [2020-07-11 00:32:54,882 INFO L263 TraceCheckUtils]: 0: Hoare triple {701#true} call ULTIMATE.init(); {743#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 00:32:54,883 INFO L280 TraceCheckUtils]: 1: Hoare triple {743#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {701#true} is VALID [2020-07-11 00:32:54,883 INFO L280 TraceCheckUtils]: 2: Hoare triple {701#true} #valid := #valid[0 := 0]; {701#true} is VALID [2020-07-11 00:32:54,883 INFO L280 TraceCheckUtils]: 3: Hoare triple {701#true} assume 0 < #StackHeapBarrier; {701#true} is VALID [2020-07-11 00:32:54,883 INFO L280 TraceCheckUtils]: 4: Hoare triple {701#true} assume true; {701#true} is VALID [2020-07-11 00:32:54,884 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {701#true} {701#true} #114#return; {701#true} is VALID [2020-07-11 00:32:54,884 INFO L263 TraceCheckUtils]: 6: Hoare triple {701#true} call #t~ret9 := main(); {701#true} is VALID [2020-07-11 00:32:54,884 INFO L280 TraceCheckUtils]: 7: Hoare triple {701#true} ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {701#true} is VALID [2020-07-11 00:32:54,885 INFO L280 TraceCheckUtils]: 8: Hoare triple {701#true} ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {701#true} is VALID [2020-07-11 00:32:54,886 INFO L263 TraceCheckUtils]: 9: Hoare triple {701#true} call #t~ret7 := fmin_double(~x~0, ~y~0); {744#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:32:54,887 INFO L280 TraceCheckUtils]: 10: Hoare triple {744#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {701#true} is VALID [2020-07-11 00:32:54,887 INFO L280 TraceCheckUtils]: 11: Hoare triple {701#true} ~y := #in~y; {701#true} is VALID [2020-07-11 00:32:54,888 INFO L263 TraceCheckUtils]: 12: Hoare triple {701#true} call #t~ret4 := __fpclassify_double(~x); {744#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:32:54,888 INFO L280 TraceCheckUtils]: 13: Hoare triple {744#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {701#true} is VALID [2020-07-11 00:32:54,889 INFO L280 TraceCheckUtils]: 14: Hoare triple {701#true} havoc ~msw~0; {701#true} is VALID [2020-07-11 00:32:54,889 INFO L280 TraceCheckUtils]: 15: Hoare triple {701#true} havoc ~lsw~0; {701#true} is VALID [2020-07-11 00:32:54,889 INFO L280 TraceCheckUtils]: 16: Hoare triple {701#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L20-2 {701#true} is VALID [2020-07-11 00:32:54,889 INFO L280 TraceCheckUtils]: 17: Hoare triple {701#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21 {701#true} is VALID [2020-07-11 00:32:54,890 INFO L280 TraceCheckUtils]: 18: Hoare triple {701#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L22 {701#true} is VALID [2020-07-11 00:32:54,890 INFO L280 TraceCheckUtils]: 19: Hoare triple {701#true} ~msw~0 := #t~mem0; {701#true} is VALID [2020-07-11 00:32:54,890 INFO L280 TraceCheckUtils]: 20: Hoare triple {701#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L23-1 {701#true} is VALID [2020-07-11 00:32:54,891 INFO L280 TraceCheckUtils]: 21: Hoare triple {701#true} havoc #t~mem0; {701#true} is VALID [2020-07-11 00:32:54,891 INFO L280 TraceCheckUtils]: 22: Hoare triple {701#true} havoc #t~union1; {701#true} is VALID [2020-07-11 00:32:54,891 INFO L280 TraceCheckUtils]: 23: Hoare triple {701#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L24 {701#true} is VALID [2020-07-11 00:32:54,891 INFO L280 TraceCheckUtils]: 24: Hoare triple {701#true} ~lsw~0 := #t~mem2; {701#true} is VALID [2020-07-11 00:32:54,892 INFO L280 TraceCheckUtils]: 25: Hoare triple {701#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L24-2 {701#true} is VALID [2020-07-11 00:32:54,892 INFO L280 TraceCheckUtils]: 26: Hoare triple {701#true} havoc #t~union3; {701#true} is VALID [2020-07-11 00:32:54,892 INFO L280 TraceCheckUtils]: 27: Hoare triple {701#true} havoc #t~mem2; {701#true} is VALID [2020-07-11 00:32:54,893 INFO L280 TraceCheckUtils]: 28: Hoare triple {701#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L21-1 {701#true} is VALID [2020-07-11 00:32:54,893 INFO L280 TraceCheckUtils]: 29: Hoare triple {701#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {701#true} is VALID [2020-07-11 00:32:54,893 INFO L280 TraceCheckUtils]: 30: Hoare triple {701#true} goto; {701#true} is VALID [2020-07-11 00:32:54,893 INFO L280 TraceCheckUtils]: 31: Hoare triple {701#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {701#true} is VALID [2020-07-11 00:32:54,894 INFO L280 TraceCheckUtils]: 32: Hoare triple {701#true} #res := 2; {768#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-11 00:32:54,895 INFO L280 TraceCheckUtils]: 33: Hoare triple {768#(<= 2 |__fpclassify_double_#res|)} assume true; {768#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-11 00:32:54,896 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {768#(<= 2 |__fpclassify_double_#res|)} {701#true} #118#return; {767#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-11 00:32:54,897 INFO L280 TraceCheckUtils]: 35: Hoare triple {767#(<= 2 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {767#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-11 00:32:54,897 INFO L280 TraceCheckUtils]: 36: Hoare triple {767#(<= 2 |fmin_double_#t~ret4|)} assume 0 == #t~ret4; {702#false} is VALID [2020-07-11 00:32:54,898 INFO L280 TraceCheckUtils]: 37: Hoare triple {702#false} havoc #t~ret4; {702#false} is VALID [2020-07-11 00:32:54,898 INFO L280 TraceCheckUtils]: 38: Hoare triple {702#false} #res := ~y; {702#false} is VALID [2020-07-11 00:32:54,898 INFO L280 TraceCheckUtils]: 39: Hoare triple {702#false} assume true; {702#false} is VALID [2020-07-11 00:32:54,899 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {702#false} {701#true} #110#return; {702#false} is VALID [2020-07-11 00:32:54,899 INFO L280 TraceCheckUtils]: 41: Hoare triple {702#false} ~res~0 := #t~ret7; {702#false} is VALID [2020-07-11 00:32:54,899 INFO L280 TraceCheckUtils]: 42: Hoare triple {702#false} havoc #t~ret7; {702#false} is VALID [2020-07-11 00:32:54,899 INFO L263 TraceCheckUtils]: 43: Hoare triple {702#false} call #t~ret8 := isnan_double(~res~0); {701#true} is VALID [2020-07-11 00:32:54,900 INFO L280 TraceCheckUtils]: 44: Hoare triple {701#true} ~x := #in~x; {701#true} is VALID [2020-07-11 00:32:54,900 INFO L280 TraceCheckUtils]: 45: Hoare triple {701#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {701#true} is VALID [2020-07-11 00:32:54,900 INFO L280 TraceCheckUtils]: 46: Hoare triple {701#true} assume true; {701#true} is VALID [2020-07-11 00:32:54,901 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {701#true} {702#false} #112#return; {702#false} is VALID [2020-07-11 00:32:54,901 INFO L280 TraceCheckUtils]: 48: Hoare triple {702#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {702#false} is VALID [2020-07-11 00:32:54,901 INFO L280 TraceCheckUtils]: 49: Hoare triple {702#false} assume 0 == #t~ret8; {702#false} is VALID [2020-07-11 00:32:54,901 INFO L280 TraceCheckUtils]: 50: Hoare triple {702#false} havoc #t~ret8; {702#false} is VALID [2020-07-11 00:32:54,902 INFO L280 TraceCheckUtils]: 51: Hoare triple {702#false} assume !false; {702#false} is VALID [2020-07-11 00:32:54,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 00:32:54,906 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [601263907] [2020-07-11 00:32:54,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:32:54,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 00:32:54,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384570497] [2020-07-11 00:32:54,909 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2020-07-11 00:32:54,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:32:54,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 00:32:54,964 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:32:54,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 00:32:54,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:32:54,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 00:32:54,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:32:54,965 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 6 states. [2020-07-11 00:32:55,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:32:55,561 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2020-07-11 00:32:55,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:32:55,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2020-07-11 00:32:55,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:32:55,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:32:55,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2020-07-11 00:32:55,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:32:55,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2020-07-11 00:32:55,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 101 transitions. [2020-07-11 00:32:55,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:32:55,688 INFO L225 Difference]: With dead ends: 93 [2020-07-11 00:32:55,688 INFO L226 Difference]: Without dead ends: 77 [2020-07-11 00:32:55,690 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-11 00:32:55,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-07-11 00:32:55,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2020-07-11 00:32:55,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:32:55,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 76 states. [2020-07-11 00:32:55,755 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 76 states. [2020-07-11 00:32:55,755 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 76 states. [2020-07-11 00:32:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:32:55,766 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2020-07-11 00:32:55,766 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2020-07-11 00:32:55,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:32:55,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:32:55,768 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 77 states. [2020-07-11 00:32:55,768 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 77 states. [2020-07-11 00:32:55,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:32:55,780 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2020-07-11 00:32:55,780 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2020-07-11 00:32:55,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:32:55,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:32:55,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:32:55,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:32:55,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-11 00:32:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2020-07-11 00:32:55,791 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 52 [2020-07-11 00:32:55,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:32:55,791 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2020-07-11 00:32:55,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 00:32:55,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 84 transitions. [2020-07-11 00:32:55,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:32:55,887 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2020-07-11 00:32:55,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-11 00:32:55,889 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:32:55,889 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:32:55,890 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:32:55,890 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:32:55,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:32:55,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1915658490, now seen corresponding path program 1 times [2020-07-11 00:32:55,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:32:55,891 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1810063675] [2020-07-11 00:32:55,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:32:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:55,993 INFO L280 TraceCheckUtils]: 0: Hoare triple {1311#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1266#true} is VALID [2020-07-11 00:32:55,993 INFO L280 TraceCheckUtils]: 1: Hoare triple {1266#true} #valid := #valid[0 := 0]; {1266#true} is VALID [2020-07-11 00:32:55,994 INFO L280 TraceCheckUtils]: 2: Hoare triple {1266#true} assume 0 < #StackHeapBarrier; {1266#true} is VALID [2020-07-11 00:32:55,994 INFO L280 TraceCheckUtils]: 3: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-11 00:32:55,994 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1266#true} {1266#true} #114#return; {1266#true} is VALID [2020-07-11 00:32:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:56,105 INFO L280 TraceCheckUtils]: 0: Hoare triple {1312#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1266#true} is VALID [2020-07-11 00:32:56,106 INFO L280 TraceCheckUtils]: 1: Hoare triple {1266#true} havoc ~msw~0; {1266#true} is VALID [2020-07-11 00:32:56,106 INFO L280 TraceCheckUtils]: 2: Hoare triple {1266#true} havoc ~lsw~0; {1266#true} is VALID [2020-07-11 00:32:56,106 INFO L280 TraceCheckUtils]: 3: Hoare triple {1266#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L20-2 {1266#true} is VALID [2020-07-11 00:32:56,106 INFO L280 TraceCheckUtils]: 4: Hoare triple {1266#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21 {1266#true} is VALID [2020-07-11 00:32:56,107 INFO L280 TraceCheckUtils]: 5: Hoare triple {1266#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L22 {1266#true} is VALID [2020-07-11 00:32:56,107 INFO L280 TraceCheckUtils]: 6: Hoare triple {1266#true} ~msw~0 := #t~mem0; {1266#true} is VALID [2020-07-11 00:32:56,107 INFO L280 TraceCheckUtils]: 7: Hoare triple {1266#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L23-1 {1266#true} is VALID [2020-07-11 00:32:56,107 INFO L280 TraceCheckUtils]: 8: Hoare triple {1266#true} havoc #t~mem0; {1266#true} is VALID [2020-07-11 00:32:56,108 INFO L280 TraceCheckUtils]: 9: Hoare triple {1266#true} havoc #t~union1; {1266#true} is VALID [2020-07-11 00:32:56,108 INFO L280 TraceCheckUtils]: 10: Hoare triple {1266#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L24 {1266#true} is VALID [2020-07-11 00:32:56,108 INFO L280 TraceCheckUtils]: 11: Hoare triple {1266#true} ~lsw~0 := #t~mem2; {1266#true} is VALID [2020-07-11 00:32:56,108 INFO L280 TraceCheckUtils]: 12: Hoare triple {1266#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L24-2 {1266#true} is VALID [2020-07-11 00:32:56,109 INFO L280 TraceCheckUtils]: 13: Hoare triple {1266#true} havoc #t~union3; {1266#true} is VALID [2020-07-11 00:32:56,109 INFO L280 TraceCheckUtils]: 14: Hoare triple {1266#true} havoc #t~mem2; {1266#true} is VALID [2020-07-11 00:32:56,109 INFO L280 TraceCheckUtils]: 15: Hoare triple {1266#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L21-1 {1266#true} is VALID [2020-07-11 00:32:56,109 INFO L280 TraceCheckUtils]: 16: Hoare triple {1266#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1266#true} is VALID [2020-07-11 00:32:56,110 INFO L280 TraceCheckUtils]: 17: Hoare triple {1266#true} goto; {1266#true} is VALID [2020-07-11 00:32:56,110 INFO L280 TraceCheckUtils]: 18: Hoare triple {1266#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {1266#true} is VALID [2020-07-11 00:32:56,110 INFO L280 TraceCheckUtils]: 19: Hoare triple {1266#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {1266#true} is VALID [2020-07-11 00:32:56,111 INFO L280 TraceCheckUtils]: 20: Hoare triple {1266#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {1266#true} is VALID [2020-07-11 00:32:56,111 INFO L280 TraceCheckUtils]: 21: Hoare triple {1266#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {1266#true} is VALID [2020-07-11 00:32:56,112 INFO L280 TraceCheckUtils]: 22: Hoare triple {1266#true} #res := 1; {1339#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-11 00:32:56,112 INFO L280 TraceCheckUtils]: 23: Hoare triple {1339#(= 1 |__fpclassify_double_#res|)} assume true; {1339#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-11 00:32:56,113 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1339#(= 1 |__fpclassify_double_#res|)} {1266#true} #118#return; {1338#(= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-11 00:32:56,114 INFO L280 TraceCheckUtils]: 0: Hoare triple {1312#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1266#true} is VALID [2020-07-11 00:32:56,115 INFO L280 TraceCheckUtils]: 1: Hoare triple {1266#true} ~y := #in~y; {1266#true} is VALID [2020-07-11 00:32:56,116 INFO L263 TraceCheckUtils]: 2: Hoare triple {1266#true} call #t~ret4 := __fpclassify_double(~x); {1312#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:32:56,116 INFO L280 TraceCheckUtils]: 3: Hoare triple {1312#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1266#true} is VALID [2020-07-11 00:32:56,116 INFO L280 TraceCheckUtils]: 4: Hoare triple {1266#true} havoc ~msw~0; {1266#true} is VALID [2020-07-11 00:32:56,117 INFO L280 TraceCheckUtils]: 5: Hoare triple {1266#true} havoc ~lsw~0; {1266#true} is VALID [2020-07-11 00:32:56,117 INFO L280 TraceCheckUtils]: 6: Hoare triple {1266#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L20-2 {1266#true} is VALID [2020-07-11 00:32:56,117 INFO L280 TraceCheckUtils]: 7: Hoare triple {1266#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21 {1266#true} is VALID [2020-07-11 00:32:56,117 INFO L280 TraceCheckUtils]: 8: Hoare triple {1266#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L22 {1266#true} is VALID [2020-07-11 00:32:56,118 INFO L280 TraceCheckUtils]: 9: Hoare triple {1266#true} ~msw~0 := #t~mem0; {1266#true} is VALID [2020-07-11 00:32:56,118 INFO L280 TraceCheckUtils]: 10: Hoare triple {1266#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L23-1 {1266#true} is VALID [2020-07-11 00:32:56,118 INFO L280 TraceCheckUtils]: 11: Hoare triple {1266#true} havoc #t~mem0; {1266#true} is VALID [2020-07-11 00:32:56,118 INFO L280 TraceCheckUtils]: 12: Hoare triple {1266#true} havoc #t~union1; {1266#true} is VALID [2020-07-11 00:32:56,119 INFO L280 TraceCheckUtils]: 13: Hoare triple {1266#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L24 {1266#true} is VALID [2020-07-11 00:32:56,119 INFO L280 TraceCheckUtils]: 14: Hoare triple {1266#true} ~lsw~0 := #t~mem2; {1266#true} is VALID [2020-07-11 00:32:56,119 INFO L280 TraceCheckUtils]: 15: Hoare triple {1266#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L24-2 {1266#true} is VALID [2020-07-11 00:32:56,119 INFO L280 TraceCheckUtils]: 16: Hoare triple {1266#true} havoc #t~union3; {1266#true} is VALID [2020-07-11 00:32:56,120 INFO L280 TraceCheckUtils]: 17: Hoare triple {1266#true} havoc #t~mem2; {1266#true} is VALID [2020-07-11 00:32:56,120 INFO L280 TraceCheckUtils]: 18: Hoare triple {1266#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L21-1 {1266#true} is VALID [2020-07-11 00:32:56,120 INFO L280 TraceCheckUtils]: 19: Hoare triple {1266#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1266#true} is VALID [2020-07-11 00:32:56,120 INFO L280 TraceCheckUtils]: 20: Hoare triple {1266#true} goto; {1266#true} is VALID [2020-07-11 00:32:56,121 INFO L280 TraceCheckUtils]: 21: Hoare triple {1266#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {1266#true} is VALID [2020-07-11 00:32:56,121 INFO L280 TraceCheckUtils]: 22: Hoare triple {1266#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {1266#true} is VALID [2020-07-11 00:32:56,121 INFO L280 TraceCheckUtils]: 23: Hoare triple {1266#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {1266#true} is VALID [2020-07-11 00:32:56,121 INFO L280 TraceCheckUtils]: 24: Hoare triple {1266#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {1266#true} is VALID [2020-07-11 00:32:56,122 INFO L280 TraceCheckUtils]: 25: Hoare triple {1266#true} #res := 1; {1339#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-11 00:32:56,123 INFO L280 TraceCheckUtils]: 26: Hoare triple {1339#(= 1 |__fpclassify_double_#res|)} assume true; {1339#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-11 00:32:56,124 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1339#(= 1 |__fpclassify_double_#res|)} {1266#true} #118#return; {1338#(= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-11 00:32:56,124 INFO L280 TraceCheckUtils]: 28: Hoare triple {1338#(= 1 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1338#(= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-11 00:32:56,125 INFO L280 TraceCheckUtils]: 29: Hoare triple {1338#(= 1 |fmin_double_#t~ret4|)} assume 0 == #t~ret4; {1267#false} is VALID [2020-07-11 00:32:56,125 INFO L280 TraceCheckUtils]: 30: Hoare triple {1267#false} havoc #t~ret4; {1267#false} is VALID [2020-07-11 00:32:56,126 INFO L280 TraceCheckUtils]: 31: Hoare triple {1267#false} #res := ~y; {1267#false} is VALID [2020-07-11 00:32:56,126 INFO L280 TraceCheckUtils]: 32: Hoare triple {1267#false} assume true; {1267#false} is VALID [2020-07-11 00:32:56,126 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1267#false} {1266#true} #110#return; {1267#false} is VALID [2020-07-11 00:32:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:56,132 INFO L280 TraceCheckUtils]: 0: Hoare triple {1266#true} ~x := #in~x; {1266#true} is VALID [2020-07-11 00:32:56,132 INFO L280 TraceCheckUtils]: 1: Hoare triple {1266#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {1266#true} is VALID [2020-07-11 00:32:56,133 INFO L280 TraceCheckUtils]: 2: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-11 00:32:56,133 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1266#true} {1267#false} #112#return; {1267#false} is VALID [2020-07-11 00:32:56,134 INFO L263 TraceCheckUtils]: 0: Hoare triple {1266#true} call ULTIMATE.init(); {1311#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 00:32:56,134 INFO L280 TraceCheckUtils]: 1: Hoare triple {1311#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1266#true} is VALID [2020-07-11 00:32:56,134 INFO L280 TraceCheckUtils]: 2: Hoare triple {1266#true} #valid := #valid[0 := 0]; {1266#true} is VALID [2020-07-11 00:32:56,135 INFO L280 TraceCheckUtils]: 3: Hoare triple {1266#true} assume 0 < #StackHeapBarrier; {1266#true} is VALID [2020-07-11 00:32:56,135 INFO L280 TraceCheckUtils]: 4: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-11 00:32:56,135 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1266#true} {1266#true} #114#return; {1266#true} is VALID [2020-07-11 00:32:56,135 INFO L263 TraceCheckUtils]: 6: Hoare triple {1266#true} call #t~ret9 := main(); {1266#true} is VALID [2020-07-11 00:32:56,136 INFO L280 TraceCheckUtils]: 7: Hoare triple {1266#true} ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {1266#true} is VALID [2020-07-11 00:32:56,136 INFO L280 TraceCheckUtils]: 8: Hoare triple {1266#true} ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {1266#true} is VALID [2020-07-11 00:32:56,137 INFO L263 TraceCheckUtils]: 9: Hoare triple {1266#true} call #t~ret7 := fmin_double(~x~0, ~y~0); {1312#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:32:56,137 INFO L280 TraceCheckUtils]: 10: Hoare triple {1312#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1266#true} is VALID [2020-07-11 00:32:56,138 INFO L280 TraceCheckUtils]: 11: Hoare triple {1266#true} ~y := #in~y; {1266#true} is VALID [2020-07-11 00:32:56,139 INFO L263 TraceCheckUtils]: 12: Hoare triple {1266#true} call #t~ret4 := __fpclassify_double(~x); {1312#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:32:56,139 INFO L280 TraceCheckUtils]: 13: Hoare triple {1312#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1266#true} is VALID [2020-07-11 00:32:56,139 INFO L280 TraceCheckUtils]: 14: Hoare triple {1266#true} havoc ~msw~0; {1266#true} is VALID [2020-07-11 00:32:56,139 INFO L280 TraceCheckUtils]: 15: Hoare triple {1266#true} havoc ~lsw~0; {1266#true} is VALID [2020-07-11 00:32:56,140 INFO L280 TraceCheckUtils]: 16: Hoare triple {1266#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L20-2 {1266#true} is VALID [2020-07-11 00:32:56,140 INFO L280 TraceCheckUtils]: 17: Hoare triple {1266#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21 {1266#true} is VALID [2020-07-11 00:32:56,140 INFO L280 TraceCheckUtils]: 18: Hoare triple {1266#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L22 {1266#true} is VALID [2020-07-11 00:32:56,140 INFO L280 TraceCheckUtils]: 19: Hoare triple {1266#true} ~msw~0 := #t~mem0; {1266#true} is VALID [2020-07-11 00:32:56,141 INFO L280 TraceCheckUtils]: 20: Hoare triple {1266#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L23-1 {1266#true} is VALID [2020-07-11 00:32:56,141 INFO L280 TraceCheckUtils]: 21: Hoare triple {1266#true} havoc #t~mem0; {1266#true} is VALID [2020-07-11 00:32:56,141 INFO L280 TraceCheckUtils]: 22: Hoare triple {1266#true} havoc #t~union1; {1266#true} is VALID [2020-07-11 00:32:56,141 INFO L280 TraceCheckUtils]: 23: Hoare triple {1266#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L24 {1266#true} is VALID [2020-07-11 00:32:56,141 INFO L280 TraceCheckUtils]: 24: Hoare triple {1266#true} ~lsw~0 := #t~mem2; {1266#true} is VALID [2020-07-11 00:32:56,142 INFO L280 TraceCheckUtils]: 25: Hoare triple {1266#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L24-2 {1266#true} is VALID [2020-07-11 00:32:56,142 INFO L280 TraceCheckUtils]: 26: Hoare triple {1266#true} havoc #t~union3; {1266#true} is VALID [2020-07-11 00:32:56,142 INFO L280 TraceCheckUtils]: 27: Hoare triple {1266#true} havoc #t~mem2; {1266#true} is VALID [2020-07-11 00:32:56,142 INFO L280 TraceCheckUtils]: 28: Hoare triple {1266#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L21-1 {1266#true} is VALID [2020-07-11 00:32:56,143 INFO L280 TraceCheckUtils]: 29: Hoare triple {1266#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1266#true} is VALID [2020-07-11 00:32:56,143 INFO L280 TraceCheckUtils]: 30: Hoare triple {1266#true} goto; {1266#true} is VALID [2020-07-11 00:32:56,143 INFO L280 TraceCheckUtils]: 31: Hoare triple {1266#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {1266#true} is VALID [2020-07-11 00:32:56,143 INFO L280 TraceCheckUtils]: 32: Hoare triple {1266#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {1266#true} is VALID [2020-07-11 00:32:56,144 INFO L280 TraceCheckUtils]: 33: Hoare triple {1266#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {1266#true} is VALID [2020-07-11 00:32:56,144 INFO L280 TraceCheckUtils]: 34: Hoare triple {1266#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {1266#true} is VALID [2020-07-11 00:32:56,145 INFO L280 TraceCheckUtils]: 35: Hoare triple {1266#true} #res := 1; {1339#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-11 00:32:56,145 INFO L280 TraceCheckUtils]: 36: Hoare triple {1339#(= 1 |__fpclassify_double_#res|)} assume true; {1339#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-11 00:32:56,146 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1339#(= 1 |__fpclassify_double_#res|)} {1266#true} #118#return; {1338#(= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-11 00:32:56,147 INFO L280 TraceCheckUtils]: 38: Hoare triple {1338#(= 1 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1338#(= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-11 00:32:56,148 INFO L280 TraceCheckUtils]: 39: Hoare triple {1338#(= 1 |fmin_double_#t~ret4|)} assume 0 == #t~ret4; {1267#false} is VALID [2020-07-11 00:32:56,148 INFO L280 TraceCheckUtils]: 40: Hoare triple {1267#false} havoc #t~ret4; {1267#false} is VALID [2020-07-11 00:32:56,148 INFO L280 TraceCheckUtils]: 41: Hoare triple {1267#false} #res := ~y; {1267#false} is VALID [2020-07-11 00:32:56,148 INFO L280 TraceCheckUtils]: 42: Hoare triple {1267#false} assume true; {1267#false} is VALID [2020-07-11 00:32:56,149 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {1267#false} {1266#true} #110#return; {1267#false} is VALID [2020-07-11 00:32:56,149 INFO L280 TraceCheckUtils]: 44: Hoare triple {1267#false} ~res~0 := #t~ret7; {1267#false} is VALID [2020-07-11 00:32:56,149 INFO L280 TraceCheckUtils]: 45: Hoare triple {1267#false} havoc #t~ret7; {1267#false} is VALID [2020-07-11 00:32:56,149 INFO L263 TraceCheckUtils]: 46: Hoare triple {1267#false} call #t~ret8 := isnan_double(~res~0); {1266#true} is VALID [2020-07-11 00:32:56,150 INFO L280 TraceCheckUtils]: 47: Hoare triple {1266#true} ~x := #in~x; {1266#true} is VALID [2020-07-11 00:32:56,150 INFO L280 TraceCheckUtils]: 48: Hoare triple {1266#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {1266#true} is VALID [2020-07-11 00:32:56,150 INFO L280 TraceCheckUtils]: 49: Hoare triple {1266#true} assume true; {1266#true} is VALID [2020-07-11 00:32:56,150 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {1266#true} {1267#false} #112#return; {1267#false} is VALID [2020-07-11 00:32:56,151 INFO L280 TraceCheckUtils]: 51: Hoare triple {1267#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1267#false} is VALID [2020-07-11 00:32:56,151 INFO L280 TraceCheckUtils]: 52: Hoare triple {1267#false} assume 0 == #t~ret8; {1267#false} is VALID [2020-07-11 00:32:56,151 INFO L280 TraceCheckUtils]: 53: Hoare triple {1267#false} havoc #t~ret8; {1267#false} is VALID [2020-07-11 00:32:56,151 INFO L280 TraceCheckUtils]: 54: Hoare triple {1267#false} assume !false; {1267#false} is VALID [2020-07-11 00:32:56,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 00:32:56,155 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1810063675] [2020-07-11 00:32:56,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:32:56,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 00:32:56,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52900337] [2020-07-11 00:32:56,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2020-07-11 00:32:56,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:32:56,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 00:32:56,210 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:32:56,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 00:32:56,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:32:56,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 00:32:56,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:32:56,211 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand 6 states. [2020-07-11 00:32:56,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:32:56,813 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2020-07-11 00:32:56,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:32:56,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2020-07-11 00:32:56,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:32:56,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:32:56,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2020-07-11 00:32:56,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:32:56,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2020-07-11 00:32:56,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 101 transitions. [2020-07-11 00:32:56,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:32:56,938 INFO L225 Difference]: With dead ends: 97 [2020-07-11 00:32:56,939 INFO L226 Difference]: Without dead ends: 81 [2020-07-11 00:32:56,939 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-11 00:32:56,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-11 00:32:56,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2020-07-11 00:32:56,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:32:56,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 76 states. [2020-07-11 00:32:56,999 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 76 states. [2020-07-11 00:32:56,999 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 76 states. [2020-07-11 00:32:57,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:32:57,004 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2020-07-11 00:32:57,004 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2020-07-11 00:32:57,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:32:57,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:32:57,005 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 81 states. [2020-07-11 00:32:57,005 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 81 states. [2020-07-11 00:32:57,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:32:57,010 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2020-07-11 00:32:57,010 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2020-07-11 00:32:57,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:32:57,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:32:57,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:32:57,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:32:57,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-11 00:32:57,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2020-07-11 00:32:57,015 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 55 [2020-07-11 00:32:57,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:32:57,015 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2020-07-11 00:32:57,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 00:32:57,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 84 transitions. [2020-07-11 00:32:57,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:32:57,113 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2020-07-11 00:32:57,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-11 00:32:57,115 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:32:57,115 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:32:57,115 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:32:57,115 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:32:57,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:32:57,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1520711866, now seen corresponding path program 1 times [2020-07-11 00:32:57,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:32:57,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1928465347] [2020-07-11 00:32:57,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:32:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:32:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:32:57,346 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 00:32:57,347 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.map(Model.java:227) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.add(ModelBuilder.java:123) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInFunctions(ModelBuilder.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.(ModelBuilder.java:49) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.fillInModel(CClosure.java:1312) at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.(Model.java:120) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.buildModel(SMTInterpol.java:1139) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1004) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.getValues(SmtUtils.java:2102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.getValue(TraceCheck.java:407) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.lambda$0(TraceCheck.java:381) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:390) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:349) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:317) 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) [2020-07-11 00:32:57,354 INFO L168 Benchmark]: Toolchain (without parser) took 5460.63 ms. Allocated memory was 136.3 MB in the beginning and 288.4 MB in the end (delta: 152.0 MB). Free memory was 101.4 MB in the beginning and 106.8 MB in the end (delta: -5.5 MB). Peak memory consumption was 146.6 MB. Max. memory is 7.1 GB. [2020-07-11 00:32:57,360 INFO L168 Benchmark]: CDTParser took 0.91 ms. Allocated memory is still 136.3 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-11 00:32:57,361 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.36 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 101.0 MB in the beginning and 179.2 MB in the end (delta: -78.2 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2020-07-11 00:32:57,363 INFO L168 Benchmark]: Boogie Preprocessor took 63.37 ms. Allocated memory is still 200.3 MB. Free memory was 179.2 MB in the beginning and 176.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-07-11 00:32:57,364 INFO L168 Benchmark]: RCFGBuilder took 575.71 ms. Allocated memory is still 200.3 MB. Free memory was 176.6 MB in the beginning and 142.4 MB in the end (delta: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 7.1 GB. [2020-07-11 00:32:57,369 INFO L168 Benchmark]: TraceAbstraction took 4430.26 ms. Allocated memory was 200.3 MB in the beginning and 288.4 MB in the end (delta: 88.1 MB). Free memory was 141.7 MB in the beginning and 106.8 MB in the end (delta: 34.9 MB). Peak memory consumption was 123.0 MB. Max. memory is 7.1 GB. [2020-07-11 00:32:57,378 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.91 ms. Allocated memory is still 136.3 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 385.36 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 101.0 MB in the beginning and 179.2 MB in the end (delta: -78.2 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.37 ms. Allocated memory is still 200.3 MB. Free memory was 179.2 MB in the beginning and 176.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 575.71 ms. Allocated memory is still 200.3 MB. Free memory was 176.6 MB in the beginning and 142.4 MB in the end (delta: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4430.26 ms. Allocated memory was 200.3 MB in the beginning and 288.4 MB in the end (delta: 88.1 MB). Free memory was 141.7 MB in the beginning and 106.8 MB in the end (delta: 34.9 MB). Peak memory consumption was 123.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.map(Model.java:227) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...