/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/float_req_bl_1210.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:33:23,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:33:23,030 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:33:23,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:33:23,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:33:23,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:33:23,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:33:23,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:33:23,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:33:23,069 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:33:23,070 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:33:23,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:33:23,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:33:23,072 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:33:23,073 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:33:23,074 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:33:23,075 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:33:23,076 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:33:23,078 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:33:23,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:33:23,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:33:23,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:33:23,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:33:23,084 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:33:23,086 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:33:23,086 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:33:23,086 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:33:23,087 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:33:23,088 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:33:23,089 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:33:23,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:33:23,090 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:33:23,090 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:33:23,091 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:33:23,092 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:33:23,092 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:33:23,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:33:23,093 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:33:23,093 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:33:23,094 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:33:23,095 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:33:23,096 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:33:23,105 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:33:23,105 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:33:23,107 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:33:23,108 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:33:23,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:33:23,108 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:33:23,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:33:23,108 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:33:23,108 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:33:23,109 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:33:23,109 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:33:23,109 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:33:23,109 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:33:23,109 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:33:23,110 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:33:23,110 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:33:23,110 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:33:23,110 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:33:23,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:33:23,111 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:33:23,111 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:33:23,111 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:33:23,111 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:33:23,418 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:33:23,433 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:33:23,438 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:33:23,440 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:33:23,440 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:33:23,441 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1210.c [2020-07-11 00:33:23,509 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/901f91c12/c6871a7aeb2043f2be60c75680d7f912/FLAG417cf0641 [2020-07-11 00:33:23,985 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:33:23,986 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1210.c [2020-07-11 00:33:23,994 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/901f91c12/c6871a7aeb2043f2be60c75680d7f912/FLAG417cf0641 [2020-07-11 00:33:24,331 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/901f91c12/c6871a7aeb2043f2be60c75680d7f912 [2020-07-11 00:33:24,342 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:33:24,344 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:33:24,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:33:24,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:33:24,348 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:33:24,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:33:24" (1/1) ... [2020-07-11 00:33:24,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72b9405f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:24, skipping insertion in model container [2020-07-11 00:33:24,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:33:24" (1/1) ... [2020-07-11 00:33:24,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:33:24,381 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:33:24,593 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:33:24,604 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:33:24,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:33:24,763 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:33:24,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:24 WrapperNode [2020-07-11 00:33:24,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:33:24,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:33:24,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:33:24,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:33:24,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:24" (1/1) ... [2020-07-11 00:33:24,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:24" (1/1) ... [2020-07-11 00:33:24,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:24" (1/1) ... [2020-07-11 00:33:24,791 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:24" (1/1) ... [2020-07-11 00:33:24,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:24" (1/1) ... [2020-07-11 00:33:24,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:24" (1/1) ... [2020-07-11 00:33:24,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:24" (1/1) ... [2020-07-11 00:33:24,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:33:24,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:33:24,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:33:24,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:33:24,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:24" (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:33:24,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:33:24,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:33:24,898 INFO L138 BoogieDeclarations]: Found implementation of procedure modf_float [2020-07-11 00:33:24,899 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2020-07-11 00:33:24,899 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:33:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:33:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure modf_float [2020-07-11 00:33:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-11 00:33:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-11 00:33:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 00:33:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 00:33:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 00:33:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-11 00:33:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2020-07-11 00:33:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:33:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:33:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:33:25,578 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:33:25,578 INFO L295 CfgBuilder]: Removed 14 assume(true) statements. [2020-07-11 00:33:25,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:33:25 BoogieIcfgContainer [2020-07-11 00:33:25,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:33:25,585 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:33:25,585 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:33:25,589 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:33:25,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:33:24" (1/3) ... [2020-07-11 00:33:25,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356eef2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:33:25, skipping insertion in model container [2020-07-11 00:33:25,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:24" (2/3) ... [2020-07-11 00:33:25,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356eef2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:33:25, skipping insertion in model container [2020-07-11 00:33:25,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:33:25" (3/3) ... [2020-07-11 00:33:25,593 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1210.c [2020-07-11 00:33:25,605 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:33:25,613 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:33:25,627 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:33:25,651 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:33:25,651 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:33:25,651 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:33:25,651 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:33:25,652 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:33:25,652 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:33:25,652 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:33:25,652 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:33:25,671 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states. [2020-07-11 00:33:25,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-11 00:33:25,685 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:25,686 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] [2020-07-11 00:33:25,687 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:25,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:25,694 INFO L82 PathProgramCache]: Analyzing trace with hash -3412261, now seen corresponding path program 1 times [2020-07-11 00:33:25,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:25,703 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2066564365] [2020-07-11 00:33:25,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:25,920 INFO L280 TraceCheckUtils]: 0: Hoare triple {162#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~one_modf~0 |old(~one_modf~0)|))} #NULL.base, #NULL.offset := 0, 0; {137#true} is VALID [2020-07-11 00:33:25,921 INFO L280 TraceCheckUtils]: 1: Hoare triple {137#true} #valid := #valid[0 := 0]; {137#true} is VALID [2020-07-11 00:33:25,921 INFO L280 TraceCheckUtils]: 2: Hoare triple {137#true} assume 0 < #StackHeapBarrier; {137#true} is VALID [2020-07-11 00:33:25,922 INFO L280 TraceCheckUtils]: 3: Hoare triple {137#true} ~one_modf~0 := 1.0; {137#true} is VALID [2020-07-11 00:33:25,923 INFO L280 TraceCheckUtils]: 4: Hoare triple {137#true} assume true; {137#true} is VALID [2020-07-11 00:33:25,923 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {137#true} {137#true} #215#return; {137#true} is VALID [2020-07-11 00:33:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:25,957 INFO L280 TraceCheckUtils]: 0: Hoare triple {163#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {137#true} is VALID [2020-07-11 00:33:25,958 INFO L280 TraceCheckUtils]: 1: Hoare triple {137#true} ~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset; {137#true} is VALID [2020-07-11 00:33:25,958 INFO L280 TraceCheckUtils]: 2: Hoare triple {137#true} havoc ~i0~0; {137#true} is VALID [2020-07-11 00:33:25,959 INFO L280 TraceCheckUtils]: 3: Hoare triple {137#true} havoc ~j0~0; {137#true} is VALID [2020-07-11 00:33:25,959 INFO L280 TraceCheckUtils]: 4: Hoare triple {137#true} havoc ~i~0; {137#true} is VALID [2020-07-11 00:33:25,961 INFO L280 TraceCheckUtils]: 5: Hoare triple {137#true} assume !true; {138#false} is VALID [2020-07-11 00:33:25,961 INFO L280 TraceCheckUtils]: 6: Hoare triple {138#false} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {138#false} is VALID [2020-07-11 00:33:25,961 INFO L280 TraceCheckUtils]: 7: Hoare triple {138#false} assume ~j0~0 < 23; {138#false} is VALID [2020-07-11 00:33:25,962 INFO L280 TraceCheckUtils]: 8: Hoare triple {138#false} assume ~j0~0 < 0; {138#false} is VALID [2020-07-11 00:33:25,962 INFO L280 TraceCheckUtils]: 9: Hoare triple {138#false} assume !true; {138#false} is VALID [2020-07-11 00:33:25,963 INFO L280 TraceCheckUtils]: 10: Hoare triple {138#false} #res := ~x; {138#false} is VALID [2020-07-11 00:33:25,963 INFO L280 TraceCheckUtils]: 11: Hoare triple {138#false} assume true; {138#false} is VALID [2020-07-11 00:33:25,963 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {138#false} {137#true} #219#return; {138#false} is VALID [2020-07-11 00:33:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:25,975 INFO L280 TraceCheckUtils]: 0: Hoare triple {137#true} ~x := #in~x; {137#true} is VALID [2020-07-11 00:33:25,976 INFO L280 TraceCheckUtils]: 1: Hoare triple {137#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {137#true} is VALID [2020-07-11 00:33:25,976 INFO L280 TraceCheckUtils]: 2: Hoare triple {137#true} assume true; {137#true} is VALID [2020-07-11 00:33:25,976 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {137#true} {138#false} #221#return; {138#false} is VALID [2020-07-11 00:33:25,979 INFO L263 TraceCheckUtils]: 0: Hoare triple {137#true} call ULTIMATE.init(); {162#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~one_modf~0 |old(~one_modf~0)|))} is VALID [2020-07-11 00:33:25,979 INFO L280 TraceCheckUtils]: 1: Hoare triple {162#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~one_modf~0 |old(~one_modf~0)|))} #NULL.base, #NULL.offset := 0, 0; {137#true} is VALID [2020-07-11 00:33:25,980 INFO L280 TraceCheckUtils]: 2: Hoare triple {137#true} #valid := #valid[0 := 0]; {137#true} is VALID [2020-07-11 00:33:25,980 INFO L280 TraceCheckUtils]: 3: Hoare triple {137#true} assume 0 < #StackHeapBarrier; {137#true} is VALID [2020-07-11 00:33:25,981 INFO L280 TraceCheckUtils]: 4: Hoare triple {137#true} ~one_modf~0 := 1.0; {137#true} is VALID [2020-07-11 00:33:25,981 INFO L280 TraceCheckUtils]: 5: Hoare triple {137#true} assume true; {137#true} is VALID [2020-07-11 00:33:25,981 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {137#true} {137#true} #215#return; {137#true} is VALID [2020-07-11 00:33:25,982 INFO L263 TraceCheckUtils]: 7: Hoare triple {137#true} call #t~ret18 := main(); {137#true} is VALID [2020-07-11 00:33:25,982 INFO L280 TraceCheckUtils]: 8: Hoare triple {137#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {137#true} is VALID [2020-07-11 00:33:25,983 INFO L280 TraceCheckUtils]: 9: Hoare triple {137#true} SUMMARY for call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.allocOnStack(4); srcloc: L81 {137#true} is VALID [2020-07-11 00:33:25,985 INFO L263 TraceCheckUtils]: 10: Hoare triple {137#true} call #t~ret13 := modf_float(~x~0, ~#iptr~0.base, ~#iptr~0.offset); {163#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:25,986 INFO L280 TraceCheckUtils]: 11: Hoare triple {163#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {137#true} is VALID [2020-07-11 00:33:25,986 INFO L280 TraceCheckUtils]: 12: Hoare triple {137#true} ~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset; {137#true} is VALID [2020-07-11 00:33:25,987 INFO L280 TraceCheckUtils]: 13: Hoare triple {137#true} havoc ~i0~0; {137#true} is VALID [2020-07-11 00:33:25,987 INFO L280 TraceCheckUtils]: 14: Hoare triple {137#true} havoc ~j0~0; {137#true} is VALID [2020-07-11 00:33:25,987 INFO L280 TraceCheckUtils]: 15: Hoare triple {137#true} havoc ~i~0; {137#true} is VALID [2020-07-11 00:33:25,989 INFO L280 TraceCheckUtils]: 16: Hoare triple {137#true} assume !true; {138#false} is VALID [2020-07-11 00:33:25,989 INFO L280 TraceCheckUtils]: 17: Hoare triple {138#false} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {138#false} is VALID [2020-07-11 00:33:25,989 INFO L280 TraceCheckUtils]: 18: Hoare triple {138#false} assume ~j0~0 < 23; {138#false} is VALID [2020-07-11 00:33:25,990 INFO L280 TraceCheckUtils]: 19: Hoare triple {138#false} assume ~j0~0 < 0; {138#false} is VALID [2020-07-11 00:33:25,990 INFO L280 TraceCheckUtils]: 20: Hoare triple {138#false} assume !true; {138#false} is VALID [2020-07-11 00:33:25,990 INFO L280 TraceCheckUtils]: 21: Hoare triple {138#false} #res := ~x; {138#false} is VALID [2020-07-11 00:33:25,991 INFO L280 TraceCheckUtils]: 22: Hoare triple {138#false} assume true; {138#false} is VALID [2020-07-11 00:33:25,991 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {138#false} {137#true} #219#return; {138#false} is VALID [2020-07-11 00:33:25,992 INFO L280 TraceCheckUtils]: 24: Hoare triple {138#false} ~res~0 := #t~ret13; {138#false} is VALID [2020-07-11 00:33:25,992 INFO L280 TraceCheckUtils]: 25: Hoare triple {138#false} havoc #t~ret13; {138#false} is VALID [2020-07-11 00:33:25,992 INFO L280 TraceCheckUtils]: 26: Hoare triple {138#false} SUMMARY for call #t~mem14 := read~real(~#iptr~0.base, ~#iptr~0.offset, 4); srcloc: L85 {138#false} is VALID [2020-07-11 00:33:25,993 INFO L263 TraceCheckUtils]: 27: Hoare triple {138#false} call #t~ret15 := isnan_float(#t~mem14); {137#true} is VALID [2020-07-11 00:33:25,993 INFO L280 TraceCheckUtils]: 28: Hoare triple {137#true} ~x := #in~x; {137#true} is VALID [2020-07-11 00:33:25,994 INFO L280 TraceCheckUtils]: 29: Hoare triple {137#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {137#true} is VALID [2020-07-11 00:33:25,994 INFO L280 TraceCheckUtils]: 30: Hoare triple {137#true} assume true; {137#true} is VALID [2020-07-11 00:33:25,994 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {137#true} {138#false} #221#return; {138#false} is VALID [2020-07-11 00:33:25,995 INFO L280 TraceCheckUtils]: 32: Hoare triple {138#false} assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647; {138#false} is VALID [2020-07-11 00:33:25,995 INFO L280 TraceCheckUtils]: 33: Hoare triple {138#false} #t~short17 := 0 != #t~ret15; {138#false} is VALID [2020-07-11 00:33:25,995 INFO L280 TraceCheckUtils]: 34: Hoare triple {138#false} assume !#t~short17; {138#false} is VALID [2020-07-11 00:33:25,996 INFO L280 TraceCheckUtils]: 35: Hoare triple {138#false} assume #t~short17; {138#false} is VALID [2020-07-11 00:33:25,996 INFO L280 TraceCheckUtils]: 36: Hoare triple {138#false} havoc #t~mem14; {138#false} is VALID [2020-07-11 00:33:25,997 INFO L280 TraceCheckUtils]: 37: Hoare triple {138#false} havoc #t~ret15; {138#false} is VALID [2020-07-11 00:33:25,997 INFO L280 TraceCheckUtils]: 38: Hoare triple {138#false} havoc #t~short17; {138#false} is VALID [2020-07-11 00:33:25,997 INFO L280 TraceCheckUtils]: 39: Hoare triple {138#false} havoc #t~ret16; {138#false} is VALID [2020-07-11 00:33:25,998 INFO L280 TraceCheckUtils]: 40: Hoare triple {138#false} assume !false; {138#false} is VALID [2020-07-11 00:33:26,003 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:33:26,005 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2066564365] [2020-07-11 00:33:26,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:33:26,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-11 00:33:26,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976948477] [2020-07-11 00:33:26,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2020-07-11 00:33:26,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:26,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 00:33:26,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:26,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 00:33:26,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:26,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 00:33:26,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 00:33:26,115 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 4 states. [2020-07-11 00:33:27,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:27,033 INFO L93 Difference]: Finished difference Result 249 states and 287 transitions. [2020-07-11 00:33:27,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 00:33:27,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2020-07-11 00:33:27,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:27,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 00:33:27,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 287 transitions. [2020-07-11 00:33:27,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 00:33:27,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 287 transitions. [2020-07-11 00:33:27,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 287 transitions. [2020-07-11 00:33:27,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 287 edges. 287 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:27,429 INFO L225 Difference]: With dead ends: 249 [2020-07-11 00:33:27,429 INFO L226 Difference]: Without dead ends: 120 [2020-07-11 00:33:27,436 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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:33:27,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-07-11 00:33:27,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2020-07-11 00:33:27,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:27,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand 120 states. [2020-07-11 00:33:27,587 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 120 states. [2020-07-11 00:33:27,587 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 120 states. [2020-07-11 00:33:27,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:27,602 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2020-07-11 00:33:27,603 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2020-07-11 00:33:27,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:27,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:27,608 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 120 states. [2020-07-11 00:33:27,608 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 120 states. [2020-07-11 00:33:27,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:27,634 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2020-07-11 00:33:27,634 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2020-07-11 00:33:27,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:27,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:27,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:27,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:27,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-11 00:33:27,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2020-07-11 00:33:27,647 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 41 [2020-07-11 00:33:27,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:27,648 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2020-07-11 00:33:27,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 00:33:27,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 120 states and 124 transitions. [2020-07-11 00:33:27,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:27,794 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2020-07-11 00:33:27,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-11 00:33:27,797 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:27,797 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, 1, 1] [2020-07-11 00:33:27,797 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:33:27,798 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:27,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:27,798 INFO L82 PathProgramCache]: Analyzing trace with hash 911495883, now seen corresponding path program 1 times [2020-07-11 00:33:27,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:27,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [478724579] [2020-07-11 00:33:27,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:27,933 INFO L280 TraceCheckUtils]: 0: Hoare triple {1189#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~one_modf~0 |old(~one_modf~0)|))} #NULL.base, #NULL.offset := 0, 0; {1147#true} is VALID [2020-07-11 00:33:27,933 INFO L280 TraceCheckUtils]: 1: Hoare triple {1147#true} #valid := #valid[0 := 0]; {1147#true} is VALID [2020-07-11 00:33:27,934 INFO L280 TraceCheckUtils]: 2: Hoare triple {1147#true} assume 0 < #StackHeapBarrier; {1147#true} is VALID [2020-07-11 00:33:27,934 INFO L280 TraceCheckUtils]: 3: Hoare triple {1147#true} ~one_modf~0 := 1.0; {1147#true} is VALID [2020-07-11 00:33:27,934 INFO L280 TraceCheckUtils]: 4: Hoare triple {1147#true} assume true; {1147#true} is VALID [2020-07-11 00:33:27,935 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1147#true} {1147#true} #215#return; {1147#true} is VALID [2020-07-11 00:33:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:27,972 INFO L280 TraceCheckUtils]: 0: Hoare triple {1190#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1147#true} is VALID [2020-07-11 00:33:27,972 INFO L280 TraceCheckUtils]: 1: Hoare triple {1147#true} ~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset; {1147#true} is VALID [2020-07-11 00:33:27,973 INFO L280 TraceCheckUtils]: 2: Hoare triple {1147#true} havoc ~i0~0; {1147#true} is VALID [2020-07-11 00:33:27,973 INFO L280 TraceCheckUtils]: 3: Hoare triple {1147#true} havoc ~j0~0; {1147#true} is VALID [2020-07-11 00:33:27,973 INFO L280 TraceCheckUtils]: 4: Hoare triple {1147#true} havoc ~i~0; {1147#true} is VALID [2020-07-11 00:33:27,974 INFO L280 TraceCheckUtils]: 5: Hoare triple {1147#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L16-2 {1147#true} is VALID [2020-07-11 00:33:27,974 INFO L280 TraceCheckUtils]: 6: Hoare triple {1147#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L17 {1147#true} is VALID [2020-07-11 00:33:27,974 INFO L280 TraceCheckUtils]: 7: Hoare triple {1147#true} SUMMARY for call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L18 {1147#true} is VALID [2020-07-11 00:33:27,974 INFO L280 TraceCheckUtils]: 8: Hoare triple {1147#true} ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); {1147#true} is VALID [2020-07-11 00:33:27,975 INFO L280 TraceCheckUtils]: 9: Hoare triple {1147#true} SUMMARY for call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L19-1 {1147#true} is VALID [2020-07-11 00:33:27,975 INFO L280 TraceCheckUtils]: 10: Hoare triple {1147#true} havoc #t~union1; {1147#true} is VALID [2020-07-11 00:33:27,975 INFO L280 TraceCheckUtils]: 11: Hoare triple {1147#true} havoc #t~mem0; {1147#true} is VALID [2020-07-11 00:33:27,976 INFO L280 TraceCheckUtils]: 12: Hoare triple {1147#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L17-1 {1147#true} is VALID [2020-07-11 00:33:27,976 INFO L280 TraceCheckUtils]: 13: Hoare triple {1147#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1147#true} is VALID [2020-07-11 00:33:27,976 INFO L280 TraceCheckUtils]: 14: Hoare triple {1147#true} goto; {1147#true} is VALID [2020-07-11 00:33:27,976 INFO L280 TraceCheckUtils]: 15: Hoare triple {1147#true} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {1147#true} is VALID [2020-07-11 00:33:27,977 INFO L280 TraceCheckUtils]: 16: Hoare triple {1147#true} assume ~j0~0 < 23; {1147#true} is VALID [2020-07-11 00:33:27,977 INFO L280 TraceCheckUtils]: 17: Hoare triple {1147#true} assume ~j0~0 < 0; {1147#true} is VALID [2020-07-11 00:33:27,977 INFO L280 TraceCheckUtils]: 18: Hoare triple {1147#true} SUMMARY for call ~#sf_u~0.base, ~#sf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L24-2 {1147#true} is VALID [2020-07-11 00:33:27,978 INFO L280 TraceCheckUtils]: 19: Hoare triple {1147#true} SUMMARY for call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#sf_u~0.base, ~#sf_u~0.offset, 4); srcloc: L25 {1147#true} is VALID [2020-07-11 00:33:27,978 INFO L280 TraceCheckUtils]: 20: Hoare triple {1147#true} SUMMARY for call #t~mem2 := read~real(~#sf_u~0.base, ~#sf_u~0.offset, 4); srcloc: L26 {1147#true} is VALID [2020-07-11 00:33:27,978 INFO L280 TraceCheckUtils]: 21: Hoare triple {1147#true} SUMMARY for call write~real(#t~mem2, ~iptr.base, ~iptr.offset, 4); srcloc: L27 {1147#true} is VALID [2020-07-11 00:33:27,978 INFO L280 TraceCheckUtils]: 22: Hoare triple {1147#true} havoc #t~mem2; {1147#true} is VALID [2020-07-11 00:33:28,000 INFO L280 TraceCheckUtils]: 23: Hoare triple {1147#true} SUMMARY for call ULTIMATE.dealloc(~#sf_u~0.base, ~#sf_u~0.offset); srcloc: L25-1 {1147#true} is VALID [2020-07-11 00:33:28,000 INFO L280 TraceCheckUtils]: 24: Hoare triple {1147#true} havoc ~#sf_u~0.base, ~#sf_u~0.offset; {1147#true} is VALID [2020-07-11 00:33:28,000 INFO L280 TraceCheckUtils]: 25: Hoare triple {1147#true} goto; {1147#true} is VALID [2020-07-11 00:33:28,001 INFO L280 TraceCheckUtils]: 26: Hoare triple {1147#true} #res := ~x; {1147#true} is VALID [2020-07-11 00:33:28,001 INFO L280 TraceCheckUtils]: 27: Hoare triple {1147#true} assume true; {1147#true} is VALID [2020-07-11 00:33:28,001 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1147#true} {1147#true} #219#return; {1147#true} is VALID [2020-07-11 00:33:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:28,007 INFO L280 TraceCheckUtils]: 0: Hoare triple {1147#true} ~x := #in~x; {1147#true} is VALID [2020-07-11 00:33:28,008 INFO L280 TraceCheckUtils]: 1: Hoare triple {1147#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {1147#true} is VALID [2020-07-11 00:33:28,008 INFO L280 TraceCheckUtils]: 2: Hoare triple {1147#true} assume true; {1147#true} is VALID [2020-07-11 00:33:28,008 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1147#true} {1147#true} #221#return; {1147#true} is VALID [2020-07-11 00:33:28,010 INFO L263 TraceCheckUtils]: 0: Hoare triple {1147#true} call ULTIMATE.init(); {1189#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~one_modf~0 |old(~one_modf~0)|))} is VALID [2020-07-11 00:33:28,010 INFO L280 TraceCheckUtils]: 1: Hoare triple {1189#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~one_modf~0 |old(~one_modf~0)|))} #NULL.base, #NULL.offset := 0, 0; {1147#true} is VALID [2020-07-11 00:33:28,010 INFO L280 TraceCheckUtils]: 2: Hoare triple {1147#true} #valid := #valid[0 := 0]; {1147#true} is VALID [2020-07-11 00:33:28,010 INFO L280 TraceCheckUtils]: 3: Hoare triple {1147#true} assume 0 < #StackHeapBarrier; {1147#true} is VALID [2020-07-11 00:33:28,011 INFO L280 TraceCheckUtils]: 4: Hoare triple {1147#true} ~one_modf~0 := 1.0; {1147#true} is VALID [2020-07-11 00:33:28,011 INFO L280 TraceCheckUtils]: 5: Hoare triple {1147#true} assume true; {1147#true} is VALID [2020-07-11 00:33:28,011 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1147#true} {1147#true} #215#return; {1147#true} is VALID [2020-07-11 00:33:28,011 INFO L263 TraceCheckUtils]: 7: Hoare triple {1147#true} call #t~ret18 := main(); {1147#true} is VALID [2020-07-11 00:33:28,012 INFO L280 TraceCheckUtils]: 8: Hoare triple {1147#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {1147#true} is VALID [2020-07-11 00:33:28,014 INFO L280 TraceCheckUtils]: 9: Hoare triple {1147#true} SUMMARY for call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.allocOnStack(4); srcloc: L81 {1147#true} is VALID [2020-07-11 00:33:28,016 INFO L263 TraceCheckUtils]: 10: Hoare triple {1147#true} call #t~ret13 := modf_float(~x~0, ~#iptr~0.base, ~#iptr~0.offset); {1190#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:28,016 INFO L280 TraceCheckUtils]: 11: Hoare triple {1190#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1147#true} is VALID [2020-07-11 00:33:28,017 INFO L280 TraceCheckUtils]: 12: Hoare triple {1147#true} ~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset; {1147#true} is VALID [2020-07-11 00:33:28,017 INFO L280 TraceCheckUtils]: 13: Hoare triple {1147#true} havoc ~i0~0; {1147#true} is VALID [2020-07-11 00:33:28,017 INFO L280 TraceCheckUtils]: 14: Hoare triple {1147#true} havoc ~j0~0; {1147#true} is VALID [2020-07-11 00:33:28,017 INFO L280 TraceCheckUtils]: 15: Hoare triple {1147#true} havoc ~i~0; {1147#true} is VALID [2020-07-11 00:33:28,018 INFO L280 TraceCheckUtils]: 16: Hoare triple {1147#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L16-2 {1147#true} is VALID [2020-07-11 00:33:28,018 INFO L280 TraceCheckUtils]: 17: Hoare triple {1147#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L17 {1147#true} is VALID [2020-07-11 00:33:28,018 INFO L280 TraceCheckUtils]: 18: Hoare triple {1147#true} SUMMARY for call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L18 {1147#true} is VALID [2020-07-11 00:33:28,018 INFO L280 TraceCheckUtils]: 19: Hoare triple {1147#true} ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); {1147#true} is VALID [2020-07-11 00:33:28,019 INFO L280 TraceCheckUtils]: 20: Hoare triple {1147#true} SUMMARY for call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L19-1 {1147#true} is VALID [2020-07-11 00:33:28,019 INFO L280 TraceCheckUtils]: 21: Hoare triple {1147#true} havoc #t~union1; {1147#true} is VALID [2020-07-11 00:33:28,019 INFO L280 TraceCheckUtils]: 22: Hoare triple {1147#true} havoc #t~mem0; {1147#true} is VALID [2020-07-11 00:33:28,019 INFO L280 TraceCheckUtils]: 23: Hoare triple {1147#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L17-1 {1147#true} is VALID [2020-07-11 00:33:28,020 INFO L280 TraceCheckUtils]: 24: Hoare triple {1147#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1147#true} is VALID [2020-07-11 00:33:28,020 INFO L280 TraceCheckUtils]: 25: Hoare triple {1147#true} goto; {1147#true} is VALID [2020-07-11 00:33:28,020 INFO L280 TraceCheckUtils]: 26: Hoare triple {1147#true} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {1147#true} is VALID [2020-07-11 00:33:28,021 INFO L280 TraceCheckUtils]: 27: Hoare triple {1147#true} assume ~j0~0 < 23; {1147#true} is VALID [2020-07-11 00:33:28,021 INFO L280 TraceCheckUtils]: 28: Hoare triple {1147#true} assume ~j0~0 < 0; {1147#true} is VALID [2020-07-11 00:33:28,021 INFO L280 TraceCheckUtils]: 29: Hoare triple {1147#true} SUMMARY for call ~#sf_u~0.base, ~#sf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L24-2 {1147#true} is VALID [2020-07-11 00:33:28,021 INFO L280 TraceCheckUtils]: 30: Hoare triple {1147#true} SUMMARY for call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#sf_u~0.base, ~#sf_u~0.offset, 4); srcloc: L25 {1147#true} is VALID [2020-07-11 00:33:28,022 INFO L280 TraceCheckUtils]: 31: Hoare triple {1147#true} SUMMARY for call #t~mem2 := read~real(~#sf_u~0.base, ~#sf_u~0.offset, 4); srcloc: L26 {1147#true} is VALID [2020-07-11 00:33:28,022 INFO L280 TraceCheckUtils]: 32: Hoare triple {1147#true} SUMMARY for call write~real(#t~mem2, ~iptr.base, ~iptr.offset, 4); srcloc: L27 {1147#true} is VALID [2020-07-11 00:33:28,022 INFO L280 TraceCheckUtils]: 33: Hoare triple {1147#true} havoc #t~mem2; {1147#true} is VALID [2020-07-11 00:33:28,023 INFO L280 TraceCheckUtils]: 34: Hoare triple {1147#true} SUMMARY for call ULTIMATE.dealloc(~#sf_u~0.base, ~#sf_u~0.offset); srcloc: L25-1 {1147#true} is VALID [2020-07-11 00:33:28,023 INFO L280 TraceCheckUtils]: 35: Hoare triple {1147#true} havoc ~#sf_u~0.base, ~#sf_u~0.offset; {1147#true} is VALID [2020-07-11 00:33:28,023 INFO L280 TraceCheckUtils]: 36: Hoare triple {1147#true} goto; {1147#true} is VALID [2020-07-11 00:33:28,023 INFO L280 TraceCheckUtils]: 37: Hoare triple {1147#true} #res := ~x; {1147#true} is VALID [2020-07-11 00:33:28,024 INFO L280 TraceCheckUtils]: 38: Hoare triple {1147#true} assume true; {1147#true} is VALID [2020-07-11 00:33:28,024 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1147#true} {1147#true} #219#return; {1147#true} is VALID [2020-07-11 00:33:28,024 INFO L280 TraceCheckUtils]: 40: Hoare triple {1147#true} ~res~0 := #t~ret13; {1147#true} is VALID [2020-07-11 00:33:28,024 INFO L280 TraceCheckUtils]: 41: Hoare triple {1147#true} havoc #t~ret13; {1147#true} is VALID [2020-07-11 00:33:28,025 INFO L280 TraceCheckUtils]: 42: Hoare triple {1147#true} SUMMARY for call #t~mem14 := read~real(~#iptr~0.base, ~#iptr~0.offset, 4); srcloc: L85 {1147#true} is VALID [2020-07-11 00:33:28,025 INFO L263 TraceCheckUtils]: 43: Hoare triple {1147#true} call #t~ret15 := isnan_float(#t~mem14); {1147#true} is VALID [2020-07-11 00:33:28,025 INFO L280 TraceCheckUtils]: 44: Hoare triple {1147#true} ~x := #in~x; {1147#true} is VALID [2020-07-11 00:33:28,025 INFO L280 TraceCheckUtils]: 45: Hoare triple {1147#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {1147#true} is VALID [2020-07-11 00:33:28,026 INFO L280 TraceCheckUtils]: 46: Hoare triple {1147#true} assume true; {1147#true} is VALID [2020-07-11 00:33:28,026 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {1147#true} {1147#true} #221#return; {1147#true} is VALID [2020-07-11 00:33:28,026 INFO L280 TraceCheckUtils]: 48: Hoare triple {1147#true} assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647; {1147#true} is VALID [2020-07-11 00:33:28,027 INFO L280 TraceCheckUtils]: 49: Hoare triple {1147#true} #t~short17 := 0 != #t~ret15; {1147#true} is VALID [2020-07-11 00:33:28,027 INFO L280 TraceCheckUtils]: 50: Hoare triple {1147#true} assume !#t~short17; {1188#(not |main_#t~short17|)} is VALID [2020-07-11 00:33:28,028 INFO L280 TraceCheckUtils]: 51: Hoare triple {1188#(not |main_#t~short17|)} assume #t~short17; {1148#false} is VALID [2020-07-11 00:33:28,028 INFO L280 TraceCheckUtils]: 52: Hoare triple {1148#false} havoc #t~mem14; {1148#false} is VALID [2020-07-11 00:33:28,029 INFO L280 TraceCheckUtils]: 53: Hoare triple {1148#false} havoc #t~ret15; {1148#false} is VALID [2020-07-11 00:33:28,029 INFO L280 TraceCheckUtils]: 54: Hoare triple {1148#false} havoc #t~short17; {1148#false} is VALID [2020-07-11 00:33:28,029 INFO L280 TraceCheckUtils]: 55: Hoare triple {1148#false} havoc #t~ret16; {1148#false} is VALID [2020-07-11 00:33:28,030 INFO L280 TraceCheckUtils]: 56: Hoare triple {1148#false} assume !false; {1148#false} is VALID [2020-07-11 00:33:28,033 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:33:28,034 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [478724579] [2020-07-11 00:33:28,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:33:28,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 00:33:28,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125482800] [2020-07-11 00:33:28,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2020-07-11 00:33:28,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:28,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 00:33:28,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:28,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 00:33:28,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:28,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 00:33:28,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 00:33:28,107 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand 5 states. [2020-07-11 00:33:28,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:28,834 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2020-07-11 00:33:28,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-11 00:33:28,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2020-07-11 00:33:28,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:28,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:33:28,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2020-07-11 00:33:28,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:33:28,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2020-07-11 00:33:28,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 130 transitions. [2020-07-11 00:33:28,990 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:28,999 INFO L225 Difference]: With dead ends: 127 [2020-07-11 00:33:28,999 INFO L226 Difference]: Without dead ends: 120 [2020-07-11 00:33:29,001 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:33:29,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-07-11 00:33:29,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2020-07-11 00:33:29,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:29,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand 120 states. [2020-07-11 00:33:29,086 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 120 states. [2020-07-11 00:33:29,086 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 120 states. [2020-07-11 00:33:29,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:29,092 INFO L93 Difference]: Finished difference Result 120 states and 123 transitions. [2020-07-11 00:33:29,092 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 123 transitions. [2020-07-11 00:33:29,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:29,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:29,094 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 120 states. [2020-07-11 00:33:29,094 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 120 states. [2020-07-11 00:33:29,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:29,102 INFO L93 Difference]: Finished difference Result 120 states and 123 transitions. [2020-07-11 00:33:29,102 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 123 transitions. [2020-07-11 00:33:29,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:29,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:29,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:29,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-11 00:33:29,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 123 transitions. [2020-07-11 00:33:29,112 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 123 transitions. Word has length 57 [2020-07-11 00:33:29,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:29,112 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 123 transitions. [2020-07-11 00:33:29,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 00:33:29,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 120 states and 123 transitions. [2020-07-11 00:33:29,238 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:29,238 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 123 transitions. [2020-07-11 00:33:29,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-11 00:33:29,244 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:29,244 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1] [2020-07-11 00:33:29,244 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:33:29,245 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:29,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:29,245 INFO L82 PathProgramCache]: Analyzing trace with hash 376809565, now seen corresponding path program 1 times [2020-07-11 00:33:29,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:29,245 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2130992744] [2020-07-11 00:33:29,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:29,300 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:33:29,301 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.theory.linar.TableauxRow.(TableauxRow.java:45) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.generateLinVar(LinArSolve.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.createEquality(LinArSolve.java:1974) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createLAEquality(EqualityProxy.java:83) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createAtom(EqualityProxy.java:165) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.getLiteral(EqualityProxy.java:186) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createCCEquality(EqualityProxy.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.mbtc(LinArSolve.java:1891) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.computeConflictClause(LinArSolve.java:664) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.checkConsistency(DPLLEngine.java:1012) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.solve(DPLLEngine.java:1159) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol$CheckType$1.check(SMTInterpol.java:117) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSatAssuming(SMTInterpol.java:494) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSat(SMTInterpol.java:446) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:300) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:214) 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:33:29,307 INFO L168 Benchmark]: Toolchain (without parser) took 4963.18 ms. Allocated memory was 145.2 MB in the beginning and 275.8 MB in the end (delta: 130.5 MB). Free memory was 104.0 MB in the beginning and 161.0 MB in the end (delta: -56.9 MB). Peak memory consumption was 73.6 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:29,309 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 145.2 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-11 00:33:29,310 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.86 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 103.6 MB in the beginning and 180.5 MB in the end (delta: -76.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:29,311 INFO L168 Benchmark]: Boogie Preprocessor took 66.03 ms. Allocated memory is still 202.4 MB. Free memory was 180.5 MB in the beginning and 177.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:29,311 INFO L168 Benchmark]: RCFGBuilder took 753.58 ms. Allocated memory is still 202.4 MB. Free memory was 177.8 MB in the beginning and 123.9 MB in the end (delta: 53.9 MB). Peak memory consumption was 53.9 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:29,312 INFO L168 Benchmark]: TraceAbstraction took 3718.79 ms. Allocated memory was 202.4 MB in the beginning and 275.8 MB in the end (delta: 73.4 MB). Free memory was 123.3 MB in the beginning and 161.0 MB in the end (delta: -37.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:29,317 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.26 ms. Allocated memory is still 145.2 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 418.86 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 103.6 MB in the beginning and 180.5 MB in the end (delta: -76.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.03 ms. Allocated memory is still 202.4 MB. Free memory was 180.5 MB in the beginning and 177.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 753.58 ms. Allocated memory is still 202.4 MB. Free memory was 177.8 MB in the beginning and 123.9 MB in the end (delta: 53.9 MB). Peak memory consumption was 53.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3718.79 ms. Allocated memory was 202.4 MB in the beginning and 275.8 MB in the end (delta: 73.4 MB). Free memory was 123.3 MB in the beginning and 161.0 MB in the end (delta: -37.7 MB). Peak memory consumption was 35.7 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.theory.linar.TableauxRow.(TableauxRow.java:45) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...