/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1270c_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 40ef5092 Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1270c_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fce8eaffc8fbce8eaab4a2e551ea29a4fcef0871 ................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1270c_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fce8eaffc8fbce8eaab4a2e551ea29a4fcef0871 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-40ef509 [2018-09-20 15:31:58,125 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:31:58,127 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:31:58,147 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:31:58,148 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:31:58,149 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:31:58,151 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:31:58,152 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:31:58,155 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:31:58,156 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:31:58,157 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:31:58,158 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:31:58,159 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:31:58,159 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:31:58,161 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:31:58,161 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:31:58,162 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:31:58,164 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:31:58,166 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:31:58,167 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:31:58,169 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:31:58,170 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:31:58,172 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:31:58,173 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:31:58,173 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:31:58,174 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:31:58,175 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:31:58,176 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:31:58,176 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:31:58,177 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:31:58,178 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:31:58,178 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:31:58,179 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:31:58,179 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:31:58,180 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:31:58,181 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:31:58,181 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-20 15:31:58,200 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:31:58,200 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:31:58,201 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:31:58,201 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:31:58,202 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:31:58,202 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:31:58,202 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:31:58,202 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:31:58,203 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:31:58,203 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-20 15:31:58,203 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:31:58,203 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:31:58,203 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:31:58,203 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:31:58,204 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:31:58,204 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:31:58,204 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:31:58,204 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:31:58,204 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:31:58,204 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:31:58,205 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:31:58,205 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:31:58,205 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:31:58,205 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:31:58,205 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:31:58,205 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:31:58,206 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-20 15:31:58,206 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:31:58,206 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-20 15:31:58,206 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fce8eaffc8fbce8eaab4a2e551ea29a4fcef0871 [2018-09-20 15:31:58,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:31:58,278 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:31:58,284 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:31:58,286 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:31:58,287 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:31:58,288 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1270c_true-unreach-call.c [2018-09-20 15:31:58,639 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3e9be208/bf42a21a1a814092b32ded6c990deada/FLAG565b987ed [2018-09-20 15:31:58,793 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:31:58,794 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1270c_true-unreach-call.c [2018-09-20 15:31:58,805 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3e9be208/bf42a21a1a814092b32ded6c990deada/FLAG565b987ed [2018-09-20 15:31:58,827 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3e9be208/bf42a21a1a814092b32ded6c990deada [2018-09-20 15:31:58,830 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:31:58,833 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:31:58,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:31:58,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:31:58,843 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:31:58,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:31:58" (1/1) ... [2018-09-20 15:31:58,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c5968c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:58, skipping insertion in model container [2018-09-20 15:31:58,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:31:58" (1/1) ... [2018-09-20 15:31:58,862 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:31:59,179 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:31:59,199 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:31:59,288 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:31:59,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:59 WrapperNode [2018-09-20 15:31:59,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:31:59,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:31:59,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:31:59,356 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:31:59,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:59" (1/1) ... [2018-09-20 15:31:59,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:59" (1/1) ... [2018-09-20 15:31:59,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:59" (1/1) ... [2018-09-20 15:31:59,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:59" (1/1) ... [2018-09-20 15:31:59,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:59" (1/1) ... [2018-09-20 15:31:59,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:59" (1/1) ... [2018-09-20 15:31:59,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:59" (1/1) ... [2018-09-20 15:31:59,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:31:59,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:31:59,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:31:59,460 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:31:59,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:31:59,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:31:59,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:31:59,665 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2018-09-20 15:31:59,665 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_hypotf [2018-09-20 15:31:59,666 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2018-09-20 15:31:59,666 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:31:59,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:31:59,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-09-20 15:31:59,666 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2018-09-20 15:31:59,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:31:59,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-09-20 15:31:59,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-09-20 15:31:59,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:31:59,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-09-20 15:31:59,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-09-20 15:31:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_hypotf [2018-09-20 15:31:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2018-09-20 15:31:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:31:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:31:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:31:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2018-09-20 15:31:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-09-20 15:32:01,051 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:32:01,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:32:01 BoogieIcfgContainer [2018-09-20 15:32:01,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:32:01,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:32:01,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:32:01,061 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:32:01,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:31:58" (1/3) ... [2018-09-20 15:32:01,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5daba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:32:01, skipping insertion in model container [2018-09-20 15:32:01,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:59" (2/3) ... [2018-09-20 15:32:01,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5daba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:32:01, skipping insertion in model container [2018-09-20 15:32:01,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:32:01" (3/3) ... [2018-09-20 15:32:01,065 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270c_true-unreach-call.c [2018-09-20 15:32:01,075 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:32:01,085 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 15:32:01,135 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:32:01,136 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:32:01,136 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:32:01,136 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:32:01,137 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:32:01,137 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:32:01,137 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:32:01,137 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:32:01,137 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:32:01,169 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states. [2018-09-20 15:32:01,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-20 15:32:01,180 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:01,181 INFO L376 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] [2018-09-20 15:32:01,185 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:01,190 INFO L82 PathProgramCache]: Analyzing trace with hash 2013009825, now seen corresponding path program 1 times [2018-09-20 15:32:01,193 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:32:01,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:32:01,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:32:01,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:01,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:32:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:01,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:32:01,349 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:01,350 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:32:01,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:32:01,379 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:32:01,380 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:32:01,382 INFO L87 Difference]: Start difference. First operand 232 states. Second operand 2 states. [2018-09-20 15:32:01,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:01,455 INFO L93 Difference]: Finished difference Result 456 states and 573 transitions. [2018-09-20 15:32:01,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:32:01,457 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 28 [2018-09-20 15:32:01,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:01,474 INFO L225 Difference]: With dead ends: 456 [2018-09-20 15:32:01,474 INFO L226 Difference]: Without dead ends: 228 [2018-09-20 15:32:01,484 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:32:01,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-09-20 15:32:01,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-09-20 15:32:01,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-09-20 15:32:01,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 250 transitions. [2018-09-20 15:32:01,549 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 250 transitions. Word has length 28 [2018-09-20 15:32:01,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:01,549 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 250 transitions. [2018-09-20 15:32:01,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:32:01,550 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 250 transitions. [2018-09-20 15:32:01,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-20 15:32:01,554 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:01,554 INFO L376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:01,555 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:01,555 INFO L82 PathProgramCache]: Analyzing trace with hash 237649631, now seen corresponding path program 1 times [2018-09-20 15:32:01,556 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:32:01,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:32:01,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:32:01,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:01,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:32:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:32:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:32:01,844 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-20 15:32:01,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 03:32:01 BoogieIcfgContainer [2018-09-20 15:32:01,941 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 15:32:01,941 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 15:32:01,941 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 15:32:01,942 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 15:32:01,942 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:32:01" (3/4) ... [2018-09-20 15:32:01,949 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-09-20 15:32:01,949 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 15:32:01,950 INFO L168 Benchmark]: Toolchain (without parser) took 3118.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 953.2 MB in the beginning and 1.0 GB in the end (delta: -95.5 MB). Peak memory consumption was 57.6 MB. Max. memory is 11.5 GB. [2018-09-20 15:32:01,952 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:32:01,953 INFO L168 Benchmark]: CACSL2BoogieTranslator took 520.41 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-09-20 15:32:01,954 INFO L168 Benchmark]: Boogie Preprocessor took 103.94 ms. Allocated memory is still 1.0 GB. Free memory was 937.1 MB in the beginning and 931.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:32:01,955 INFO L168 Benchmark]: RCFGBuilder took 1591.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 931.7 MB in the beginning and 1.1 GB in the end (delta: -152.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2018-09-20 15:32:01,957 INFO L168 Benchmark]: TraceAbstraction took 887.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 11.5 GB. [2018-09-20 15:32:01,958 INFO L168 Benchmark]: Witness Printer took 7.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:32:01,966 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 520.41 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 103.94 ms. Allocated memory is still 1.0 GB. Free memory was 937.1 MB in the beginning and 931.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1591.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 931.7 MB in the beginning and 1.1 GB in the end (delta: -152.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 887.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 11.5 GB. * Witness Printer took 7.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 235]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryArithmeticFLOAToperation at line 118, overapproximation of bitwiseAnd at line 218. Possible FailurePath: [L12] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; VAL [\old(one_sqrt)=10737418247, \old(tiny_sqrt)=10737418252, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L229] float x = __VERIFIER_nondet_float(); [L230] float y = 1.0f / 0.0f; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244] [L232] CALL, EXPR __ieee754_hypotf(x, y) VAL [\old(x)=10737418244, \old(y)=10737418245, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L82] float a = x, b = y, t1, t2, y1, y2, w; [L82] float a = x, b = y, t1, t2, y1, y2, w; [L82] float a = x, b = y, t1, t2, y1, y2, w; [L83] __int32_t j, k, ha, hb; VAL [\old(x)=10737418244, \old(y)=10737418245, a=10737418244, b=10737418245, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L86] FCALL ieee_float_shape_type gf_u; VAL [\old(x)=10737418244, \old(y)=10737418245, a=10737418244, b=10737418245, gf_u={10737418250:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L87] FCALL gf_u.value = (x) VAL [\old(x)=10737418244, \old(y)=10737418245, a=10737418244, b=10737418245, gf_u={10737418250:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L88] EXPR, FCALL gf_u.word VAL [\old(x)=10737418244, \old(y)=10737418245, a=10737418244, b=10737418245, gf_u={10737418250:0}, gf_u.word=6442450944, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L88] (ha) = gf_u.word VAL [\old(x)=10737418244, \old(y)=10737418245, a=10737418244, b=10737418245, gf_u={10737418250:0}, gf_u.word=6442450944, ha=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L88] FCALL (ha) = gf_u.word VAL [(ha) = gf_u.word=10737418248, \old(x)=10737418244, \old(y)=10737418245, a=10737418244, b=10737418245, gf_u={10737418250:0}, gf_u.word=6442450944, ha=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L89] COND FALSE !(0) VAL [\old(x)=10737418244, \old(y)=10737418245, a=10737418244, b=10737418245, ha=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L90] ha &= 0x7fffffffL VAL [\old(x)=10737418244, \old(y)=10737418245, a=10737418244, b=10737418245, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L92] FCALL ieee_float_shape_type gf_u; VAL [\old(x)=10737418244, \old(y)=10737418245, a=10737418244, b=10737418245, gf_u={10737418255:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L93] FCALL gf_u.value = (y) VAL [\old(x)=10737418244, \old(y)=10737418245, a=10737418244, b=10737418245, gf_u={10737418255:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L94] EXPR, FCALL gf_u.word VAL [\old(x)=10737418244, \old(y)=10737418245, a=10737418244, b=10737418245, gf_u={10737418255:0}, gf_u.word=10737418240, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L94] (hb) = gf_u.word VAL [\old(x)=10737418244, \old(y)=10737418245, a=10737418244, b=10737418245, gf_u={10737418255:0}, gf_u.word=10737418240, hb=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L94] FCALL (hb) = gf_u.word VAL [(hb) = gf_u.word=10737418256, \old(x)=10737418244, \old(y)=10737418245, a=10737418244, b=10737418245, gf_u={10737418255:0}, gf_u.word=10737418240, hb=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L95] COND FALSE !(0) VAL [\old(x)=10737418244, \old(y)=10737418245, a=10737418244, b=10737418245, hb=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L96] hb &= 0x7fffffffL VAL [\old(x)=10737418244, \old(y)=10737418245, a=10737418244, b=10737418245, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L97] COND TRUE hb > ha [L98] a = y [L99] b = x [L100] j = ha [L101] ha = hb [L102] hb = j VAL [\old(x)=10737418244, \old(y)=10737418245, a=10737418245, b=10737418244, ha=251658240, hb=-1, j=-1, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L108] FCALL ieee_float_shape_type sf_u; VAL [\old(x)=10737418244, \old(y)=10737418245, a=10737418245, b=10737418244, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418246:0}, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L109] FCALL sf_u.word = (ha) VAL [\old(x)=10737418244, \old(y)=10737418245, a=10737418245, b=10737418244, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418246:0}, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L110] EXPR, FCALL sf_u.value VAL [\old(x)=10737418244, \old(y)=10737418245, a=10737418245, b=10737418244, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418246:0}, sf_u.value=10737418257, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L110] (a) = sf_u.value VAL [\old(x)=10737418244, \old(y)=10737418245, a=10737418257, b=10737418244, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418246:0}, sf_u.value=10737418257, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L110] FCALL (a) = sf_u.value VAL [(a) = sf_u.value=10737418254, \old(x)=10737418244, \old(y)=10737418245, a=10737418257, b=10737418244, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418246:0}, sf_u.value=10737418257, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L111] COND FALSE !(0) VAL [\old(x)=10737418244, \old(y)=10737418245, a=10737418257, b=10737418244, ha=251658240, hb=-1, j=-1, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L113] FCALL ieee_float_shape_type sf_u; VAL [\old(x)=10737418244, \old(y)=10737418245, a=10737418257, b=10737418244, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418255:0}, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L114] FCALL sf_u.word = (hb) VAL [\old(x)=10737418244, \old(y)=10737418245, a=10737418257, b=10737418244, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418255:0}, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L115] EXPR, FCALL sf_u.value VAL [\old(x)=10737418244, \old(y)=10737418245, a=10737418257, b=10737418244, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418255:0}, sf_u.value=10737418256, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L115] (b) = sf_u.value VAL [\old(x)=10737418244, \old(y)=10737418245, a=10737418257, b=10737418256, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418255:0}, sf_u.value=10737418256, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L115] FCALL (b) = sf_u.value VAL [(b) = sf_u.value=10737418253, \old(x)=10737418244, \old(y)=10737418245, a=10737418257, b=10737418256, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418255:0}, sf_u.value=10737418256, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L116] COND FALSE !(0) VAL [\old(x)=10737418244, \old(y)=10737418245, a=10737418257, b=10737418256, ha=251658240, hb=-1, j=-1, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L117] COND TRUE (ha - hb) > 0xf000000L [L118] RET return a + b; VAL [\old(x)=10737418244, \old(y)=10737418245, a=10737418257, b=10737418256, ha=251658240, hb=-1, j=-1, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L232] EXPR __ieee754_hypotf(x, y) VAL [__ieee754_hypotf(x, y)=10737418241, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L232] float res = __ieee754_hypotf(x, y); [L234] CALL, EXPR isinf_float(res) VAL [\old(x)=10737418241, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L212] __int32_t ix; VAL [\old(x)=10737418241, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418241] [L214] FCALL ieee_float_shape_type gf_u; VAL [\old(x)=10737418241, gf_u={10737418243:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418241] [L215] FCALL gf_u.value = (x) VAL [\old(x)=10737418241, gf_u={10737418243:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418241] [L216] EXPR, FCALL gf_u.word VAL [\old(x)=10737418241, gf_u={10737418243:0}, gf_u.word=-6442450944, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418241] [L216] (ix) = gf_u.word VAL [\old(x)=10737418241, gf_u={10737418243:0}, gf_u.word=-6442450944, ix=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418241] [L216] FCALL (ix) = gf_u.word VAL [(ix) = gf_u.word=10737418251, \old(x)=10737418241, gf_u={10737418243:0}, gf_u.word=-6442450944, ix=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418241] [L217] COND FALSE !(0) VAL [\old(x)=10737418241, ix=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418241] [L218] ix &= 0x7fffffff [L219] RET return ((ix) == 0x7f800000L); VAL [\old(x)=10737418241, \result=0, ix=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418241] [L234] EXPR isinf_float(res) VAL [isinf_float(res)=0, one_sqrt=1, res=10737418241, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] [L234] COND TRUE !isinf_float(res) [L235] __VERIFIER_error() VAL [one_sqrt=1, res=10737418241, tiny_sqrt=1/1000000000000000000000000000000, x=10737418244, y=10737418245] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 232 locations, 1 error locations. UNSAFE Result, 0.8s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 254 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 729 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-40ef509 [2018-09-20 15:32:04,420 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:32:04,422 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:32:04,436 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:32:04,437 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:32:04,438 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:32:04,439 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:32:04,441 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:32:04,444 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:32:04,446 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:32:04,449 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:32:04,449 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:32:04,451 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:32:04,454 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:32:04,463 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:32:04,464 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:32:04,465 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:32:04,466 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:32:04,471 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:32:04,474 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:32:04,477 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:32:04,479 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:32:04,483 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:32:04,485 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:32:04,486 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:32:04,487 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:32:04,488 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:32:04,489 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:32:04,489 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:32:04,492 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:32:04,493 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:32:04,494 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:32:04,495 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:32:04,496 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:32:04,497 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:32:04,499 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:32:04,502 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-20 15:32:04,528 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:32:04,529 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:32:04,530 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:32:04,533 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:32:04,533 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:32:04,534 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:32:04,534 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:32:04,534 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:32:04,534 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:32:04,536 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:32:04,536 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:32:04,536 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:32:04,536 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:32:04,537 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:32:04,537 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-20 15:32:04,537 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-20 15:32:04,538 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:32:04,538 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:32:04,538 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:32:04,538 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:32:04,538 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:32:04,539 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:32:04,539 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:32:04,539 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:32:04,539 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:32:04,539 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:32:04,542 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:32:04,542 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-20 15:32:04,542 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:32:04,542 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-20 15:32:04,542 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-20 15:32:04,543 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fce8eaffc8fbce8eaab4a2e551ea29a4fcef0871 [2018-09-20 15:32:04,606 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:32:04,632 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:32:04,639 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:32:04,641 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:32:04,642 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:32:04,642 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1270c_true-unreach-call.c [2018-09-20 15:32:05,010 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c11927c80/0a57275c2226449092e3998fbf32d223/FLAGd4955cc2f [2018-09-20 15:32:05,203 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:32:05,204 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1270c_true-unreach-call.c [2018-09-20 15:32:05,215 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c11927c80/0a57275c2226449092e3998fbf32d223/FLAGd4955cc2f [2018-09-20 15:32:05,230 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c11927c80/0a57275c2226449092e3998fbf32d223 [2018-09-20 15:32:05,234 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:32:05,237 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:32:05,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:32:05,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:32:05,246 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:32:05,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:32:05" (1/1) ... [2018-09-20 15:32:05,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ed58eea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:05, skipping insertion in model container [2018-09-20 15:32:05,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:32:05" (1/1) ... [2018-09-20 15:32:05,264 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:32:05,559 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:32:05,580 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:32:05,646 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:32:05,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:05 WrapperNode [2018-09-20 15:32:05,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:32:05,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:32:05,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:32:05,715 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:32:05,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:05" (1/1) ... [2018-09-20 15:32:05,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:05" (1/1) ... [2018-09-20 15:32:05,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:05" (1/1) ... [2018-09-20 15:32:05,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:05" (1/1) ... [2018-09-20 15:32:05,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:05" (1/1) ... [2018-09-20 15:32:05,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:05" (1/1) ... [2018-09-20 15:32:05,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:05" (1/1) ... [2018-09-20 15:32:05,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:32:05,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:32:05,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:32:05,787 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:32:05,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:32:05,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:32:05,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:32:05,932 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2018-09-20 15:32:05,932 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_hypotf [2018-09-20 15:32:05,932 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2018-09-20 15:32:05,932 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:32:05,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:32:05,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-09-20 15:32:05,933 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2018-09-20 15:32:05,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:32:05,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-09-20 15:32:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-20 15:32:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:32:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-20 15:32:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-09-20 15:32:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_hypotf [2018-09-20 15:32:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2018-09-20 15:32:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:32:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:32:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:32:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4 [2018-09-20 15:32:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-20 15:32:06,308 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:32:06,329 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:32:06,408 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:32:06,418 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:32:06,459 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:32:06,470 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:32:07,544 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:32:07,552 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:32:08,355 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:32:08,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:32:08 BoogieIcfgContainer [2018-09-20 15:32:08,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:32:08,357 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:32:08,357 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:32:08,361 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:32:08,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:32:05" (1/3) ... [2018-09-20 15:32:08,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33790214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:32:08, skipping insertion in model container [2018-09-20 15:32:08,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:05" (2/3) ... [2018-09-20 15:32:08,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33790214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:32:08, skipping insertion in model container [2018-09-20 15:32:08,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:32:08" (3/3) ... [2018-09-20 15:32:08,365 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270c_true-unreach-call.c [2018-09-20 15:32:08,376 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:32:08,385 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 15:32:08,438 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:32:08,439 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:32:08,439 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:32:08,439 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:32:08,439 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:32:08,440 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:32:08,440 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:32:08,440 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:32:08,440 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:32:08,465 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states. [2018-09-20 15:32:08,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-20 15:32:08,476 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:08,477 INFO L376 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] [2018-09-20 15:32:08,480 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:08,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1998677788, now seen corresponding path program 1 times [2018-09-20 15:32:08,492 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:08,493 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:08,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:08,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:32:08,622 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:08,638 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:08,638 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:32:08,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:32:08,655 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:32:08,655 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:32:08,658 INFO L87 Difference]: Start difference. First operand 231 states. Second operand 2 states. [2018-09-20 15:32:08,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:08,714 INFO L93 Difference]: Finished difference Result 454 states and 571 transitions. [2018-09-20 15:32:08,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:32:08,716 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-09-20 15:32:08,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:08,732 INFO L225 Difference]: With dead ends: 454 [2018-09-20 15:32:08,732 INFO L226 Difference]: Without dead ends: 227 [2018-09-20 15:32:08,739 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:32:08,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-09-20 15:32:08,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-09-20 15:32:08,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-20 15:32:08,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 249 transitions. [2018-09-20 15:32:08,835 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 249 transitions. Word has length 27 [2018-09-20 15:32:08,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:08,836 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 249 transitions. [2018-09-20 15:32:08,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:32:08,836 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 249 transitions. [2018-09-20 15:32:08,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-20 15:32:08,841 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:08,841 INFO L376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:08,841 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:08,842 INFO L82 PathProgramCache]: Analyzing trace with hash -711257081, now seen corresponding path program 1 times [2018-09-20 15:32:08,843 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:08,843 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:08,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:09,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:09,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:32:09,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:09,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:09,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:09,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:32:09,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:27 [2018-09-20 15:32:09,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:32:09,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:09,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:09,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:09,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:32:09,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:15 [2018-09-20 15:32:10,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:32:10,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:10,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:10,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:10,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-20 15:32:10,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2018-09-20 15:32:10,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:32:10,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:10,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:10,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:10,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-20 15:32:10,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:29 [2018-09-20 15:32:10,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:32:10,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:10,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:10,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:10,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-20 15:32:10,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:36 [2018-09-20 15:32:10,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:32:10,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:10,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:10,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:11,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-20 15:32:11,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:57, output treesize:38 [2018-09-20 15:32:14,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:32:14,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:14,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:14,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:14,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:14,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:14,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:32:14,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:14,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:14,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:14,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:14,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:15,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:32:15,943 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:15,954 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:15,955 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-09-20 15:32:15,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-20 15:32:15,957 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-20 15:32:15,958 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-09-20 15:32:15,959 INFO L87 Difference]: Start difference. First operand 227 states and 249 transitions. Second operand 25 states. [2018-09-20 15:32:19,185 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-20 15:32:19,694 WARN L178 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-09-20 15:32:20,260 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-09-20 15:32:20,638 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2018-09-20 15:32:21,117 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-20 15:32:21,697 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-09-20 15:32:22,232 WARN L178 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-09-20 15:32:22,877 WARN L178 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-09-20 15:32:23,249 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-20 15:32:32,335 WARN L178 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2018-09-20 15:32:37,351 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-20 15:32:40,609 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-20 15:32:52,866 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-09-20 15:33:27,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:33:27,105 INFO L93 Difference]: Finished difference Result 437 states and 482 transitions. [2018-09-20 15:33:27,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-20 15:33:27,167 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 72 [2018-09-20 15:33:27,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:33:27,175 INFO L225 Difference]: With dead ends: 437 [2018-09-20 15:33:27,175 INFO L226 Difference]: Without dead ends: 430 [2018-09-20 15:33:27,179 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=261, Invalid=2391, Unknown=0, NotChecked=0, Total=2652 [2018-09-20 15:33:27,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-09-20 15:33:27,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 248. [2018-09-20 15:33:27,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-09-20 15:33:27,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 270 transitions. [2018-09-20 15:33:27,213 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 270 transitions. Word has length 72 [2018-09-20 15:33:27,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:33:27,214 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 270 transitions. [2018-09-20 15:33:27,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-20 15:33:27,214 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 270 transitions. [2018-09-20 15:33:27,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-20 15:33:27,219 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:33:27,219 INFO L376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:33:27,219 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:33:27,219 INFO L82 PathProgramCache]: Analyzing trace with hash -463110587, now seen corresponding path program 1 times [2018-09-20 15:33:27,221 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:33:27,221 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-20 15:33:27,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:33:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:33:27,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:33:27,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:33:27,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:33:27,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:27,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:27,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:33:27,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:27 [2018-09-20 15:33:27,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:33:27,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:33:27,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:27,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:27,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:33:27,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:15 [2018-09-20 15:33:28,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:33:28,213 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:33:28,231 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:33:28,232 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-20 15:33:28,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-20 15:33:28,233 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-20 15:33:28,233 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-09-20 15:33:28,234 INFO L87 Difference]: Start difference. First operand 248 states and 270 transitions. Second operand 11 states. [2018-09-20 15:33:28,930 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-09-20 15:33:30,254 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2018-09-20 15:34:34,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:34:34,476 INFO L93 Difference]: Finished difference Result 466 states and 508 transitions. [2018-09-20 15:34:34,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-20 15:34:34,478 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-09-20 15:34:34,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:34:34,482 INFO L225 Difference]: With dead ends: 466 [2018-09-20 15:34:34,482 INFO L226 Difference]: Without dead ends: 418 [2018-09-20 15:34:34,484 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-09-20 15:34:34,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-09-20 15:34:34,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 274. [2018-09-20 15:34:34,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-09-20 15:34:34,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 298 transitions. [2018-09-20 15:34:34,520 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 298 transitions. Word has length 72 [2018-09-20 15:34:34,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:34:34,521 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 298 transitions. [2018-09-20 15:34:34,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-20 15:34:34,521 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 298 transitions. [2018-09-20 15:34:34,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-20 15:34:34,525 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:34:34,525 INFO L376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:34:34,525 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:34:34,526 INFO L82 PathProgramCache]: Analyzing trace with hash 501386156, now seen corresponding path program 1 times [2018-09-20 15:34:34,526 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:34:34,526 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-20 15:34:34,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:34:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:34:34,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:34:34,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:34:34,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:34:34,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:34:34,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:34:34,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:34:34,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:34:34,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:34:34,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:34:34,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:34:34,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:34:34,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:34:34,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:34:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:34:35,046 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:34:35,056 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:34:35,056 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-20 15:34:35,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-20 15:34:35,057 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-20 15:34:35,057 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-20 15:34:35,058 INFO L87 Difference]: Start difference. First operand 274 states and 298 transitions. Second operand 10 states. [2018-09-20 15:35:08,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:35:08,314 INFO L93 Difference]: Finished difference Result 556 states and 601 transitions. [2018-09-20 15:35:08,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-20 15:35:08,315 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2018-09-20 15:35:08,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:35:08,318 INFO L225 Difference]: With dead ends: 556 [2018-09-20 15:35:08,318 INFO L226 Difference]: Without dead ends: 309 [2018-09-20 15:35:08,321 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-09-20 15:35:08,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-09-20 15:35:08,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 250. [2018-09-20 15:35:08,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-09-20 15:35:08,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 271 transitions. [2018-09-20 15:35:08,341 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 271 transitions. Word has length 75 [2018-09-20 15:35:08,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:35:08,342 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 271 transitions. [2018-09-20 15:35:08,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-20 15:35:08,342 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 271 transitions. [2018-09-20 15:35:08,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-20 15:35:08,344 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:35:08,344 INFO L376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:35:08,344 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:35:08,345 INFO L82 PathProgramCache]: Analyzing trace with hash -463560330, now seen corresponding path program 1 times [2018-09-20 15:35:08,345 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:35:08,345 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-20 15:35:08,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:35:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:35:08,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:35:08,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:35:08,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:35:08,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:35:08,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:08,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:08,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:35:08,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:35:08,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:35:08,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:35:08,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:08,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:08,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:35:08,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:35:08,726 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:35:08,739 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:35:08,739 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-20 15:35:08,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-20 15:35:08,740 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-20 15:35:08,740 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-20 15:35:08,740 INFO L87 Difference]: Start difference. First operand 250 states and 271 transitions. Second operand 10 states. [2018-09-20 15:36:05,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:36:05,185 INFO L93 Difference]: Finished difference Result 442 states and 477 transitions. [2018-09-20 15:36:05,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-20 15:36:05,186 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2018-09-20 15:36:05,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:36:05,188 INFO L225 Difference]: With dead ends: 442 [2018-09-20 15:36:05,188 INFO L226 Difference]: Without dead ends: 309 [2018-09-20 15:36:05,190 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-09-20 15:36:05,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-09-20 15:36:05,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 253. [2018-09-20 15:36:05,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-09-20 15:36:05,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 274 transitions. [2018-09-20 15:36:05,206 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 274 transitions. Word has length 77 [2018-09-20 15:36:05,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:36:05,207 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 274 transitions. [2018-09-20 15:36:05,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-20 15:36:05,207 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 274 transitions. [2018-09-20 15:36:05,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-20 15:36:05,208 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:36:05,210 INFO L376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:36:05,210 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:36:05,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1341878004, now seen corresponding path program 1 times [2018-09-20 15:36:05,211 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:36:05,211 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-20 15:36:05,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:36:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:36:05,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:36:05,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:36:05,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:36:05,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:36:05,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:36:05,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:36:05,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:27 [2018-09-20 15:36:05,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:36:05,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:36:05,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:36:05,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:36:05,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:36:05,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:15 [2018-09-20 15:36:05,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:36:05,783 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:36:05,795 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:36:05,795 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-20 15:36:05,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-20 15:36:05,796 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-20 15:36:05,796 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-20 15:36:05,797 INFO L87 Difference]: Start difference. First operand 253 states and 274 transitions. Second operand 11 states. [2018-09-20 15:36:07,752 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-09-20 15:36:46,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:36:46,769 INFO L93 Difference]: Finished difference Result 331 states and 355 transitions. [2018-09-20 15:36:46,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-20 15:36:46,829 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2018-09-20 15:36:46,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:36:46,832 INFO L225 Difference]: With dead ends: 331 [2018-09-20 15:36:46,832 INFO L226 Difference]: Without dead ends: 309 [2018-09-20 15:36:46,833 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-09-20 15:36:46,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-09-20 15:36:46,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 253. [2018-09-20 15:36:46,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-09-20 15:36:46,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 273 transitions. [2018-09-20 15:36:46,856 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 273 transitions. Word has length 77 [2018-09-20 15:36:46,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:36:46,856 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 273 transitions. [2018-09-20 15:36:46,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-20 15:36:46,856 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 273 transitions. [2018-09-20 15:36:46,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-20 15:36:46,859 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:36:46,859 INFO L376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:36:46,859 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:36:46,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1560732722, now seen corresponding path program 1 times [2018-09-20 15:36:46,861 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:36:46,861 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 15:36:46,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-20 15:36:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:36:46,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:36:47,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:36:47,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:36:47,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:36:47,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:36:47,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:36:47,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:36:47,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:36:47,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:36:47,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:36:47,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:36:47,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:36:47,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:36:47,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-09-20 15:36:47,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-09-20 15:36:47,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:36:47,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:36:47,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:36:47,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-09-20 15:36:47,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-09-20 15:36:47,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-09-20 15:36:47,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:36:47,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:36:47,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:36:47,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:25 [2018-09-20 15:36:47,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:36:47,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:36:47,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:36:47,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:36:47,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:36:47,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:36:48,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:36:48,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:36:48,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:36:48,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:36:48,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:36:48,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:36:48,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:36:48,372 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:36:48,383 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:36:48,383 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-09-20 15:36:48,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-20 15:36:48,384 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-20 15:36:48,384 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-09-20 15:36:48,384 INFO L87 Difference]: Start difference. First operand 253 states and 273 transitions. Second operand 22 states. [2018-09-20 15:37:15,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:37:15,491 INFO L93 Difference]: Finished difference Result 314 states and 338 transitions. [2018-09-20 15:37:15,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-20 15:37:15,493 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2018-09-20 15:37:15,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:37:15,495 INFO L225 Difference]: With dead ends: 314 [2018-09-20 15:37:15,495 INFO L226 Difference]: Without dead ends: 281 [2018-09-20 15:37:15,497 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=185, Invalid=1795, Unknown=0, NotChecked=0, Total=1980 [2018-09-20 15:37:15,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-09-20 15:37:15,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 228. [2018-09-20 15:37:15,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-09-20 15:37:15,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 247 transitions. [2018-09-20 15:37:15,517 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 247 transitions. Word has length 77 [2018-09-20 15:37:15,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:37:15,518 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 247 transitions. [2018-09-20 15:37:15,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-20 15:37:15,518 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 247 transitions. [2018-09-20 15:37:15,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-20 15:37:15,520 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:37:15,521 INFO L376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:37:15,521 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:37:15,521 INFO L82 PathProgramCache]: Analyzing trace with hash -816648712, now seen corresponding path program 1 times [2018-09-20 15:37:15,522 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:37:15,523 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-09-20 15:37:15,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:37:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:37:15,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:37:15,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:37:15,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:37:15,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:37:15,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:37:15,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:37:15,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:37:15,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:37:15,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:37:15,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:37:15,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:37:15,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:37:15,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:37:15,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-09-20 15:37:15,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-09-20 15:37:15,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:37:15,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:37:15,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:37:15,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-09-20 15:37:15,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-09-20 15:37:15,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-09-20 15:37:15,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:37:15,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:37:15,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:37:15,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:25 [2018-09-20 15:37:16,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:37:16,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:37:16,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:37:16,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:37:16,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:37:16,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:37:16,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:37:16,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:37:16,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:37:16,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:37:16,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:37:16,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:37:16,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:37:16,807 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:37:16,818 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:37:16,819 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-09-20 15:37:16,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-20 15:37:16,819 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-20 15:37:16,820 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-09-20 15:37:16,820 INFO L87 Difference]: Start difference. First operand 228 states and 247 transitions. Second operand 21 states. [2018-09-20 15:38:04,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:38:04,008 INFO L93 Difference]: Finished difference Result 288 states and 311 transitions. [2018-09-20 15:38:04,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-20 15:38:04,009 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 77 [2018-09-20 15:38:04,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:38:04,011 INFO L225 Difference]: With dead ends: 288 [2018-09-20 15:38:04,011 INFO L226 Difference]: Without dead ends: 278 [2018-09-20 15:38:04,012 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=188, Invalid=1704, Unknown=0, NotChecked=0, Total=1892 [2018-09-20 15:38:04,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-20 15:38:04,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 225. [2018-09-20 15:38:04,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-20 15:38:04,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 242 transitions. [2018-09-20 15:38:04,035 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 242 transitions. Word has length 77 [2018-09-20 15:38:04,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:38:04,035 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 242 transitions. [2018-09-20 15:38:04,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-20 15:38:04,035 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 242 transitions. [2018-09-20 15:38:04,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-20 15:38:04,037 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:38:04,037 INFO L376 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, 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] [2018-09-20 15:38:04,038 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:38:04,038 INFO L82 PathProgramCache]: Analyzing trace with hash 521657706, now seen corresponding path program 1 times [2018-09-20 15:38:04,038 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:38:04,038 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-09-20 15:38:04,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:38:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:38:04,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:38:04,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:38:04,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:38:04,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:38:04,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:38:04,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:38:04,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:27 [2018-09-20 15:38:04,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:38:04,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:38:04,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:38:04,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:38:04,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:38:04,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:15 [2018-09-20 15:38:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:38:04,896 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:38:04,908 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:38:04,908 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-20 15:38:04,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-20 15:38:04,908 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-20 15:38:04,909 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-20 15:38:04,909 INFO L87 Difference]: Start difference. First operand 225 states and 242 transitions. Second operand 11 states. [2018-09-20 15:38:06,186 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-09-20 15:38:14,915 WARN L178 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-09-20 15:38:49,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:38:49,583 INFO L93 Difference]: Finished difference Result 313 states and 334 transitions. [2018-09-20 15:38:49,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-20 15:38:49,584 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-09-20 15:38:49,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:38:49,586 INFO L225 Difference]: With dead ends: 313 [2018-09-20 15:38:49,586 INFO L226 Difference]: Without dead ends: 265 [2018-09-20 15:38:49,587 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2018-09-20 15:38:49,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-09-20 15:38:49,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 227. [2018-09-20 15:38:49,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-20 15:38:49,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 243 transitions. [2018-09-20 15:38:49,614 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 243 transitions. Word has length 96 [2018-09-20 15:38:49,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:38:49,614 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 243 transitions. [2018-09-20 15:38:49,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-20 15:38:49,614 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 243 transitions. [2018-09-20 15:38:49,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-20 15:38:49,618 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:38:49,618 INFO L376 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, 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, 1] [2018-09-20 15:38:49,618 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:38:49,619 INFO L82 PathProgramCache]: Analyzing trace with hash -306577839, now seen corresponding path program 1 times [2018-09-20 15:38:49,620 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:38:49,620 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-09-20 15:38:49,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:38:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:38:50,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:38:50,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:38:50,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:38:50,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:38:50,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:38:50,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:38:50,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:27 [2018-09-20 15:38:50,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:38:50,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:38:50,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:38:50,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:38:50,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:38:50,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:15 [2018-09-20 15:38:50,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:38:50,994 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:38:51,017 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:38:51,018 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-20 15:38:51,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-20 15:38:51,018 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-20 15:38:51,019 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-20 15:38:51,019 INFO L87 Difference]: Start difference. First operand 227 states and 243 transitions. Second operand 11 states. [2018-09-20 15:38:52,627 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2018-09-20 15:39:06,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:39:06,085 INFO L93 Difference]: Finished difference Result 284 states and 301 transitions. [2018-09-20 15:39:06,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-20 15:39:06,086 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 116 [2018-09-20 15:39:06,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:39:06,088 INFO L225 Difference]: With dead ends: 284 [2018-09-20 15:39:06,088 INFO L226 Difference]: Without dead ends: 224 [2018-09-20 15:39:06,089 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2018-09-20 15:39:06,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-09-20 15:39:06,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2018-09-20 15:39:06,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-09-20 15:39:06,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 239 transitions. [2018-09-20 15:39:06,111 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 239 transitions. Word has length 116 [2018-09-20 15:39:06,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:39:06,112 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 239 transitions. [2018-09-20 15:39:06,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-20 15:39:06,112 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 239 transitions. [2018-09-20 15:39:06,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-20 15:39:06,113 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:39:06,114 INFO L376 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:39:06,114 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:39:06,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1114992271, now seen corresponding path program 1 times [2018-09-20 15:39:06,116 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:39:06,116 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 15:39:06,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-09-20 15:39:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:39:06,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:39:06,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:39:06,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:39:06,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:39:06,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:39:06,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:39:06,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:27 [2018-09-20 15:39:06,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:39:06,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:39:06,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:39:06,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:39:06,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:39:06,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:15 [2018-09-20 15:39:07,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:39:07,316 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:39:07,340 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:39:07,340 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-20 15:39:07,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-20 15:39:07,341 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-20 15:39:07,341 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-20 15:39:07,341 INFO L87 Difference]: Start difference. First operand 224 states and 239 transitions. Second operand 11 states. [2018-09-20 15:39:28,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:39:28,185 INFO L93 Difference]: Finished difference Result 257 states and 272 transitions. [2018-09-20 15:39:28,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-20 15:39:28,187 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 126 [2018-09-20 15:39:28,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:39:28,188 INFO L225 Difference]: With dead ends: 257 [2018-09-20 15:39:28,188 INFO L226 Difference]: Without dead ends: 211 [2018-09-20 15:39:28,189 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-09-20 15:39:28,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-09-20 15:39:28,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-09-20 15:39:28,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-20 15:39:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 224 transitions. [2018-09-20 15:39:28,216 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 224 transitions. Word has length 126 [2018-09-20 15:39:28,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:39:28,216 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 224 transitions. [2018-09-20 15:39:28,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-20 15:39:28,216 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 224 transitions. [2018-09-20 15:39:28,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-09-20 15:39:28,220 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:39:28,220 INFO L376 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:39:28,221 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:39:28,221 INFO L82 PathProgramCache]: Analyzing trace with hash 63878421, now seen corresponding path program 1 times [2018-09-20 15:39:28,221 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:39:28,221 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-09-20 15:39:28,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:39:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:39:29,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:39:29,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:39:29,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:39:29,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:39:29,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:39:29,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:39:29,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:27 [2018-09-20 15:39:29,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:39:29,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:39:29,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:39:29,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:39:29,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:39:29,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:15 [2018-09-20 15:39:29,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:39:29,899 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:39:29,917 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:39:29,917 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-20 15:39:29,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-20 15:39:29,918 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-20 15:39:29,918 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-20 15:39:29,918 INFO L87 Difference]: Start difference. First operand 211 states and 224 transitions. Second operand 11 states. [2018-09-20 15:39:43,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:39:43,733 INFO L93 Difference]: Finished difference Result 211 states and 224 transitions. [2018-09-20 15:39:43,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-20 15:39:43,734 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 137 [2018-09-20 15:39:43,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:39:43,735 INFO L225 Difference]: With dead ends: 211 [2018-09-20 15:39:43,735 INFO L226 Difference]: Without dead ends: 0 [2018-09-20 15:39:43,736 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-09-20 15:39:43,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-20 15:39:43,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-20 15:39:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-20 15:39:43,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-20 15:39:43,737 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 137 [2018-09-20 15:39:43,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:39:43,737 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-20 15:39:43,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-20 15:39:43,737 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-20 15:39:43,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-20 15:39:43,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-20 15:39:44,401 WARN L178 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 19 [2018-09-20 15:39:44,790 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 19 [2018-09-20 15:39:44,913 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 24 [2018-09-20 15:39:45,226 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 19 [2018-09-20 15:39:45,230 INFO L426 ceAbstractionStarter]: For program point L216(line 216) no Hoare annotation was computed. [2018-09-20 15:39:45,230 INFO L426 ceAbstractionStarter]: For program point L215(line 215) no Hoare annotation was computed. [2018-09-20 15:39:45,230 INFO L426 ceAbstractionStarter]: For program point L216-1(line 216) no Hoare annotation was computed. [2018-09-20 15:39:45,230 INFO L426 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2018-09-20 15:39:45,230 INFO L426 ceAbstractionStarter]: For program point L216-2(line 216) no Hoare annotation was computed. [2018-09-20 15:39:45,230 INFO L426 ceAbstractionStarter]: For program point L214-1(line 214) no Hoare annotation was computed. [2018-09-20 15:39:45,230 INFO L426 ceAbstractionStarter]: For program point L214-2(line 214) no Hoare annotation was computed. [2018-09-20 15:39:45,230 INFO L426 ceAbstractionStarter]: For program point L213-1(lines 213 217) no Hoare annotation was computed. [2018-09-20 15:39:45,230 INFO L426 ceAbstractionStarter]: For program point L214-3(line 214) no Hoare annotation was computed. [2018-09-20 15:39:45,231 INFO L422 ceAbstractionStarter]: At program point L213-3(lines 213 217) the Hoare annotation is: (= |isinf_float_#in~x| isinf_float_~x) [2018-09-20 15:39:45,231 INFO L426 ceAbstractionStarter]: For program point L213-4(lines 213 217) no Hoare annotation was computed. [2018-09-20 15:39:45,231 INFO L429 ceAbstractionStarter]: At program point isinf_floatENTRY(lines 211 220) the Hoare annotation is: true [2018-09-20 15:39:45,231 INFO L426 ceAbstractionStarter]: For program point isinf_floatEXIT(lines 211 220) no Hoare annotation was computed. [2018-09-20 15:39:45,231 INFO L426 ceAbstractionStarter]: For program point isinf_floatFINAL(lines 211 220) no Hoare annotation was computed. [2018-09-20 15:39:45,231 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-20 15:39:45,231 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-09-20 15:39:45,231 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-20 15:39:45,231 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-20 15:39:45,231 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-20 15:39:45,232 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-20 15:39:45,232 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-20 15:39:45,232 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 235) no Hoare annotation was computed. [2018-09-20 15:39:45,232 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 222 239) the Hoare annotation is: true [2018-09-20 15:39:45,232 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 222 239) no Hoare annotation was computed. [2018-09-20 15:39:45,232 INFO L426 ceAbstractionStarter]: For program point L235(line 235) no Hoare annotation was computed. [2018-09-20 15:39:45,232 INFO L422 ceAbstractionStarter]: At program point L234(line 234) the Hoare annotation is: (and (= (fp.div RNE ((_ to_fp 8 24) RNE 1.0) (_ +zero 8 24)) main_~y~0) (exists ((v___ieee754_hypotf_~hb~0_34 (_ BitVec 32))) (and (= (let ((.cse0 (bvand v___ieee754_hypotf_~hb~0_34 (_ bv2147483647 32)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) main_~res~0) (= (fp ((_ extract 31 31) v___ieee754_hypotf_~hb~0_34) ((_ extract 30 23) v___ieee754_hypotf_~hb~0_34) ((_ extract 22 0) v___ieee754_hypotf_~hb~0_34)) (fp.div RNE ((_ to_fp 8 24) RNE 1.0) (_ +zero 8 24)))))) [2018-09-20 15:39:45,232 INFO L426 ceAbstractionStarter]: For program point L234-1(lines 234 237) no Hoare annotation was computed. [2018-09-20 15:39:45,232 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 222 239) no Hoare annotation was computed. [2018-09-20 15:39:45,233 INFO L422 ceAbstractionStarter]: At program point L232(line 232) the Hoare annotation is: (= (fp.div RNE ((_ to_fp 8 24) RNE 1.0) (_ +zero 8 24)) main_~y~0) [2018-09-20 15:39:45,233 INFO L426 ceAbstractionStarter]: For program point L232-1(line 232) no Hoare annotation was computed. [2018-09-20 15:39:45,233 INFO L426 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-09-20 15:39:45,233 INFO L426 ceAbstractionStarter]: For program point L85-1(lines 85 89) no Hoare annotation was computed. [2018-09-20 15:39:45,233 INFO L422 ceAbstractionStarter]: At program point L85-3(lines 85 89) the Hoare annotation is: (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y) [2018-09-20 15:39:45,233 INFO L426 ceAbstractionStarter]: For program point L85-4(lines 85 89) no Hoare annotation was computed. [2018-09-20 15:39:45,233 INFO L426 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-09-20 15:39:45,233 INFO L426 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-09-20 15:39:45,233 INFO L426 ceAbstractionStarter]: For program point L201-1(line 201) no Hoare annotation was computed. [2018-09-20 15:39:45,233 INFO L426 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-09-20 15:39:45,233 INFO L426 ceAbstractionStarter]: For program point L201-2(line 201) no Hoare annotation was computed. [2018-09-20 15:39:45,234 INFO L426 ceAbstractionStarter]: For program point L135-1(line 135) no Hoare annotation was computed. [2018-09-20 15:39:45,234 INFO L426 ceAbstractionStarter]: For program point L201-3(line 201) no Hoare annotation was computed. [2018-09-20 15:39:45,234 INFO L426 ceAbstractionStarter]: For program point L135-2(line 135) no Hoare annotation was computed. [2018-09-20 15:39:45,234 INFO L426 ceAbstractionStarter]: For program point L135-3(line 135) no Hoare annotation was computed. [2018-09-20 15:39:45,234 INFO L426 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-09-20 15:39:45,234 INFO L426 ceAbstractionStarter]: For program point L185-1(lines 185 189) no Hoare annotation was computed. [2018-09-20 15:39:45,234 INFO L426 ceAbstractionStarter]: For program point L152-1(line 152) no Hoare annotation was computed. [2018-09-20 15:39:45,234 INFO L426 ceAbstractionStarter]: For program point L86(line 86) no Hoare annotation was computed. [2018-09-20 15:39:45,234 INFO L426 ceAbstractionStarter]: For program point L152-2(line 152) no Hoare annotation was computed. [2018-09-20 15:39:45,234 INFO L422 ceAbstractionStarter]: At program point L185-3(lines 185 189) the Hoare annotation is: (and (exists ((v___ieee754_hypotf_~hb~0_30 (_ BitVec 32))) (and (not (= (bvadd (bvand v___ieee754_hypotf_~hb~0_30 (_ bv2147483647 32)) (_ bv2155872256 32)) (_ bv0 32))) (= |__ieee754_hypotf_#in~y| (fp ((_ extract 31 31) v___ieee754_hypotf_~hb~0_30) ((_ extract 30 23) v___ieee754_hypotf_~hb~0_30) ((_ extract 22 0) v___ieee754_hypotf_~hb~0_30))))) (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y)) [2018-09-20 15:39:45,234 INFO L426 ceAbstractionStarter]: For program point L86-1(line 86) no Hoare annotation was computed. [2018-09-20 15:39:45,235 INFO L426 ceAbstractionStarter]: For program point L185-4(lines 185 189) no Hoare annotation was computed. [2018-09-20 15:39:45,235 INFO L426 ceAbstractionStarter]: For program point L86-2(line 86) no Hoare annotation was computed. [2018-09-20 15:39:45,235 INFO L426 ceAbstractionStarter]: For program point L86-3(line 86) no Hoare annotation was computed. [2018-09-20 15:39:45,235 INFO L426 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-09-20 15:39:45,235 INFO L426 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-09-20 15:39:45,235 INFO L426 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-09-20 15:39:45,235 INFO L426 ceAbstractionStarter]: For program point L169-1(line 169) no Hoare annotation was computed. [2018-09-20 15:39:45,235 INFO L426 ceAbstractionStarter]: For program point L169-2(line 169) no Hoare annotation was computed. [2018-09-20 15:39:45,235 INFO L426 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-09-20 15:39:45,235 INFO L426 ceAbstractionStarter]: For program point L186-1(line 186) no Hoare annotation was computed. [2018-09-20 15:39:45,235 INFO L426 ceAbstractionStarter]: For program point L186-2(line 186) no Hoare annotation was computed. [2018-09-20 15:39:45,236 INFO L426 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-09-20 15:39:45,236 INFO L426 ceAbstractionStarter]: For program point L186-3(line 186) no Hoare annotation was computed. [2018-09-20 15:39:45,236 INFO L426 ceAbstractionStarter]: For program point __ieee754_hypotfFINAL(lines 81 208) no Hoare annotation was computed. [2018-09-20 15:39:45,236 INFO L426 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2018-09-20 15:39:45,236 INFO L426 ceAbstractionStarter]: For program point L203-1(line 203) no Hoare annotation was computed. [2018-09-20 15:39:45,236 INFO L426 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2018-09-20 15:39:45,236 INFO L426 ceAbstractionStarter]: For program point L203-2(line 203) no Hoare annotation was computed. [2018-09-20 15:39:45,236 INFO L426 ceAbstractionStarter]: For program point __ieee754_hypotfEXIT(lines 81 208) no Hoare annotation was computed. [2018-09-20 15:39:45,236 INFO L426 ceAbstractionStarter]: For program point L137-1(line 137) no Hoare annotation was computed. [2018-09-20 15:39:45,236 INFO L426 ceAbstractionStarter]: For program point L137-2(line 137) no Hoare annotation was computed. [2018-09-20 15:39:45,236 INFO L426 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-09-20 15:39:45,236 INFO L426 ceAbstractionStarter]: For program point L121(lines 121 144) no Hoare annotation was computed. [2018-09-20 15:39:45,237 INFO L426 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-09-20 15:39:45,237 INFO L426 ceAbstractionStarter]: For program point L121-1(lines 81 208) no Hoare annotation was computed. [2018-09-20 15:39:45,237 INFO L426 ceAbstractionStarter]: For program point L88-1(line 88) no Hoare annotation was computed. [2018-09-20 15:39:45,237 INFO L426 ceAbstractionStarter]: For program point L88-2(line 88) no Hoare annotation was computed. [2018-09-20 15:39:45,237 INFO L426 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2018-09-20 15:39:45,237 INFO L426 ceAbstractionStarter]: For program point L188-1(line 188) no Hoare annotation was computed. [2018-09-20 15:39:45,237 INFO L426 ceAbstractionStarter]: For program point L122(lines 122 129) no Hoare annotation was computed. [2018-09-20 15:39:45,237 INFO L426 ceAbstractionStarter]: For program point L188-2(line 188) no Hoare annotation was computed. [2018-09-20 15:39:45,237 INFO L426 ceAbstractionStarter]: For program point L139(lines 139 143) no Hoare annotation was computed. [2018-09-20 15:39:45,237 INFO L426 ceAbstractionStarter]: For program point L139-2(lines 121 144) no Hoare annotation was computed. [2018-09-20 15:39:45,237 INFO L426 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-09-20 15:39:45,238 INFO L426 ceAbstractionStarter]: For program point L107(lines 107 111) no Hoare annotation was computed. [2018-09-20 15:39:45,238 INFO L426 ceAbstractionStarter]: For program point L140-1(line 140) no Hoare annotation was computed. [2018-09-20 15:39:45,238 INFO L426 ceAbstractionStarter]: For program point L140-2(line 140) no Hoare annotation was computed. [2018-09-20 15:39:45,238 INFO L426 ceAbstractionStarter]: For program point L107-2(lines 81 208) no Hoare annotation was computed. [2018-09-20 15:39:45,238 INFO L426 ceAbstractionStarter]: For program point L140-3(line 140) no Hoare annotation was computed. [2018-09-20 15:39:45,238 INFO L426 ceAbstractionStarter]: For program point L124(lines 124 125) no Hoare annotation was computed. [2018-09-20 15:39:45,238 INFO L426 ceAbstractionStarter]: For program point L91-1(lines 91 95) no Hoare annotation was computed. [2018-09-20 15:39:45,238 INFO L426 ceAbstractionStarter]: For program point L124-2(lines 122 129) no Hoare annotation was computed. [2018-09-20 15:39:45,238 INFO L422 ceAbstractionStarter]: At program point L91-3(lines 91 95) the Hoare annotation is: (and (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y) (exists ((v___ieee754_hypotf_~ha~0_31 (_ BitVec 32))) (= (bvand v___ieee754_hypotf_~ha~0_31 (_ bv2147483647 32)) __ieee754_hypotf_~ha~0))) [2018-09-20 15:39:45,238 INFO L426 ceAbstractionStarter]: For program point L91-4(lines 91 95) no Hoare annotation was computed. [2018-09-20 15:39:45,238 INFO L426 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-09-20 15:39:45,238 INFO L426 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-09-20 15:39:45,239 INFO L426 ceAbstractionStarter]: For program point L108-1(line 108) no Hoare annotation was computed. [2018-09-20 15:39:45,239 INFO L426 ceAbstractionStarter]: For program point L108-2(line 108) no Hoare annotation was computed. [2018-09-20 15:39:45,239 INFO L426 ceAbstractionStarter]: For program point L108-3(line 108) no Hoare annotation was computed. [2018-09-20 15:39:45,239 INFO L426 ceAbstractionStarter]: For program point L191-1(lines 191 195) no Hoare annotation was computed. [2018-09-20 15:39:45,239 INFO L426 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2018-09-20 15:39:45,239 INFO L422 ceAbstractionStarter]: At program point L191-3(lines 191 195) the Hoare annotation is: (and (exists ((v___ieee754_hypotf_~hb~0_30 (_ BitVec 32))) (and (not (= (bvadd (bvand v___ieee754_hypotf_~hb~0_30 (_ bv2147483647 32)) (_ bv2155872256 32)) (_ bv0 32))) (= |__ieee754_hypotf_#in~y| (fp ((_ extract 31 31) v___ieee754_hypotf_~hb~0_30) ((_ extract 30 23) v___ieee754_hypotf_~hb~0_30) ((_ extract 22 0) v___ieee754_hypotf_~hb~0_30))))) (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y)) [2018-09-20 15:39:45,239 INFO L426 ceAbstractionStarter]: For program point L92-1(line 92) no Hoare annotation was computed. [2018-09-20 15:39:45,239 INFO L426 ceAbstractionStarter]: For program point L191-4(lines 191 195) no Hoare annotation was computed. [2018-09-20 15:39:45,239 INFO L426 ceAbstractionStarter]: For program point L92-2(line 92) no Hoare annotation was computed. [2018-09-20 15:39:45,239 INFO L426 ceAbstractionStarter]: For program point L92-3(line 92) no Hoare annotation was computed. [2018-09-20 15:39:45,239 INFO L426 ceAbstractionStarter]: For program point L175(lines 175 198) no Hoare annotation was computed. [2018-09-20 15:39:45,239 INFO L426 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-09-20 15:39:45,240 INFO L426 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-09-20 15:39:45,240 INFO L426 ceAbstractionStarter]: For program point L142-1(line 142) no Hoare annotation was computed. [2018-09-20 15:39:45,240 INFO L426 ceAbstractionStarter]: For program point L175-2(lines 81 208) no Hoare annotation was computed. [2018-09-20 15:39:45,240 INFO L426 ceAbstractionStarter]: For program point L142-2(line 142) no Hoare annotation was computed. [2018-09-20 15:39:45,240 INFO L426 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-09-20 15:39:45,240 INFO L426 ceAbstractionStarter]: For program point L192-1(line 192) no Hoare annotation was computed. [2018-09-20 15:39:45,240 INFO L426 ceAbstractionStarter]: For program point L192-2(line 192) no Hoare annotation was computed. [2018-09-20 15:39:45,240 INFO L426 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-09-20 15:39:45,240 INFO L426 ceAbstractionStarter]: For program point L126-1(lines 126 127) no Hoare annotation was computed. [2018-09-20 15:39:45,240 INFO L426 ceAbstractionStarter]: For program point L192-3(line 192) no Hoare annotation was computed. [2018-09-20 15:39:45,240 INFO L426 ceAbstractionStarter]: For program point L176-1(lines 176 180) no Hoare annotation was computed. [2018-09-20 15:39:45,240 INFO L426 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-09-20 15:39:45,241 INFO L426 ceAbstractionStarter]: For program point L110-1(line 110) no Hoare annotation was computed. [2018-09-20 15:39:45,241 INFO L422 ceAbstractionStarter]: At program point L176-3(lines 176 180) the Hoare annotation is: (and (exists ((v___ieee754_hypotf_~hb~0_30 (_ BitVec 32))) (and (not (= (bvadd (bvand v___ieee754_hypotf_~hb~0_30 (_ bv2147483647 32)) (_ bv2155872256 32)) (_ bv0 32))) (= |__ieee754_hypotf_#in~y| (fp ((_ extract 31 31) v___ieee754_hypotf_~hb~0_30) ((_ extract 30 23) v___ieee754_hypotf_~hb~0_30) ((_ extract 22 0) v___ieee754_hypotf_~hb~0_30))))) (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y)) [2018-09-20 15:39:45,241 INFO L426 ceAbstractionStarter]: For program point L110-2(line 110) no Hoare annotation was computed. [2018-09-20 15:39:45,241 INFO L426 ceAbstractionStarter]: For program point L176-4(lines 176 180) no Hoare annotation was computed. [2018-09-20 15:39:45,241 INFO L426 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-09-20 15:39:45,241 INFO L426 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-09-20 15:39:45,241 INFO L426 ceAbstractionStarter]: For program point L94-1(line 94) no Hoare annotation was computed. [2018-09-20 15:39:45,241 INFO L426 ceAbstractionStarter]: For program point L94-2(line 94) no Hoare annotation was computed. [2018-09-20 15:39:45,241 INFO L426 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-09-20 15:39:45,241 INFO L426 ceAbstractionStarter]: For program point L177-1(line 177) no Hoare annotation was computed. [2018-09-20 15:39:45,241 INFO L426 ceAbstractionStarter]: For program point L177-2(line 177) no Hoare annotation was computed. [2018-09-20 15:39:45,241 INFO L426 ceAbstractionStarter]: For program point L177-3(line 177) no Hoare annotation was computed. [2018-09-20 15:39:45,242 INFO L426 ceAbstractionStarter]: For program point L194(line 194) no Hoare annotation was computed. [2018-09-20 15:39:45,242 INFO L426 ceAbstractionStarter]: For program point L194-1(line 194) no Hoare annotation was computed. [2018-09-20 15:39:45,242 INFO L426 ceAbstractionStarter]: For program point L161-1(lines 161 165) no Hoare annotation was computed. [2018-09-20 15:39:45,242 INFO L426 ceAbstractionStarter]: For program point L194-2(line 194) no Hoare annotation was computed. [2018-09-20 15:39:45,242 INFO L422 ceAbstractionStarter]: At program point L161-3(lines 161 165) the Hoare annotation is: (and (exists ((v___ieee754_hypotf_~hb~0_30 (_ BitVec 32))) (and (not (= (bvadd (bvand v___ieee754_hypotf_~hb~0_30 (_ bv2147483647 32)) (_ bv2155872256 32)) (_ bv0 32))) (= |__ieee754_hypotf_#in~y| (fp ((_ extract 31 31) v___ieee754_hypotf_~hb~0_30) ((_ extract 30 23) v___ieee754_hypotf_~hb~0_30) ((_ extract 22 0) v___ieee754_hypotf_~hb~0_30))))) (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y)) [2018-09-20 15:39:45,242 INFO L426 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-09-20 15:39:45,242 INFO L426 ceAbstractionStarter]: For program point L145(lines 145 172) no Hoare annotation was computed. [2018-09-20 15:39:45,242 INFO L426 ceAbstractionStarter]: For program point L112(lines 112 116) no Hoare annotation was computed. [2018-09-20 15:39:45,242 INFO L426 ceAbstractionStarter]: For program point L112-2(lines 81 208) no Hoare annotation was computed. [2018-09-20 15:39:45,242 INFO L426 ceAbstractionStarter]: For program point L112-3(lines 81 208) no Hoare annotation was computed. [2018-09-20 15:39:45,242 INFO L429 ceAbstractionStarter]: At program point __ieee754_hypotfENTRY(lines 81 208) the Hoare annotation is: true [2018-09-20 15:39:45,243 INFO L426 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-09-20 15:39:45,243 INFO L426 ceAbstractionStarter]: For program point L162-1(line 162) no Hoare annotation was computed. [2018-09-20 15:39:45,243 INFO L426 ceAbstractionStarter]: For program point L162-2(line 162) no Hoare annotation was computed. [2018-09-20 15:39:45,243 INFO L426 ceAbstractionStarter]: For program point L162-3(line 162) no Hoare annotation was computed. [2018-09-20 15:39:45,243 INFO L426 ceAbstractionStarter]: For program point L179(line 179) no Hoare annotation was computed. [2018-09-20 15:39:45,243 INFO L426 ceAbstractionStarter]: For program point L146(lines 146 171) no Hoare annotation was computed. [2018-09-20 15:39:45,243 INFO L426 ceAbstractionStarter]: For program point L179-1(line 179) no Hoare annotation was computed. [2018-09-20 15:39:45,243 INFO L426 ceAbstractionStarter]: For program point L113(line 113) no Hoare annotation was computed. [2018-09-20 15:39:45,243 INFO L426 ceAbstractionStarter]: For program point L179-2(line 179) no Hoare annotation was computed. [2018-09-20 15:39:45,243 INFO L426 ceAbstractionStarter]: For program point L113-1(line 113) no Hoare annotation was computed. [2018-09-20 15:39:45,243 INFO L426 ceAbstractionStarter]: For program point L113-2(line 113) no Hoare annotation was computed. [2018-09-20 15:39:45,243 INFO L426 ceAbstractionStarter]: For program point L113-3(line 113) no Hoare annotation was computed. [2018-09-20 15:39:45,243 INFO L426 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-09-20 15:39:45,244 INFO L426 ceAbstractionStarter]: For program point L97(lines 97 106) no Hoare annotation was computed. [2018-09-20 15:39:45,244 INFO L426 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-09-20 15:39:45,244 INFO L422 ceAbstractionStarter]: At program point L197(line 197) the Hoare annotation is: (and (exists ((v___ieee754_hypotf_~hb~0_30 (_ BitVec 32))) (and (not (= (bvadd (bvand v___ieee754_hypotf_~hb~0_30 (_ bv2147483647 32)) (_ bv2155872256 32)) (_ bv0 32))) (= |__ieee754_hypotf_#in~y| (fp ((_ extract 31 31) v___ieee754_hypotf_~hb~0_30) ((_ extract 30 23) v___ieee754_hypotf_~hb~0_30) ((_ extract 22 0) v___ieee754_hypotf_~hb~0_30))))) (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y)) [2018-09-20 15:39:45,244 INFO L426 ceAbstractionStarter]: For program point L164(line 164) no Hoare annotation was computed. [2018-09-20 15:39:45,244 INFO L426 ceAbstractionStarter]: For program point L197-1(line 197) no Hoare annotation was computed. [2018-09-20 15:39:45,244 INFO L426 ceAbstractionStarter]: For program point L164-1(line 164) no Hoare annotation was computed. [2018-09-20 15:39:45,244 INFO L426 ceAbstractionStarter]: For program point L164-2(line 164) no Hoare annotation was computed. [2018-09-20 15:39:45,244 INFO L426 ceAbstractionStarter]: For program point L148(lines 148 171) no Hoare annotation was computed. [2018-09-20 15:39:45,244 INFO L426 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-09-20 15:39:45,244 INFO L426 ceAbstractionStarter]: For program point L115-1(line 115) no Hoare annotation was computed. [2018-09-20 15:39:45,244 INFO L426 ceAbstractionStarter]: For program point L115-2(line 115) no Hoare annotation was computed. [2018-09-20 15:39:45,245 INFO L422 ceAbstractionStarter]: At program point L182(line 182) the Hoare annotation is: (and (exists ((v___ieee754_hypotf_~hb~0_30 (_ BitVec 32))) (and (not (= (bvadd (bvand v___ieee754_hypotf_~hb~0_30 (_ bv2147483647 32)) (_ bv2155872256 32)) (_ bv0 32))) (= |__ieee754_hypotf_#in~y| (fp ((_ extract 31 31) v___ieee754_hypotf_~hb~0_30) ((_ extract 30 23) v___ieee754_hypotf_~hb~0_30) ((_ extract 22 0) v___ieee754_hypotf_~hb~0_30))))) (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y)) [2018-09-20 15:39:45,245 INFO L426 ceAbstractionStarter]: For program point L182-1(line 182) no Hoare annotation was computed. [2018-09-20 15:39:45,245 INFO L426 ceAbstractionStarter]: For program point L149-1(lines 149 153) no Hoare annotation was computed. [2018-09-20 15:39:45,245 INFO L422 ceAbstractionStarter]: At program point L149-3(lines 149 153) the Hoare annotation is: (and (exists ((v___ieee754_hypotf_~hb~0_30 (_ BitVec 32))) (and (not (= (bvadd (bvand v___ieee754_hypotf_~hb~0_30 (_ bv2147483647 32)) (_ bv2155872256 32)) (_ bv0 32))) (= |__ieee754_hypotf_#in~y| (fp ((_ extract 31 31) v___ieee754_hypotf_~hb~0_30) ((_ extract 30 23) v___ieee754_hypotf_~hb~0_30) ((_ extract 22 0) v___ieee754_hypotf_~hb~0_30))))) (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y)) [2018-09-20 15:39:45,245 INFO L426 ceAbstractionStarter]: For program point L149-4(lines 149 153) no Hoare annotation was computed. [2018-09-20 15:39:45,245 INFO L426 ceAbstractionStarter]: For program point L166(lines 166 170) no Hoare annotation was computed. [2018-09-20 15:39:45,245 INFO L426 ceAbstractionStarter]: For program point L166-2(lines 157 171) no Hoare annotation was computed. [2018-09-20 15:39:45,245 INFO L426 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-09-20 15:39:45,245 INFO L426 ceAbstractionStarter]: For program point L150-1(line 150) no Hoare annotation was computed. [2018-09-20 15:39:45,245 INFO L426 ceAbstractionStarter]: For program point L150-2(line 150) no Hoare annotation was computed. [2018-09-20 15:39:45,246 INFO L426 ceAbstractionStarter]: For program point L150-3(line 150) no Hoare annotation was computed. [2018-09-20 15:39:45,246 INFO L426 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2018-09-20 15:39:45,246 INFO L426 ceAbstractionStarter]: For program point L200-1(lines 200 204) no Hoare annotation was computed. [2018-09-20 15:39:45,246 INFO L426 ceAbstractionStarter]: For program point L167-1(line 167) no Hoare annotation was computed. [2018-09-20 15:39:45,246 INFO L426 ceAbstractionStarter]: For program point L134-1(lines 134 138) no Hoare annotation was computed. [2018-09-20 15:39:45,246 INFO L426 ceAbstractionStarter]: For program point L167-2(line 167) no Hoare annotation was computed. [2018-09-20 15:39:45,246 INFO L422 ceAbstractionStarter]: At program point L200-3(lines 200 204) the Hoare annotation is: (and (exists ((v___ieee754_hypotf_~hb~0_30 (_ BitVec 32))) (and (not (= (bvadd (bvand v___ieee754_hypotf_~hb~0_30 (_ bv2147483647 32)) (_ bv2155872256 32)) (_ bv0 32))) (= |__ieee754_hypotf_#in~y| (fp ((_ extract 31 31) v___ieee754_hypotf_~hb~0_30) ((_ extract 30 23) v___ieee754_hypotf_~hb~0_30) ((_ extract 22 0) v___ieee754_hypotf_~hb~0_30))))) (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y)) [2018-09-20 15:39:45,246 INFO L426 ceAbstractionStarter]: For program point L167-3(line 167) no Hoare annotation was computed. [2018-09-20 15:39:45,246 INFO L426 ceAbstractionStarter]: For program point L200-4(lines 200 204) no Hoare annotation was computed. [2018-09-20 15:39:45,246 INFO L422 ceAbstractionStarter]: At program point L134-3(lines 134 138) the Hoare annotation is: (and (exists ((v___ieee754_hypotf_~hb~0_30 (_ BitVec 32))) (and (not (= (bvadd (bvand v___ieee754_hypotf_~hb~0_30 (_ bv2147483647 32)) (_ bv2155872256 32)) (_ bv0 32))) (= |__ieee754_hypotf_#in~y| (fp ((_ extract 31 31) v___ieee754_hypotf_~hb~0_30) ((_ extract 30 23) v___ieee754_hypotf_~hb~0_30) ((_ extract 22 0) v___ieee754_hypotf_~hb~0_30))))) (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y)) [2018-09-20 15:39:45,246 INFO L426 ceAbstractionStarter]: For program point L35-2(lines 35 39) no Hoare annotation was computed. [2018-09-20 15:39:45,247 INFO L426 ceAbstractionStarter]: For program point L52(lines 52 56) no Hoare annotation was computed. [2018-09-20 15:39:45,247 INFO L426 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2018-09-20 15:39:45,247 INFO L426 ceAbstractionStarter]: For program point L52-2(lines 52 56) no Hoare annotation was computed. [2018-09-20 15:39:45,247 INFO L429 ceAbstractionStarter]: At program point L19-3(lines 19 23) the Hoare annotation is: true [2018-09-20 15:39:45,247 INFO L426 ceAbstractionStarter]: For program point L19-4(lines 19 23) no Hoare annotation was computed. [2018-09-20 15:39:45,247 INFO L426 ceAbstractionStarter]: For program point L36-1(lines 36 37) no Hoare annotation was computed. [2018-09-20 15:39:45,247 INFO L426 ceAbstractionStarter]: For program point L36-3(lines 36 37) no Hoare annotation was computed. [2018-09-20 15:39:45,247 INFO L429 ceAbstractionStarter]: At program point L36-4(lines 36 37) the Hoare annotation is: true [2018-09-20 15:39:45,247 INFO L426 ceAbstractionStarter]: For program point L36-5(lines 36 37) no Hoare annotation was computed. [2018-09-20 15:39:45,247 INFO L426 ceAbstractionStarter]: For program point L61(lines 61 70) no Hoare annotation was computed. [2018-09-20 15:39:45,248 INFO L426 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-09-20 15:39:45,248 INFO L426 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-09-20 15:39:45,248 INFO L426 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. [2018-09-20 15:39:45,248 INFO L426 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-09-20 15:39:45,248 INFO L429 ceAbstractionStarter]: At program point __ieee754_sqrtfENTRY(lines 14 79) the Hoare annotation is: true [2018-09-20 15:39:45,248 INFO L426 ceAbstractionStarter]: For program point __ieee754_sqrtfFINAL(lines 14 79) no Hoare annotation was computed. [2018-09-20 15:39:45,248 INFO L426 ceAbstractionStarter]: For program point L29(lines 29 30) no Hoare annotation was computed. [2018-09-20 15:39:45,248 INFO L426 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-09-20 15:39:45,248 INFO L426 ceAbstractionStarter]: For program point __ieee754_sqrtfEXIT(lines 14 79) no Hoare annotation was computed. [2018-09-20 15:39:45,248 INFO L426 ceAbstractionStarter]: For program point L63(lines 63 69) no Hoare annotation was computed. [2018-09-20 15:39:45,250 INFO L426 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-09-20 15:39:45,250 INFO L426 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2018-09-20 15:39:45,250 INFO L426 ceAbstractionStarter]: For program point L22-2(line 22) no Hoare annotation was computed. [2018-09-20 15:39:45,251 INFO L426 ceAbstractionStarter]: For program point L31(lines 31 32) no Hoare annotation was computed. [2018-09-20 15:39:45,251 INFO L426 ceAbstractionStarter]: For program point L73-1(lines 73 77) no Hoare annotation was computed. [2018-09-20 15:39:45,251 INFO L429 ceAbstractionStarter]: At program point L73-3(lines 73 77) the Hoare annotation is: true [2018-09-20 15:39:45,251 INFO L426 ceAbstractionStarter]: For program point L73-4(lines 73 77) no Hoare annotation was computed. [2018-09-20 15:39:45,251 INFO L426 ceAbstractionStarter]: For program point L65(lines 65 68) no Hoare annotation was computed. [2018-09-20 15:39:45,251 INFO L426 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2018-09-20 15:39:45,251 INFO L426 ceAbstractionStarter]: For program point L74-1(line 74) no Hoare annotation was computed. [2018-09-20 15:39:45,251 INFO L426 ceAbstractionStarter]: For program point L74-2(line 74) no Hoare annotation was computed. [2018-09-20 15:39:45,251 INFO L426 ceAbstractionStarter]: For program point L74-3(line 74) no Hoare annotation was computed. [2018-09-20 15:39:45,251 INFO L426 ceAbstractionStarter]: For program point L50-1(lines 50 59) no Hoare annotation was computed. [2018-09-20 15:39:45,251 INFO L429 ceAbstractionStarter]: At program point L50-3(lines 50 59) the Hoare annotation is: true [2018-09-20 15:39:45,251 INFO L426 ceAbstractionStarter]: For program point L50-4(lines 14 79) no Hoare annotation was computed. [2018-09-20 15:39:45,251 INFO L426 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-09-20 15:39:45,252 INFO L426 ceAbstractionStarter]: For program point L42(lines 42 43) no Hoare annotation was computed. [2018-09-20 15:39:45,252 INFO L426 ceAbstractionStarter]: For program point L42-2(lines 42 43) no Hoare annotation was computed. [2018-09-20 15:39:45,252 INFO L426 ceAbstractionStarter]: For program point L26(lines 26 27) no Hoare annotation was computed. [2018-09-20 15:39:45,252 INFO L426 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-09-20 15:39:45,252 INFO L426 ceAbstractionStarter]: For program point L76-1(line 76) no Hoare annotation was computed. [2018-09-20 15:39:45,252 INFO L426 ceAbstractionStarter]: For program point L76-2(line 76) no Hoare annotation was computed. [2018-09-20 15:39:45,252 INFO L426 ceAbstractionStarter]: For program point L35(lines 35 39) no Hoare annotation was computed. [2018-09-20 15:39:45,264 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,266 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,266 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,266 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,267 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,267 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,267 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,268 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,268 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,269 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,269 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,269 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,270 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,270 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,270 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,270 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,277 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,277 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,277 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,277 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,278 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,278 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,278 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,278 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,279 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,279 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,279 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,279 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,280 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,280 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,280 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,280 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,288 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_31,QUANTIFIED] [2018-09-20 15:39:45,288 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_31,QUANTIFIED] [2018-09-20 15:39:45,289 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,289 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,289 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,291 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,292 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,292 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,292 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,292 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,293 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,293 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,295 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,296 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,296 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,296 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,296 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,297 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,297 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,297 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,297 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,298 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,298 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,298 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,302 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,302 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 03:39:45 BoogieIcfgContainer [2018-09-20 15:39:45,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 15:39:45,307 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 15:39:45,307 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 15:39:45,308 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 15:39:45,308 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:32:08" (3/4) ... [2018-09-20 15:39:45,315 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-09-20 15:39:45,334 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-09-20 15:39:45,334 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure isinf_float [2018-09-20 15:39:45,334 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-09-20 15:39:45,334 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __ieee754_hypotf [2018-09-20 15:39:45,334 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __ieee754_sqrtf [2018-09-20 15:39:45,356 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 54 nodes and edges [2018-09-20 15:39:45,357 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2018-09-20 15:39:45,357 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-09-20 15:39:45,393 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-09-20 15:39:45,393 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(y) == y [2018-09-20 15:39:45,395 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(y) == y && (\exists v___ieee754_hypotf_~ha~0_31 : bv32 :: ~bvand32(v___ieee754_hypotf_~ha~0_31, 2147483647bv32) == ha) [2018-09-20 15:39:45,396 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v___ieee754_hypotf_~hb~0_30 : bv32 :: !(~bvadd64(~bvand32(v___ieee754_hypotf_~hb~0_30, 2147483647bv32), 2155872256bv32) == 0bv32) && \old(y) == ~fp~LONGDOUBLE(v___ieee754_hypotf_~hb~0_30[31:31], v___ieee754_hypotf_~hb~0_30[30:23], v___ieee754_hypotf_~hb~0_30[22:0])) && \old(y) == y [2018-09-20 15:39:45,396 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v___ieee754_hypotf_~hb~0_30 : bv32 :: !(~bvadd64(~bvand32(v___ieee754_hypotf_~hb~0_30, 2147483647bv32), 2155872256bv32) == 0bv32) && \old(y) == ~fp~LONGDOUBLE(v___ieee754_hypotf_~hb~0_30[31:31], v___ieee754_hypotf_~hb~0_30[30:23], v___ieee754_hypotf_~hb~0_30[22:0])) && \old(y) == y [2018-09-20 15:39:45,396 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v___ieee754_hypotf_~hb~0_30 : bv32 :: !(~bvadd64(~bvand32(v___ieee754_hypotf_~hb~0_30, 2147483647bv32), 2155872256bv32) == 0bv32) && \old(y) == ~fp~LONGDOUBLE(v___ieee754_hypotf_~hb~0_30[31:31], v___ieee754_hypotf_~hb~0_30[30:23], v___ieee754_hypotf_~hb~0_30[22:0])) && \old(y) == y [2018-09-20 15:39:45,396 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v___ieee754_hypotf_~hb~0_30 : bv32 :: !(~bvadd64(~bvand32(v___ieee754_hypotf_~hb~0_30, 2147483647bv32), 2155872256bv32) == 0bv32) && \old(y) == ~fp~LONGDOUBLE(v___ieee754_hypotf_~hb~0_30[31:31], v___ieee754_hypotf_~hb~0_30[30:23], v___ieee754_hypotf_~hb~0_30[22:0])) && \old(y) == y [2018-09-20 15:39:45,396 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v___ieee754_hypotf_~hb~0_30 : bv32 :: !(~bvadd64(~bvand32(v___ieee754_hypotf_~hb~0_30, 2147483647bv32), 2155872256bv32) == 0bv32) && \old(y) == ~fp~LONGDOUBLE(v___ieee754_hypotf_~hb~0_30[31:31], v___ieee754_hypotf_~hb~0_30[30:23], v___ieee754_hypotf_~hb~0_30[22:0])) && \old(y) == y [2018-09-20 15:39:45,397 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v___ieee754_hypotf_~hb~0_30 : bv32 :: !(~bvadd64(~bvand32(v___ieee754_hypotf_~hb~0_30, 2147483647bv32), 2155872256bv32) == 0bv32) && \old(y) == ~fp~LONGDOUBLE(v___ieee754_hypotf_~hb~0_30[31:31], v___ieee754_hypotf_~hb~0_30[30:23], v___ieee754_hypotf_~hb~0_30[22:0])) && \old(y) == y [2018-09-20 15:39:45,402 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v___ieee754_hypotf_~hb~0_30 : bv32 :: !(~bvadd64(~bvand32(v___ieee754_hypotf_~hb~0_30, 2147483647bv32), 2155872256bv32) == 0bv32) && \old(y) == ~fp~LONGDOUBLE(v___ieee754_hypotf_~hb~0_30[31:31], v___ieee754_hypotf_~hb~0_30[30:23], v___ieee754_hypotf_~hb~0_30[22:0])) && \old(y) == y [2018-09-20 15:39:45,456 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-09-20 15:39:45,456 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 15:39:45,458 INFO L168 Benchmark]: Toolchain (without parser) took 460223.59 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 237.0 MB). Free memory was 951.8 MB in the beginning and 1.2 GB in the end (delta: -253.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:39:45,458 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:39:45,459 INFO L168 Benchmark]: CACSL2BoogieTranslator took 476.09 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 935.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-09-20 15:39:45,459 INFO L168 Benchmark]: Boogie Preprocessor took 71.25 ms. Allocated memory is still 1.0 GB. Free memory was 935.7 MB in the beginning and 930.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:39:45,459 INFO L168 Benchmark]: RCFGBuilder took 2569.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 930.3 MB in the beginning and 1.1 GB in the end (delta: -146.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-09-20 15:39:45,460 INFO L168 Benchmark]: TraceAbstraction took 456950.11 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -136.7 MB). Peak memory consumption was 368.8 MB. Max. memory is 11.5 GB. [2018-09-20 15:39:45,460 INFO L168 Benchmark]: Witness Printer took 148.72 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2018-09-20 15:39:45,466 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 476.09 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 935.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.25 ms. Allocated memory is still 1.0 GB. Free memory was 935.7 MB in the beginning and 930.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2569.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 930.3 MB in the beginning and 1.1 GB in the end (delta: -146.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 456950.11 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -136.7 MB). Peak memory consumption was 368.8 MB. Max. memory is 11.5 GB. * Witness Printer took 148.72 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 235]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: \old(y) == y - InvariantResult [Line: 149]: Loop Invariant [2018-09-20 15:39:45,477 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,477 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,484 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,484 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,484 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,485 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,485 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,485 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] Derived loop invariant: (\exists v___ieee754_hypotf_~hb~0_30 : bv32 :: !(~bvadd64(~bvand32(v___ieee754_hypotf_~hb~0_30, 2147483647bv32), 2155872256bv32) == 0bv32) && \old(y) == ~fp~LONGDOUBLE(v___ieee754_hypotf_~hb~0_30[31:31], v___ieee754_hypotf_~hb~0_30[30:23], v___ieee754_hypotf_~hb~0_30[22:0])) && \old(y) == y - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 191]: Loop Invariant [2018-09-20 15:39:45,485 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,486 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,486 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,486 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,488 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,489 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,489 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,489 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] Derived loop invariant: (\exists v___ieee754_hypotf_~hb~0_30 : bv32 :: !(~bvadd64(~bvand32(v___ieee754_hypotf_~hb~0_30, 2147483647bv32), 2155872256bv32) == 0bv32) && \old(y) == ~fp~LONGDOUBLE(v___ieee754_hypotf_~hb~0_30[31:31], v___ieee754_hypotf_~hb~0_30[30:23], v___ieee754_hypotf_~hb~0_30[22:0])) && \old(y) == y - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 200]: Loop Invariant [2018-09-20 15:39:45,489 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,490 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,490 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,490 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,490 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,490 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,491 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,491 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] Derived loop invariant: (\exists v___ieee754_hypotf_~hb~0_30 : bv32 :: !(~bvadd64(~bvand32(v___ieee754_hypotf_~hb~0_30, 2147483647bv32), 2155872256bv32) == 0bv32) && \old(y) == ~fp~LONGDOUBLE(v___ieee754_hypotf_~hb~0_30[31:31], v___ieee754_hypotf_~hb~0_30[30:23], v___ieee754_hypotf_~hb~0_30[22:0])) && \old(y) == y - InvariantResult [Line: 134]: Loop Invariant [2018-09-20 15:39:45,491 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,491 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,494 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,495 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,495 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,496 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,496 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,496 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] Derived loop invariant: (\exists v___ieee754_hypotf_~hb~0_30 : bv32 :: !(~bvadd64(~bvand32(v___ieee754_hypotf_~hb~0_30, 2147483647bv32), 2155872256bv32) == 0bv32) && \old(y) == ~fp~LONGDOUBLE(v___ieee754_hypotf_~hb~0_30[31:31], v___ieee754_hypotf_~hb~0_30[30:23], v___ieee754_hypotf_~hb~0_30[22:0])) && \old(y) == y - InvariantResult [Line: 91]: Loop Invariant [2018-09-20 15:39:45,496 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_31,QUANTIFIED] [2018-09-20 15:39:45,497 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_31,QUANTIFIED] Derived loop invariant: \old(y) == y && (\exists v___ieee754_hypotf_~ha~0_31 : bv32 :: ~bvand32(v___ieee754_hypotf_~ha~0_31, 2147483647bv32) == ha) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 176]: Loop Invariant [2018-09-20 15:39:45,500 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,501 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,501 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,501 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,501 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,502 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,502 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,502 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] Derived loop invariant: (\exists v___ieee754_hypotf_~hb~0_30 : bv32 :: !(~bvadd64(~bvand32(v___ieee754_hypotf_~hb~0_30, 2147483647bv32), 2155872256bv32) == 0bv32) && \old(y) == ~fp~LONGDOUBLE(v___ieee754_hypotf_~hb~0_30[31:31], v___ieee754_hypotf_~hb~0_30[30:23], v___ieee754_hypotf_~hb~0_30[22:0])) && \old(y) == y - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 185]: Loop Invariant [2018-09-20 15:39:45,505 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,505 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,505 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,505 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,505 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,506 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,506 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,506 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] Derived loop invariant: (\exists v___ieee754_hypotf_~hb~0_30 : bv32 :: !(~bvadd64(~bvand32(v___ieee754_hypotf_~hb~0_30, 2147483647bv32), 2155872256bv32) == 0bv32) && \old(y) == ~fp~LONGDOUBLE(v___ieee754_hypotf_~hb~0_30[31:31], v___ieee754_hypotf_~hb~0_30[30:23], v___ieee754_hypotf_~hb~0_30[22:0])) && \old(y) == y - InvariantResult [Line: 161]: Loop Invariant [2018-09-20 15:39:45,506 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,507 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,507 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,507 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,507 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,510 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,510 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] [2018-09-20 15:39:45,510 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_30,QUANTIFIED] Derived loop invariant: (\exists v___ieee754_hypotf_~hb~0_30 : bv32 :: !(~bvadd64(~bvand32(v___ieee754_hypotf_~hb~0_30, 2147483647bv32), 2155872256bv32) == 0bv32) && \old(y) == ~fp~LONGDOUBLE(v___ieee754_hypotf_~hb~0_30[31:31], v___ieee754_hypotf_~hb~0_30[30:23], v___ieee754_hypotf_~hb~0_30[22:0])) && \old(y) == y - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 231 locations, 1 error locations. SAFE Result, 456.8s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 437.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 3156 SDtfs, 5342 SDslu, 26636 SDs, 0 SdLazy, 5207 SolverSat, 203 SolverUnsat, 156 SolverUnknown, 0 SolverNotchecked, 406.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1164 GetRequests, 886 SyntacticMatches, 1 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 34.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=274occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 641 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 117 PreInvPairs, 228 NumberOfFragments, 282 HoareAnnotationTreeSize, 117 FomulaSimplifications, 251108 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 25 FomulaSimplificationsInter, 1448 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 1029 NumberOfCodeBlocks, 1029 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1017 ConstructedInterpolants, 518 QuantifiedInterpolants, 1129832 SizeOfPredicates, 125 NumberOfNonLiveVariables, 1957 ConjunctsInSsa, 172 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...