/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 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1211b.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:42:18,873 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:42:18,875 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:42:18,889 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:42:18,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:42:18,890 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:42:18,892 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:42:18,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:42:18,895 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:42:18,896 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:42:18,897 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:42:18,898 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:42:18,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:42:18,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:42:18,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:42:18,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:42:18,903 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:42:18,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:42:18,905 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:42:18,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:42:18,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:42:18,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:42:18,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:42:18,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:42:18,913 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:42:18,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:42:18,914 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:42:18,915 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:42:18,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:42:18,916 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:42:18,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:42:18,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:42:18,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:42:18,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:42:18,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:42:18,920 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:42:18,920 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:42:18,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:42:18,921 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:42:18,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:42:18,922 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:42:18,923 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 14:42:18,937 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:42:18,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:42:18,939 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:42:18,939 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:42:18,939 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:42:18,940 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:42:18,940 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:42:18,940 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:42:18,940 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:42:18,940 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:42:18,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:42:18,941 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:42:18,941 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:42:18,941 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:42:18,941 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:42:18,942 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:42:18,942 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:42:18,942 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:42:18,942 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:42:18,942 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:42:18,943 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:42:18,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:42:18,943 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:42:18,943 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:42:18,943 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:42:18,944 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:42:18,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:42:18,944 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:42:18,944 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:42:18,944 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:42:19,229 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:42:19,241 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:42:19,244 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:42:19,245 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:42:19,246 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:42:19,246 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1211b.c [2020-07-10 14:42:19,331 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/563d52365/bdb45acb7771452b9b315b6e0003c3f4/FLAG8081dae75 [2020-07-10 14:42:19,835 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:42:19,836 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1211b.c [2020-07-10 14:42:19,842 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/563d52365/bdb45acb7771452b9b315b6e0003c3f4/FLAG8081dae75 [2020-07-10 14:42:20,251 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/563d52365/bdb45acb7771452b9b315b6e0003c3f4 [2020-07-10 14:42:20,271 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:42:20,274 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:42:20,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:42:20,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:42:20,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:42:20,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:42:20" (1/1) ... [2020-07-10 14:42:20,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@306a7df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:20, skipping insertion in model container [2020-07-10 14:42:20,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:42:20" (1/1) ... [2020-07-10 14:42:20,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:42:20,320 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:42:20,599 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:42:20,611 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:42:20,777 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:42:20,800 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:42:20,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:20 WrapperNode [2020-07-10 14:42:20,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:42:20,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:42:20,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:42:20,802 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:42:20,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:20" (1/1) ... [2020-07-10 14:42:20,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:20" (1/1) ... [2020-07-10 14:42:20,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:20" (1/1) ... [2020-07-10 14:42:20,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:20" (1/1) ... [2020-07-10 14:42:20,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:20" (1/1) ... [2020-07-10 14:42:20,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:20" (1/1) ... [2020-07-10 14:42:20,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:20" (1/1) ... [2020-07-10 14:42:20,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:42:20,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:42:20,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:42:20,930 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:42:20,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:20" (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-10 14:42:21,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:42:21,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:42:21,019 INFO L138 BoogieDeclarations]: Found implementation of procedure modf_float [2020-07-10 14:42:21,020 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2020-07-10 14:42:21,020 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2020-07-10 14:42:21,020 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:42:21,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:42:21,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2020-07-10 14:42:21,020 INFO L130 BoogieDeclarations]: Found specification of procedure modf_float [2020-07-10 14:42:21,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 14:42:21,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-10 14:42:21,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 14:42:21,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 14:42:21,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 14:42:21,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-10 14:42:21,023 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2020-07-10 14:42:21,024 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2020-07-10 14:42:21,024 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:42:21,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2020-07-10 14:42:21,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:42:21,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:42:21,806 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:42:21,807 INFO L295 CfgBuilder]: Removed 18 assume(true) statements. [2020-07-10 14:42:21,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:42:21 BoogieIcfgContainer [2020-07-10 14:42:21,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:42:21,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:42:21,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:42:21,816 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:42:21,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:42:20" (1/3) ... [2020-07-10 14:42:21,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c07e397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:42:21, skipping insertion in model container [2020-07-10 14:42:21,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:20" (2/3) ... [2020-07-10 14:42:21,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c07e397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:42:21, skipping insertion in model container [2020-07-10 14:42:21,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:42:21" (3/3) ... [2020-07-10 14:42:21,821 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1211b.c [2020-07-10 14:42:21,831 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:42:21,838 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:42:21,851 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:42:21,873 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:42:21,873 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:42:21,873 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:42:21,874 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:42:21,874 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:42:21,874 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:42:21,874 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:42:21,875 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:42:21,895 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2020-07-10 14:42:21,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 14:42:21,902 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:21,903 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] [2020-07-10 14:42:21,904 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:21,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:21,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1328912444, now seen corresponding path program 1 times [2020-07-10 14:42:21,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:21,922 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965677847] [2020-07-10 14:42:21,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:22,139 INFO L280 TraceCheckUtils]: 0: Hoare triple {81#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~one_modf~0 := 1.0; {62#true} is VALID [2020-07-10 14:42:22,140 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-10 14:42:22,140 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {62#true} {62#true} #170#return; {62#true} is VALID [2020-07-10 14:42:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:22,171 INFO L280 TraceCheckUtils]: 0: Hoare triple {82#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset;havoc ~i0~0;havoc ~j0~0;havoc ~i~0; {62#true} is VALID [2020-07-10 14:42:22,172 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} assume !true; {63#false} is VALID [2020-07-10 14:42:22,173 INFO L280 TraceCheckUtils]: 2: Hoare triple {63#false} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {63#false} is VALID [2020-07-10 14:42:22,173 INFO L280 TraceCheckUtils]: 3: Hoare triple {63#false} assume !(~j0~0 < 23);havoc ~ix~1;call write~real(~someBinaryArithmeticFLOAToperation(~x, ~one_modf~0), ~iptr.base, ~iptr.offset, 4); {63#false} is VALID [2020-07-10 14:42:22,174 INFO L280 TraceCheckUtils]: 4: Hoare triple {63#false} assume !true; {63#false} is VALID [2020-07-10 14:42:22,174 INFO L280 TraceCheckUtils]: 5: Hoare triple {63#false} assume !true; {63#false} is VALID [2020-07-10 14:42:22,174 INFO L280 TraceCheckUtils]: 6: Hoare triple {63#false} #res := ~x; {63#false} is VALID [2020-07-10 14:42:22,175 INFO L280 TraceCheckUtils]: 7: Hoare triple {63#false} assume true; {63#false} is VALID [2020-07-10 14:42:22,175 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {63#false} {62#true} #164#return; {63#false} is VALID [2020-07-10 14:42:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:22,191 INFO L280 TraceCheckUtils]: 0: Hoare triple {82#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~ix~2; {62#true} is VALID [2020-07-10 14:42:22,192 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} assume !true; {63#false} is VALID [2020-07-10 14:42:22,192 INFO L280 TraceCheckUtils]: 2: Hoare triple {63#false} ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647);#res := (if 2139095040 == ~ix~2 then 1 else 0); {63#false} is VALID [2020-07-10 14:42:22,193 INFO L280 TraceCheckUtils]: 3: Hoare triple {63#false} assume true; {63#false} is VALID [2020-07-10 14:42:22,193 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {63#false} {63#false} #166#return; {63#false} is VALID [2020-07-10 14:42:22,196 INFO L263 TraceCheckUtils]: 0: Hoare triple {62#true} call ULTIMATE.init(); {81#(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-10 14:42:22,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {81#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~one_modf~0 := 1.0; {62#true} is VALID [2020-07-10 14:42:22,197 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-10 14:42:22,198 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {62#true} {62#true} #170#return; {62#true} is VALID [2020-07-10 14:42:22,198 INFO L263 TraceCheckUtils]: 4: Hoare triple {62#true} call #t~ret24 := main(); {62#true} is VALID [2020-07-10 14:42:22,198 INFO L280 TraceCheckUtils]: 5: Hoare triple {62#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0);call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.allocOnStack(4);call write~init~real(#t~nondet17, ~#iptr~0.base, ~#iptr~0.offset, 4);havoc #t~nondet17; {62#true} is VALID [2020-07-10 14:42:22,201 INFO L263 TraceCheckUtils]: 6: Hoare triple {62#true} call #t~ret18 := modf_float(~x~0, ~#iptr~0.base, ~#iptr~0.offset); {82#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:22,201 INFO L280 TraceCheckUtils]: 7: Hoare triple {82#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset;havoc ~i0~0;havoc ~j0~0;havoc ~i~0; {62#true} is VALID [2020-07-10 14:42:22,202 INFO L280 TraceCheckUtils]: 8: Hoare triple {62#true} assume !true; {63#false} is VALID [2020-07-10 14:42:22,202 INFO L280 TraceCheckUtils]: 9: Hoare triple {63#false} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {63#false} is VALID [2020-07-10 14:42:22,203 INFO L280 TraceCheckUtils]: 10: Hoare triple {63#false} assume !(~j0~0 < 23);havoc ~ix~1;call write~real(~someBinaryArithmeticFLOAToperation(~x, ~one_modf~0), ~iptr.base, ~iptr.offset, 4); {63#false} is VALID [2020-07-10 14:42:22,203 INFO L280 TraceCheckUtils]: 11: Hoare triple {63#false} assume !true; {63#false} is VALID [2020-07-10 14:42:22,203 INFO L280 TraceCheckUtils]: 12: Hoare triple {63#false} assume !true; {63#false} is VALID [2020-07-10 14:42:22,204 INFO L280 TraceCheckUtils]: 13: Hoare triple {63#false} #res := ~x; {63#false} is VALID [2020-07-10 14:42:22,204 INFO L280 TraceCheckUtils]: 14: Hoare triple {63#false} assume true; {63#false} is VALID [2020-07-10 14:42:22,204 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {63#false} {62#true} #164#return; {63#false} is VALID [2020-07-10 14:42:22,205 INFO L280 TraceCheckUtils]: 16: Hoare triple {63#false} ~res~0 := #t~ret18;havoc #t~ret18;call #t~mem19 := read~real(~#iptr~0.base, ~#iptr~0.offset, 4); {63#false} is VALID [2020-07-10 14:42:22,205 INFO L263 TraceCheckUtils]: 17: Hoare triple {63#false} call #t~ret20 := isinf_float(#t~mem19); {82#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:22,206 INFO L280 TraceCheckUtils]: 18: Hoare triple {82#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~ix~2; {62#true} is VALID [2020-07-10 14:42:22,207 INFO L280 TraceCheckUtils]: 19: Hoare triple {62#true} assume !true; {63#false} is VALID [2020-07-10 14:42:22,207 INFO L280 TraceCheckUtils]: 20: Hoare triple {63#false} ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647);#res := (if 2139095040 == ~ix~2 then 1 else 0); {63#false} is VALID [2020-07-10 14:42:22,207 INFO L280 TraceCheckUtils]: 21: Hoare triple {63#false} assume true; {63#false} is VALID [2020-07-10 14:42:22,208 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {63#false} {63#false} #166#return; {63#false} is VALID [2020-07-10 14:42:22,208 INFO L280 TraceCheckUtils]: 23: Hoare triple {63#false} assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647;#t~short23 := 0 != #t~ret20; {63#false} is VALID [2020-07-10 14:42:22,208 INFO L280 TraceCheckUtils]: 24: Hoare triple {63#false} assume !#t~short23; {63#false} is VALID [2020-07-10 14:42:22,209 INFO L280 TraceCheckUtils]: 25: Hoare triple {63#false} assume #t~short23;havoc #t~mem19;havoc #t~ret21;havoc #t~short23;havoc #t~ret20;havoc #t~short22; {63#false} is VALID [2020-07-10 14:42:22,209 INFO L280 TraceCheckUtils]: 26: Hoare triple {63#false} assume !false; {63#false} is VALID [2020-07-10 14:42:22,213 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-10 14:42:22,214 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965677847] [2020-07-10 14:42:22,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:42:22,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 14:42:22,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198417510] [2020-07-10 14:42:22,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-10 14:42:22,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:22,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 14:42:22,290 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:22,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 14:42:22,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:22,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 14:42:22,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 14:42:22,303 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 4 states. [2020-07-10 14:42:22,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:22,852 INFO L93 Difference]: Finished difference Result 110 states and 158 transitions. [2020-07-10 14:42:22,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 14:42:22,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-10 14:42:22,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:22,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:42:22,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2020-07-10 14:42:22,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:42:22,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2020-07-10 14:42:22,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 158 transitions. [2020-07-10 14:42:23,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:23,117 INFO L225 Difference]: With dead ends: 110 [2020-07-10 14:42:23,117 INFO L226 Difference]: Without dead ends: 55 [2020-07-10 14:42:23,121 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-10 14:42:23,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-10 14:42:23,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-10 14:42:23,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:23,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2020-07-10 14:42:23,207 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-10 14:42:23,207 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-10 14:42:23,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:23,214 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-10 14:42:23,215 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-10 14:42:23,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:23,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:23,216 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-10 14:42:23,217 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-10 14:42:23,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:23,223 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-10 14:42:23,223 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-10 14:42:23,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:23,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:23,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:23,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:23,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-10 14:42:23,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2020-07-10 14:42:23,232 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 27 [2020-07-10 14:42:23,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:23,232 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2020-07-10 14:42:23,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 14:42:23,233 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-10 14:42:23,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 14:42:23,235 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:23,235 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] [2020-07-10 14:42:23,235 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:42:23,236 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:23,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:23,236 INFO L82 PathProgramCache]: Analyzing trace with hash -2017954314, now seen corresponding path program 1 times [2020-07-10 14:42:23,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:23,237 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826400587] [2020-07-10 14:42:23,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:23,379 INFO L280 TraceCheckUtils]: 0: Hoare triple {431#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~one_modf~0 := 1.0; {408#true} is VALID [2020-07-10 14:42:23,379 INFO L280 TraceCheckUtils]: 1: Hoare triple {408#true} assume true; {408#true} is VALID [2020-07-10 14:42:23,380 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {408#true} {408#true} #170#return; {408#true} is VALID [2020-07-10 14:42:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:23,415 INFO L280 TraceCheckUtils]: 0: Hoare triple {432#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset;havoc ~i0~0;havoc ~j0~0;havoc ~i~0; {408#true} is VALID [2020-07-10 14:42:23,416 INFO L280 TraceCheckUtils]: 1: Hoare triple {408#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~mem0;havoc #t~union1;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {408#true} is VALID [2020-07-10 14:42:23,416 INFO L280 TraceCheckUtils]: 2: Hoare triple {408#true} goto; {408#true} is VALID [2020-07-10 14:42:23,416 INFO L280 TraceCheckUtils]: 3: Hoare triple {408#true} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {408#true} is VALID [2020-07-10 14:42:23,417 INFO L280 TraceCheckUtils]: 4: Hoare triple {408#true} assume ~j0~0 < 23; {408#true} is VALID [2020-07-10 14:42:23,417 INFO L280 TraceCheckUtils]: 5: Hoare triple {408#true} assume ~j0~0 < 0; {408#true} is VALID [2020-07-10 14:42:23,417 INFO L280 TraceCheckUtils]: 6: Hoare triple {408#true} call ~#sf_u~0.base, ~#sf_u~0.offset := #Ultimate.allocOnStack(4);call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#sf_u~0.base, ~#sf_u~0.offset, 4);call #t~mem2 := read~real(~#sf_u~0.base, ~#sf_u~0.offset, 4);call write~real(#t~mem2, ~iptr.base, ~iptr.offset, 4);havoc #t~mem2;call ULTIMATE.dealloc(~#sf_u~0.base, ~#sf_u~0.offset);havoc ~#sf_u~0.base, ~#sf_u~0.offset; {408#true} is VALID [2020-07-10 14:42:23,418 INFO L280 TraceCheckUtils]: 7: Hoare triple {408#true} goto; {408#true} is VALID [2020-07-10 14:42:23,418 INFO L280 TraceCheckUtils]: 8: Hoare triple {408#true} #res := ~x; {408#true} is VALID [2020-07-10 14:42:23,419 INFO L280 TraceCheckUtils]: 9: Hoare triple {408#true} assume true; {408#true} is VALID [2020-07-10 14:42:23,419 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {408#true} {408#true} #164#return; {408#true} is VALID [2020-07-10 14:42:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:23,431 INFO L280 TraceCheckUtils]: 0: Hoare triple {432#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~ix~2; {408#true} is VALID [2020-07-10 14:42:23,431 INFO L280 TraceCheckUtils]: 1: Hoare triple {408#true} call ~#gf_u~4.base, ~#gf_u~4.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~4.base, ~#gf_u~4.offset, 4);call #t~mem15 := read~int(~#gf_u~4.base, ~#gf_u~4.offset, 4);~ix~2 := (if #t~mem15 % 4294967296 % 4294967296 <= 2147483647 then #t~mem15 % 4294967296 % 4294967296 else #t~mem15 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union16, ~#gf_u~4.base, ~#gf_u~4.offset, 4);havoc #t~mem15;havoc #t~union16;call ULTIMATE.dealloc(~#gf_u~4.base, ~#gf_u~4.offset);havoc ~#gf_u~4.base, ~#gf_u~4.offset; {408#true} is VALID [2020-07-10 14:42:23,432 INFO L280 TraceCheckUtils]: 2: Hoare triple {408#true} goto; {408#true} is VALID [2020-07-10 14:42:23,432 INFO L280 TraceCheckUtils]: 3: Hoare triple {408#true} ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647);#res := (if 2139095040 == ~ix~2 then 1 else 0); {408#true} is VALID [2020-07-10 14:42:23,432 INFO L280 TraceCheckUtils]: 4: Hoare triple {408#true} assume true; {408#true} is VALID [2020-07-10 14:42:23,433 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {408#true} {408#true} #166#return; {408#true} is VALID [2020-07-10 14:42:23,434 INFO L263 TraceCheckUtils]: 0: Hoare triple {408#true} call ULTIMATE.init(); {431#(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-10 14:42:23,435 INFO L280 TraceCheckUtils]: 1: Hoare triple {431#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~one_modf~0 := 1.0; {408#true} is VALID [2020-07-10 14:42:23,435 INFO L280 TraceCheckUtils]: 2: Hoare triple {408#true} assume true; {408#true} is VALID [2020-07-10 14:42:23,435 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {408#true} {408#true} #170#return; {408#true} is VALID [2020-07-10 14:42:23,436 INFO L263 TraceCheckUtils]: 4: Hoare triple {408#true} call #t~ret24 := main(); {408#true} is VALID [2020-07-10 14:42:23,436 INFO L280 TraceCheckUtils]: 5: Hoare triple {408#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0);call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.allocOnStack(4);call write~init~real(#t~nondet17, ~#iptr~0.base, ~#iptr~0.offset, 4);havoc #t~nondet17; {408#true} is VALID [2020-07-10 14:42:23,450 INFO L263 TraceCheckUtils]: 6: Hoare triple {408#true} call #t~ret18 := modf_float(~x~0, ~#iptr~0.base, ~#iptr~0.offset); {432#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:23,450 INFO L280 TraceCheckUtils]: 7: Hoare triple {432#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset;havoc ~i0~0;havoc ~j0~0;havoc ~i~0; {408#true} is VALID [2020-07-10 14:42:23,451 INFO L280 TraceCheckUtils]: 8: Hoare triple {408#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~mem0;havoc #t~union1;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {408#true} is VALID [2020-07-10 14:42:23,451 INFO L280 TraceCheckUtils]: 9: Hoare triple {408#true} goto; {408#true} is VALID [2020-07-10 14:42:23,451 INFO L280 TraceCheckUtils]: 10: Hoare triple {408#true} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {408#true} is VALID [2020-07-10 14:42:23,452 INFO L280 TraceCheckUtils]: 11: Hoare triple {408#true} assume ~j0~0 < 23; {408#true} is VALID [2020-07-10 14:42:23,452 INFO L280 TraceCheckUtils]: 12: Hoare triple {408#true} assume ~j0~0 < 0; {408#true} is VALID [2020-07-10 14:42:23,452 INFO L280 TraceCheckUtils]: 13: Hoare triple {408#true} call ~#sf_u~0.base, ~#sf_u~0.offset := #Ultimate.allocOnStack(4);call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#sf_u~0.base, ~#sf_u~0.offset, 4);call #t~mem2 := read~real(~#sf_u~0.base, ~#sf_u~0.offset, 4);call write~real(#t~mem2, ~iptr.base, ~iptr.offset, 4);havoc #t~mem2;call ULTIMATE.dealloc(~#sf_u~0.base, ~#sf_u~0.offset);havoc ~#sf_u~0.base, ~#sf_u~0.offset; {408#true} is VALID [2020-07-10 14:42:23,453 INFO L280 TraceCheckUtils]: 14: Hoare triple {408#true} goto; {408#true} is VALID [2020-07-10 14:42:23,453 INFO L280 TraceCheckUtils]: 15: Hoare triple {408#true} #res := ~x; {408#true} is VALID [2020-07-10 14:42:23,453 INFO L280 TraceCheckUtils]: 16: Hoare triple {408#true} assume true; {408#true} is VALID [2020-07-10 14:42:23,453 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {408#true} {408#true} #164#return; {408#true} is VALID [2020-07-10 14:42:23,454 INFO L280 TraceCheckUtils]: 18: Hoare triple {408#true} ~res~0 := #t~ret18;havoc #t~ret18;call #t~mem19 := read~real(~#iptr~0.base, ~#iptr~0.offset, 4); {408#true} is VALID [2020-07-10 14:42:23,455 INFO L263 TraceCheckUtils]: 19: Hoare triple {408#true} call #t~ret20 := isinf_float(#t~mem19); {432#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:23,456 INFO L280 TraceCheckUtils]: 20: Hoare triple {432#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~ix~2; {408#true} is VALID [2020-07-10 14:42:23,456 INFO L280 TraceCheckUtils]: 21: Hoare triple {408#true} call ~#gf_u~4.base, ~#gf_u~4.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~4.base, ~#gf_u~4.offset, 4);call #t~mem15 := read~int(~#gf_u~4.base, ~#gf_u~4.offset, 4);~ix~2 := (if #t~mem15 % 4294967296 % 4294967296 <= 2147483647 then #t~mem15 % 4294967296 % 4294967296 else #t~mem15 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union16, ~#gf_u~4.base, ~#gf_u~4.offset, 4);havoc #t~mem15;havoc #t~union16;call ULTIMATE.dealloc(~#gf_u~4.base, ~#gf_u~4.offset);havoc ~#gf_u~4.base, ~#gf_u~4.offset; {408#true} is VALID [2020-07-10 14:42:23,456 INFO L280 TraceCheckUtils]: 22: Hoare triple {408#true} goto; {408#true} is VALID [2020-07-10 14:42:23,457 INFO L280 TraceCheckUtils]: 23: Hoare triple {408#true} ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647);#res := (if 2139095040 == ~ix~2 then 1 else 0); {408#true} is VALID [2020-07-10 14:42:23,457 INFO L280 TraceCheckUtils]: 24: Hoare triple {408#true} assume true; {408#true} is VALID [2020-07-10 14:42:23,457 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {408#true} {408#true} #166#return; {408#true} is VALID [2020-07-10 14:42:23,457 INFO L280 TraceCheckUtils]: 26: Hoare triple {408#true} assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647;#t~short23 := 0 != #t~ret20; {408#true} is VALID [2020-07-10 14:42:23,459 INFO L280 TraceCheckUtils]: 27: Hoare triple {408#true} assume !#t~short23; {430#(not |main_#t~short23|)} is VALID [2020-07-10 14:42:23,461 INFO L280 TraceCheckUtils]: 28: Hoare triple {430#(not |main_#t~short23|)} assume #t~short23;havoc #t~mem19;havoc #t~ret21;havoc #t~short23;havoc #t~ret20;havoc #t~short22; {409#false} is VALID [2020-07-10 14:42:23,461 INFO L280 TraceCheckUtils]: 29: Hoare triple {409#false} assume !false; {409#false} is VALID [2020-07-10 14:42:23,463 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-10 14:42:23,463 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826400587] [2020-07-10 14:42:23,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:42:23,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 14:42:23,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48163829] [2020-07-10 14:42:23,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-10 14:42:23,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:23,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 14:42:23,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:23,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 14:42:23,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:23,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 14:42:23,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:42:23,505 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 5 states. [2020-07-10 14:42:24,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:24,040 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2020-07-10 14:42:24,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 14:42:24,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-10 14:42:24,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:24,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:42:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2020-07-10 14:42:24,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:42:24,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2020-07-10 14:42:24,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2020-07-10 14:42:24,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:24,154 INFO L225 Difference]: With dead ends: 58 [2020-07-10 14:42:24,154 INFO L226 Difference]: Without dead ends: 55 [2020-07-10 14:42:24,155 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-10 14:42:24,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-10 14:42:24,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-10 14:42:24,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:24,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2020-07-10 14:42:24,191 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-10 14:42:24,191 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-10 14:42:24,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:24,195 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2020-07-10 14:42:24,195 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-07-10 14:42:24,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:24,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:24,196 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-10 14:42:24,196 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-10 14:42:24,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:24,201 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2020-07-10 14:42:24,201 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-07-10 14:42:24,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:24,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:24,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:24,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:24,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-10 14:42:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2020-07-10 14:42:24,206 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 30 [2020-07-10 14:42:24,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:24,206 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2020-07-10 14:42:24,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 14:42:24,207 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-07-10 14:42:24,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-10 14:42:24,208 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:24,208 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] [2020-07-10 14:42:24,208 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 14:42:24,209 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:24,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:24,209 INFO L82 PathProgramCache]: Analyzing trace with hash 2060718957, now seen corresponding path program 1 times [2020-07-10 14:42:24,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:24,210 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89417077] [2020-07-10 14:42:24,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:42:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:42:24,456 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 14:42:24,456 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 14:42:24,456 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 14:42:24,495 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 14:42:24,496 WARN L170 areAnnotationChecker]: isinf_floatENTRY has no Hoare annotation [2020-07-10 14:42:24,496 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 14:42:24,496 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 14:42:24,496 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 14:42:24,496 WARN L170 areAnnotationChecker]: modf_floatENTRY has no Hoare annotation [2020-07-10 14:42:24,496 WARN L170 areAnnotationChecker]: __signbit_floatENTRY has no Hoare annotation [2020-07-10 14:42:24,496 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 14:42:24,497 WARN L170 areAnnotationChecker]: L88-2 has no Hoare annotation [2020-07-10 14:42:24,497 WARN L170 areAnnotationChecker]: L88-2 has no Hoare annotation [2020-07-10 14:42:24,497 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 14:42:24,497 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 14:42:24,497 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2020-07-10 14:42:24,497 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2020-07-10 14:42:24,497 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2020-07-10 14:42:24,497 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2020-07-10 14:42:24,498 WARN L170 areAnnotationChecker]: L76-2 has no Hoare annotation [2020-07-10 14:42:24,498 WARN L170 areAnnotationChecker]: L76-2 has no Hoare annotation [2020-07-10 14:42:24,498 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:42:24,498 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2020-07-10 14:42:24,498 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2020-07-10 14:42:24,498 WARN L170 areAnnotationChecker]: L88-3 has no Hoare annotation [2020-07-10 14:42:24,498 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:42:24,498 WARN L170 areAnnotationChecker]: L106-1 has no Hoare annotation [2020-07-10 14:42:24,499 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-10 14:42:24,499 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-10 14:42:24,499 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-10 14:42:24,499 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2020-07-10 14:42:24,499 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2020-07-10 14:42:24,499 WARN L170 areAnnotationChecker]: L76-3 has no Hoare annotation [2020-07-10 14:42:24,499 WARN L170 areAnnotationChecker]: isinf_floatFINAL has no Hoare annotation [2020-07-10 14:42:24,500 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2020-07-10 14:42:24,500 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2020-07-10 14:42:24,500 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 14:42:24,500 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 14:42:24,500 WARN L170 areAnnotationChecker]: __signbit_floatFINAL has no Hoare annotation [2020-07-10 14:42:24,500 WARN L170 areAnnotationChecker]: isinf_floatEXIT has no Hoare annotation [2020-07-10 14:42:24,500 WARN L170 areAnnotationChecker]: L109-1 has no Hoare annotation [2020-07-10 14:42:24,500 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 14:42:24,501 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 14:42:24,501 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2020-07-10 14:42:24,501 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2020-07-10 14:42:24,501 WARN L170 areAnnotationChecker]: __signbit_floatEXIT has no Hoare annotation [2020-07-10 14:42:24,501 WARN L170 areAnnotationChecker]: L109-2 has no Hoare annotation [2020-07-10 14:42:24,501 WARN L170 areAnnotationChecker]: L109-2 has no Hoare annotation [2020-07-10 14:42:24,501 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2020-07-10 14:42:24,501 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2020-07-10 14:42:24,502 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 14:42:24,502 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 14:42:24,502 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2020-07-10 14:42:24,502 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2020-07-10 14:42:24,502 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2020-07-10 14:42:24,502 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2020-07-10 14:42:24,502 WARN L170 areAnnotationChecker]: L109-5 has no Hoare annotation [2020-07-10 14:42:24,502 WARN L170 areAnnotationChecker]: L109-3 has no Hoare annotation [2020-07-10 14:42:24,503 WARN L170 areAnnotationChecker]: L109-3 has no Hoare annotation [2020-07-10 14:42:24,503 WARN L170 areAnnotationChecker]: L109-9 has no Hoare annotation [2020-07-10 14:42:24,503 WARN L170 areAnnotationChecker]: L109-9 has no Hoare annotation [2020-07-10 14:42:24,503 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2020-07-10 14:42:24,503 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2020-07-10 14:42:24,503 WARN L170 areAnnotationChecker]: L25-3 has no Hoare annotation [2020-07-10 14:42:24,503 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2020-07-10 14:42:24,503 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2020-07-10 14:42:24,504 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2020-07-10 14:42:24,504 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2020-07-10 14:42:24,504 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-10 14:42:24,504 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-10 14:42:24,504 WARN L170 areAnnotationChecker]: L64-2 has no Hoare annotation [2020-07-10 14:42:24,504 WARN L170 areAnnotationChecker]: L109-7 has no Hoare annotation [2020-07-10 14:42:24,504 WARN L170 areAnnotationChecker]: L109-4 has no Hoare annotation [2020-07-10 14:42:24,504 WARN L170 areAnnotationChecker]: L109-4 has no Hoare annotation [2020-07-10 14:42:24,504 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2020-07-10 14:42:24,505 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2020-07-10 14:42:24,505 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 14:42:24,505 WARN L170 areAnnotationChecker]: modf_floatFINAL has no Hoare annotation [2020-07-10 14:42:24,505 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2020-07-10 14:42:24,505 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2020-07-10 14:42:24,505 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2020-07-10 14:42:24,505 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2020-07-10 14:42:24,505 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2020-07-10 14:42:24,506 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2020-07-10 14:42:24,506 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2020-07-10 14:42:24,506 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 14:42:24,506 WARN L170 areAnnotationChecker]: modf_floatEXIT has no Hoare annotation [2020-07-10 14:42:24,506 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-10 14:42:24,506 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-10 14:42:24,506 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2020-07-10 14:42:24,506 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 14:42:24,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 02:42:24 BoogieIcfgContainer [2020-07-10 14:42:24,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 14:42:24,513 INFO L168 Benchmark]: Toolchain (without parser) took 4239.63 ms. Allocated memory was 136.3 MB in the beginning and 253.2 MB in the end (delta: 116.9 MB). Free memory was 101.1 MB in the beginning and 90.8 MB in the end (delta: 10.3 MB). Peak memory consumption was 127.2 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:24,514 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 14:42:24,515 INFO L168 Benchmark]: CACSL2BoogieTranslator took 526.20 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 100.9 MB in the beginning and 177.0 MB in the end (delta: -76.0 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:24,516 INFO L168 Benchmark]: Boogie Preprocessor took 127.58 ms. Allocated memory is still 200.3 MB. Free memory was 177.0 MB in the beginning and 173.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:24,516 INFO L168 Benchmark]: RCFGBuilder took 882.00 ms. Allocated memory is still 200.3 MB. Free memory was 173.2 MB in the beginning and 127.2 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:24,517 INFO L168 Benchmark]: TraceAbstraction took 2696.89 ms. Allocated memory was 200.3 MB in the beginning and 253.2 MB in the end (delta: 53.0 MB). Free memory was 127.2 MB in the beginning and 90.8 MB in the end (delta: 36.3 MB). Peak memory consumption was 89.3 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:24,521 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.21 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 526.20 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 100.9 MB in the beginning and 177.0 MB in the end (delta: -76.0 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.58 ms. Allocated memory is still 200.3 MB. Free memory was 177.0 MB in the beginning and 173.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 882.00 ms. Allocated memory is still 200.3 MB. Free memory was 173.2 MB in the beginning and 127.2 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2696.89 ms. Allocated memory was 200.3 MB in the beginning and 253.2 MB in the end (delta: 53.0 MB). Free memory was 127.2 MB in the beginning and 90.8 MB in the end (delta: 36.3 MB). Peak memory consumption was 89.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 110]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryArithmeticFLOAToperation at line 104, overapproximation of bitwiseAnd at line 93. Possible FailurePath: [L12] static const float one_modf = 1.0; VAL [\old(one_modf)=12884901894, one_modf=1] [L104] float x = -1.0f / 0.0f; [L105] float iptr = __VERIFIER_nondet_float(); [L106] CALL, EXPR modf_float(x, &iptr) VAL [\old(x)=12884901891, iptr={3:0}, one_modf=1] [L15] __int32_t i0, j0; [L16] __uint32_t i; VAL [\old(x)=12884901891, iptr={3:0}, iptr={3:0}, one_modf=1, x=12884901891] [L18] ieee_float_shape_type gf_u; [L19] gf_u.value = (x) [L20] EXPR gf_u.word [L20] (i0) = gf_u.word [L22] j0 = ((i0 >> 23) & 0xff) - 0x7f VAL [\old(x)=12884901891, i0=-1, iptr={3:0}, iptr={3:0}, one_modf=1, x=12884901891] [L23] COND TRUE j0 < 23 VAL [\old(x)=12884901891, i0=-1, iptr={3:0}, iptr={3:0}, j0=-1, one_modf=1, x=12884901891] [L24] COND TRUE j0 < 0 VAL [\old(x)=12884901891, i0=-1, iptr={3:0}, iptr={3:0}, j0=-1, one_modf=1, x=12884901891] [L26] ieee_float_shape_type sf_u; [L27] sf_u.word = (i0 & 0x80000000) [L28] EXPR sf_u.value [L28] (*iptr) = sf_u.value [L30] return x; VAL [\old(x)=12884901891, \result=12884901891, i0=-1, iptr={3:0}, iptr={3:0}, j0=-1, one_modf=1, x=12884901891] [L106] RET, EXPR modf_float(x, &iptr) VAL [iptr={3:0}, modf_float(x, &iptr)=12884901891, one_modf=1, x=12884901891] [L106] float res = modf_float(x, &iptr); [L109] EXPR \read(iptr) VAL [\read(iptr)=12884901893, iptr={3:0}, one_modf=1, res=12884901891, x=12884901891] [L109] CALL, EXPR isinf_float(iptr) VAL [\old(x)=12884901893, one_modf=1] [L87] __int32_t ix; VAL [\old(x)=12884901893, one_modf=1, x=12884901893] [L89] ieee_float_shape_type gf_u; [L90] gf_u.value = (x) [L91] EXPR gf_u.word [L91] (ix) = gf_u.word [L93] ix &= 0x7fffffff [L94] return ((ix) == 0x7f800000L); VAL [\old(x)=12884901893, \result=1, ix=2139095040, one_modf=1, x=12884901893] [L109] RET, EXPR isinf_float(iptr) VAL [\read(iptr)=12884901893, iptr={3:0}, isinf_float(iptr)=1, one_modf=1, res=12884901891, x=12884901891] [L109] isinf_float(iptr) && !(res == -0.0f && __signbit_float(res) == 1) [L109] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [\read(iptr)=12884901893, iptr={3:0}, isinf_float(iptr)=1, isinf_float(iptr) && !(res == -0.0f && __signbit_float(res) == 1)=1, one_modf=1, res=12884901891, res == -0.0f && __signbit_float(res) == 1=0, x=12884901891] [L109] isinf_float(iptr) && !(res == -0.0f && __signbit_float(res) == 1) VAL [\read(iptr)=12884901893, iptr={3:0}, isinf_float(iptr)=1, isinf_float(iptr) && !(res == -0.0f && __signbit_float(res) == 1)=1, one_modf=1, res=12884901891, res == -0.0f && __signbit_float(res) == 1=0, x=12884901891] [L109] COND TRUE isinf_float(iptr) && !(res == -0.0f && __signbit_float(res) == 1) [L110] __VERIFIER_error() VAL [iptr={3:0}, one_modf=1, res=12884901891, x=12884901891] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2.5s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 100 SDtfs, 62 SDslu, 44 SDs, 0 SdLazy, 180 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 3526 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...