/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1270a_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_1270a_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 fa333650cb1e4cf3e280683e8b2ad72d19029b0d ............................................................................................................................................................................................................................................................................................................................................................... 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_1270a_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 fa333650cb1e4cf3e280683e8b2ad72d19029b0d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:48,501 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:31:48,503 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:31:48,521 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:31:48,522 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:31:48,523 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:31:48,526 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:31:48,528 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:31:48,530 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:31:48,531 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:31:48,532 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:31:48,532 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:31:48,533 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:31:48,534 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:31:48,535 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:31:48,536 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:31:48,537 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:31:48,538 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:31:48,540 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:31:48,544 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:31:48,545 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:31:48,549 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:31:48,552 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:31:48,554 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:31:48,554 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:31:48,555 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:31:48,560 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:31:48,560 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:31:48,563 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:31:48,564 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:31:48,564 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:31:48,564 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:31:48,565 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:31:48,565 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:31:48,566 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:31:48,566 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:31:48,567 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:48,587 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:31:48,588 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:31:48,588 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:31:48,589 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:31:48,589 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:31:48,589 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:31:48,589 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:31:48,590 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:31:48,590 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:31:48,590 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-20 15:31:48,590 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:31:48,592 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:31:48,592 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:31:48,592 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:31:48,592 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:31:48,592 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:31:48,592 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:31:48,593 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:31:48,593 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:31:48,593 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:31:48,593 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:31:48,593 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:31:48,595 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:31:48,595 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:31:48,595 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:31:48,596 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:31:48,596 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-20 15:31:48,596 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:31:48,596 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-20 15:31:48,596 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 -> fa333650cb1e4cf3e280683e8b2ad72d19029b0d [2018-09-20 15:31:48,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:31:48,671 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:31:48,676 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:31:48,678 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:31:48,679 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:31:48,681 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1270a_true-unreach-call.c [2018-09-20 15:31:49,021 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f919abc5b/40bedbf944f3475ba0c99e51a6e6c283/FLAG413cf7bee [2018-09-20 15:31:49,178 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:31:49,179 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1270a_true-unreach-call.c [2018-09-20 15:31:49,188 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f919abc5b/40bedbf944f3475ba0c99e51a6e6c283/FLAG413cf7bee [2018-09-20 15:31:49,208 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f919abc5b/40bedbf944f3475ba0c99e51a6e6c283 [2018-09-20 15:31:49,211 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:31:49,215 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:31:49,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:31:49,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:31:49,223 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:31:49,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:31:49" (1/1) ... [2018-09-20 15:31:49,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c947712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:49, skipping insertion in model container [2018-09-20 15:31:49,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:31:49" (1/1) ... [2018-09-20 15:31:49,239 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:31:49,564 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:31:49,582 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:31:49,625 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:31:49,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:49 WrapperNode [2018-09-20 15:31:49,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:31:49,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:31:49,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:31:49,680 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:31:49,696 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:49" (1/1) ... [2018-09-20 15:31:49,696 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:49" (1/1) ... [2018-09-20 15:31:49,713 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:49" (1/1) ... [2018-09-20 15:31:49,714 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:49" (1/1) ... [2018-09-20 15:31:49,729 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:49" (1/1) ... [2018-09-20 15:31:49,749 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:49" (1/1) ... [2018-09-20 15:31:49,755 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:49" (1/1) ... [2018-09-20 15:31:49,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:31:49,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:31:49,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:31:49,769 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:31:49,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:49" (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:49,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:31:49,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:31:49,926 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2018-09-20 15:31:49,926 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_hypotf [2018-09-20 15:31:49,926 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2018-09-20 15:31:49,926 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:31:49,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:31:49,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-09-20 15:31:49,926 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2018-09-20 15:31:49,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:31:49,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-09-20 15:31:49,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-09-20 15:31:49,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:31:49,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-09-20 15:31:49,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-09-20 15:31:49,927 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_hypotf [2018-09-20 15:31:49,928 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2018-09-20 15:31:49,928 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:31:49,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:31:49,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:31:49,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2018-09-20 15:31:49,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-09-20 15:31:51,372 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:31:51,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:31:51 BoogieIcfgContainer [2018-09-20 15:31:51,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:31:51,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:31:51,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:31:51,377 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:31:51,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:31:49" (1/3) ... [2018-09-20 15:31:51,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1dcdad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:31:51, skipping insertion in model container [2018-09-20 15:31:51,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:49" (2/3) ... [2018-09-20 15:31:51,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1dcdad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:31:51, skipping insertion in model container [2018-09-20 15:31:51,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:31:51" (3/3) ... [2018-09-20 15:31:51,381 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270a_true-unreach-call.c [2018-09-20 15:31:51,391 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:31:51,400 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 15:31:51,448 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:31:51,448 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:31:51,449 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:31:51,449 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:31:51,449 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:31:51,449 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:31:51,449 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:31:51,450 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:31:51,450 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:31:51,478 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states. [2018-09-20 15:31:51,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-20 15:31:51,492 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:51,493 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:31:51,496 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:51,502 INFO L82 PathProgramCache]: Analyzing trace with hash 2013009825, now seen corresponding path program 1 times [2018-09-20 15:31:51,505 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:31:51,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:31:51,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:51,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:51,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:51,666 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:31:51,669 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:51,669 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:31:51,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:31:51,687 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:31:51,688 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:31:51,691 INFO L87 Difference]: Start difference. First operand 232 states. Second operand 2 states. [2018-09-20 15:31:51,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:51,754 INFO L93 Difference]: Finished difference Result 456 states and 573 transitions. [2018-09-20 15:31:51,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:31:51,755 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 28 [2018-09-20 15:31:51,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:51,770 INFO L225 Difference]: With dead ends: 456 [2018-09-20 15:31:51,770 INFO L226 Difference]: Without dead ends: 228 [2018-09-20 15:31:51,777 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:31:51,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-09-20 15:31:51,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-09-20 15:31:51,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-09-20 15:31:51,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 250 transitions. [2018-09-20 15:31:51,845 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 250 transitions. Word has length 28 [2018-09-20 15:31:51,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:51,845 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 250 transitions. [2018-09-20 15:31:51,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:31:51,846 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 250 transitions. [2018-09-20 15:31:51,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-20 15:31:51,850 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:51,850 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:31:51,850 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:51,851 INFO L82 PathProgramCache]: Analyzing trace with hash 237649631, now seen corresponding path program 1 times [2018-09-20 15:31:51,851 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:31:51,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:31:51,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:51,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:51,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:31:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:31:52,142 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-20 15:31:52,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 03:31:52 BoogieIcfgContainer [2018-09-20 15:31:52,236 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 15:31:52,237 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 15:31:52,237 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 15:31:52,237 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 15:31:52,238 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:31:51" (3/4) ... [2018-09-20 15:31:52,243 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-09-20 15:31:52,244 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 15:31:52,244 INFO L168 Benchmark]: Toolchain (without parser) took 3032.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 954.5 MB in the beginning and 1.0 GB in the end (delta: -79.4 MB). Peak memory consumption was 61.1 MB. Max. memory is 11.5 GB. [2018-09-20 15:31:52,247 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:31:52,248 INFO L168 Benchmark]: CACSL2BoogieTranslator took 463.07 ms. Allocated memory is still 1.0 GB. Free memory was 954.5 MB in the beginning and 938.4 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:31:52,249 INFO L168 Benchmark]: Boogie Preprocessor took 88.81 ms. Allocated memory is still 1.0 GB. Free memory was 938.4 MB in the beginning and 933.1 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:31:52,250 INFO L168 Benchmark]: RCFGBuilder took 1604.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -142.0 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:31:52,251 INFO L168 Benchmark]: TraceAbstraction took 862.28 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: 41.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 11.5 GB. [2018-09-20 15:31:52,252 INFO L168 Benchmark]: Witness Printer took 7.07 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:31:52,259 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 463.07 ms. Allocated memory is still 1.0 GB. Free memory was 954.5 MB in the beginning and 938.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 88.81 ms. Allocated memory is still 1.0 GB. Free memory was 938.4 MB in the beginning and 933.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1604.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -142.0 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 862.28 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: 41.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 11.5 GB. * Witness Printer took 7.07 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: 234]: 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)=10737418246, \old(tiny_sqrt)=10737418251, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L229] float x = 1.0f / 0.0f; [L230] float y = __VERIFIER_nondet_float(); [L231] CALL, EXPR __ieee754_hypotf(x, y) VAL [\old(x)=10737418243, \old(y)=10737418252, 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)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L86] FCALL ieee_float_shape_type gf_u; VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418249:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L87] FCALL gf_u.value = (x) VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418249:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L88] EXPR, FCALL gf_u.word VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418249:0}, gf_u.word=6442450944, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L88] (ha) = gf_u.word VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418249:0}, gf_u.word=6442450944, ha=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L88] FCALL (ha) = gf_u.word VAL [(ha) = gf_u.word=10737418247, \old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418249:0}, gf_u.word=6442450944, ha=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L89] COND FALSE !(0) VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, ha=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L90] ha &= 0x7fffffffL VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L92] FCALL ieee_float_shape_type gf_u; VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418255:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L93] FCALL gf_u.value = (y) VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418255:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L94] EXPR, FCALL gf_u.word VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418255:0}, gf_u.word=10737418240, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L94] (hb) = gf_u.word VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418255:0}, gf_u.word=10737418240, hb=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L94] FCALL (hb) = gf_u.word VAL [(hb) = gf_u.word=10737418256, \old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418255:0}, gf_u.word=10737418240, hb=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L95] COND FALSE !(0) VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, hb=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L96] hb &= 0x7fffffffL VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L97] COND TRUE hb > ha [L98] a = y [L99] b = x [L100] j = ha [L101] ha = hb [L102] hb = j VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418252, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L108] FCALL ieee_float_shape_type sf_u; VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418252, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418245:0}, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L109] FCALL sf_u.word = (ha) VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418252, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418245:0}, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L110] EXPR, FCALL sf_u.value VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418252, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418245:0}, sf_u.value=10737418257, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L110] (a) = sf_u.value VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418245:0}, sf_u.value=10737418257, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L110] FCALL (a) = sf_u.value VAL [(a) = sf_u.value=10737418254, \old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418245:0}, sf_u.value=10737418257, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L111] COND FALSE !(0) VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L113] FCALL ieee_float_shape_type sf_u; VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418255:0}, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L114] FCALL sf_u.word = (hb) VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418255:0}, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L115] EXPR, FCALL sf_u.value VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418255:0}, sf_u.value=10737418256, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L115] (b) = sf_u.value VAL [\old(x)=10737418243, \old(y)=10737418252, 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=10737418243, y=10737418252] [L115] FCALL (b) = sf_u.value VAL [(b) = sf_u.value=10737418253, \old(x)=10737418243, \old(y)=10737418252, 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=10737418243, y=10737418252] [L116] COND FALSE !(0) VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418256, ha=251658240, hb=-1, j=-1, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L117] COND TRUE (ha - hb) > 0xf000000L [L118] RET return a + b; VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418256, ha=251658240, hb=-1, j=-1, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L231] EXPR __ieee754_hypotf(x, y) VAL [__ieee754_hypotf(x, y)=10737418241, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L231] float res = __ieee754_hypotf(x, y); [L233] 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={10737418244:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418241] [L215] FCALL gf_u.value = (x) VAL [\old(x)=10737418241, gf_u={10737418244:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418241] [L216] EXPR, FCALL gf_u.word VAL [\old(x)=10737418241, gf_u={10737418244: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={10737418244: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=10737418250, \old(x)=10737418241, gf_u={10737418244: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] [L233] EXPR isinf_float(res) VAL [isinf_float(res)=0, one_sqrt=1, res=10737418241, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L233] COND TRUE !isinf_float(res) [L234] __VERIFIER_error() VAL [one_sqrt=1, res=10737418241, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 232 locations, 1 error locations. UNSAFE Result, 0.7s 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:31:54,615 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:31:54,618 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:31:54,629 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:31:54,630 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:31:54,631 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:31:54,632 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:31:54,634 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:31:54,636 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:31:54,637 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:31:54,638 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:31:54,639 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:31:54,640 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:31:54,641 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:31:54,642 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:31:54,643 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:31:54,644 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:31:54,646 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:31:54,649 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:31:54,650 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:31:54,652 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:31:54,653 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:31:54,656 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:31:54,656 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:31:54,656 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:31:54,658 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:31:54,659 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:31:54,660 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:31:54,661 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:31:54,662 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:31:54,663 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:31:54,663 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:31:54,664 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:31:54,664 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:31:54,665 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:31:54,666 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:31:54,667 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:31:54,693 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:31:54,693 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:31:54,694 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:31:54,694 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:31:54,695 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:31:54,695 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:31:54,695 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:31:54,695 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:31:54,696 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:31:54,696 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:31:54,697 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:31:54,697 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:31:54,697 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:31:54,697 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:31:54,697 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-20 15:31:54,697 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-20 15:31:54,698 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:31:54,698 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:31:54,698 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:31:54,698 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:31:54,698 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:31:54,700 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:31:54,700 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:31:54,700 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:31:54,701 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:31:54,701 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:31:54,701 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:31:54,701 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-20 15:31:54,702 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:31:54,702 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-20 15:31:54,702 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-20 15:31:54,702 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 -> fa333650cb1e4cf3e280683e8b2ad72d19029b0d [2018-09-20 15:31:54,751 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:31:54,772 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:31:54,777 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:31:54,778 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:31:54,779 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:31:54,780 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1270a_true-unreach-call.c [2018-09-20 15:31:55,161 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c36c33d6/d856aab614c947be8fb6604c753b4c46/FLAG7ed8092c5 [2018-09-20 15:31:55,357 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:31:55,358 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1270a_true-unreach-call.c [2018-09-20 15:31:55,375 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c36c33d6/d856aab614c947be8fb6604c753b4c46/FLAG7ed8092c5 [2018-09-20 15:31:55,392 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c36c33d6/d856aab614c947be8fb6604c753b4c46 [2018-09-20 15:31:55,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:31:55,400 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:31:55,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:31:55,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:31:55,410 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:31:55,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:31:55" (1/1) ... [2018-09-20 15:31:55,415 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:31:55, skipping insertion in model container [2018-09-20 15:31:55,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:31:55" (1/1) ... [2018-09-20 15:31:55,428 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:31:55,708 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:31:55,729 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:31:55,832 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:31:55,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:55 WrapperNode [2018-09-20 15:31:55,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:31:55,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:31:55,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:31:55,895 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:31:55,912 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:55" (1/1) ... [2018-09-20 15:31:55,913 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:55" (1/1) ... [2018-09-20 15:31:55,945 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:55" (1/1) ... [2018-09-20 15:31:55,948 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:55" (1/1) ... [2018-09-20 15:31:55,983 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:55" (1/1) ... [2018-09-20 15:31:55,999 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:55" (1/1) ... [2018-09-20 15:31:56,007 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:55" (1/1) ... [2018-09-20 15:31:56,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:31:56,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:31:56,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:31:56,020 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:31:56,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:55" (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:56,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:31:56,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:31:56,176 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2018-09-20 15:31:56,177 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_hypotf [2018-09-20 15:31:56,177 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2018-09-20 15:31:56,177 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:31:56,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:31:56,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-09-20 15:31:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2018-09-20 15:31:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:31:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-09-20 15:31:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-20 15:31:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:31:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-20 15:31:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-09-20 15:31:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_hypotf [2018-09-20 15:31:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2018-09-20 15:31:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:31:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:31:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:31:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4 [2018-09-20 15:31:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-20 15:31:56,474 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:31:56,518 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:31:56,656 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:31:56,665 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:31:56,713 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:31:56,721 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:31:57,741 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:31:57,746 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:31:58,456 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:31:58,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:31:58 BoogieIcfgContainer [2018-09-20 15:31:58,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:31:58,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:31:58,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:31:58,462 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:31:58,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:31:55" (1/3) ... [2018-09-20 15:31:58,463 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:31:58, skipping insertion in model container [2018-09-20 15:31:58,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:55" (2/3) ... [2018-09-20 15:31:58,464 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:31:58, skipping insertion in model container [2018-09-20 15:31:58,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:31:58" (3/3) ... [2018-09-20 15:31:58,466 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270a_true-unreach-call.c [2018-09-20 15:31:58,474 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:31:58,482 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 15:31:58,527 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:31:58,528 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:31:58,528 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:31:58,528 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:31:58,528 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:31:58,528 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:31:58,528 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:31:58,528 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:31:58,529 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:31:58,553 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states. [2018-09-20 15:31:58,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-20 15:31:58,565 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:58,567 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:31:58,572 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:58,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1998677788, now seen corresponding path program 1 times [2018-09-20 15:31:58,581 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:31:58,581 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:31:58,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:58,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:31:58,724 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:31:58,724 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:31:58,743 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:58,744 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:31:58,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:31:58,766 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:31:58,767 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:31:58,770 INFO L87 Difference]: Start difference. First operand 231 states. Second operand 2 states. [2018-09-20 15:31:58,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:58,855 INFO L93 Difference]: Finished difference Result 454 states and 571 transitions. [2018-09-20 15:31:58,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:31:58,859 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-09-20 15:31:58,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:58,885 INFO L225 Difference]: With dead ends: 454 [2018-09-20 15:31:58,885 INFO L226 Difference]: Without dead ends: 227 [2018-09-20 15:31:58,896 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:31:58,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-09-20 15:31:58,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-09-20 15:31:58,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-20 15:31:58,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 249 transitions. [2018-09-20 15:31:58,972 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 249 transitions. Word has length 27 [2018-09-20 15:31:58,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:58,972 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 249 transitions. [2018-09-20 15:31:58,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:31:58,973 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 249 transitions. [2018-09-20 15:31:58,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-20 15:31:58,977 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:58,977 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:31:58,978 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:58,978 INFO L82 PathProgramCache]: Analyzing trace with hash -711257081, now seen corresponding path program 1 times [2018-09-20 15:31:58,980 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:31:58,980 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:31:58,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:59,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:31:59,209 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:31:59,223 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:31:59,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:31:59,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:31:59,317 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:31:59,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:31:59,442 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:31:59,461 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:31:59,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:31:59,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:31:59,513 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:31:59,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:00,473 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:00,473 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:00,494 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:00,494 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-20 15:32:00,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-20 15:32:00,498 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-20 15:32:00,498 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-20 15:32:00,498 INFO L87 Difference]: Start difference. First operand 227 states and 249 transitions. Second operand 11 states. [2018-09-20 15:32:40,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:40,662 INFO L93 Difference]: Finished difference Result 532 states and 580 transitions. [2018-09-20 15:32:40,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-20 15:32:40,707 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-09-20 15:32:40,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:40,714 INFO L225 Difference]: With dead ends: 532 [2018-09-20 15:32:40,714 INFO L226 Difference]: Without dead ends: 411 [2018-09-20 15:32:40,717 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2018-09-20 15:32:40,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-09-20 15:32:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 268. [2018-09-20 15:32:40,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-09-20 15:32:40,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 293 transitions. [2018-09-20 15:32:40,757 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 293 transitions. Word has length 72 [2018-09-20 15:32:40,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:40,758 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 293 transitions. [2018-09-20 15:32:40,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-20 15:32:40,758 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 293 transitions. [2018-09-20 15:32:40,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-20 15:32:40,764 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:40,764 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:40,764 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:40,764 INFO L82 PathProgramCache]: Analyzing trace with hash -463110587, now seen corresponding path program 1 times [2018-09-20 15:32:40,765 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:40,766 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:32:40,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:40,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:40,927 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:40,945 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:40,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:40,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:40,973 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:40,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:40,993 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:40,997 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:40,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:41,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:41,002 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:41,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:41,294 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:41,299 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:41,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:41,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:41,367 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:41,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2018-09-20 15:32:41,479 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:41,487 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:41,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:41,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:41,517 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:41,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:29 [2018-09-20 15:32:41,715 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:41,721 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:41,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:41,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:41,759 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:41,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:36 [2018-09-20 15:32:41,874 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:41,880 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:41,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:41,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:41,944 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:41,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:57, output treesize:38 [2018-09-20 15:32:45,662 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:45,665 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:45,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:45,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:45,680 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:45,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:45,906 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:45,925 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:45,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:45,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:45,938 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:45,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:47,284 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:47,285 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:47,301 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:47,301 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-09-20 15:32:47,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-20 15:32:47,302 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-20 15:32:47,304 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2018-09-20 15:32:47,304 INFO L87 Difference]: Start difference. First operand 268 states and 293 transitions. Second operand 24 states. [2018-09-20 15:32:59,884 WARN L178 SmtUtils]: Spent 909.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-09-20 15:33:01,924 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-20 15:33:03,872 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-20 15:33:15,091 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-09-20 15:33:38,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:33:38,219 INFO L93 Difference]: Finished difference Result 321 states and 351 transitions. [2018-09-20 15:33:38,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-20 15:33:38,232 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2018-09-20 15:33:38,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:33:38,235 INFO L225 Difference]: With dead ends: 321 [2018-09-20 15:33:38,235 INFO L226 Difference]: Without dead ends: 314 [2018-09-20 15:33:38,237 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=271, Invalid=2279, Unknown=0, NotChecked=0, Total=2550 [2018-09-20 15:33:38,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-09-20 15:33:38,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 268. [2018-09-20 15:33:38,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-09-20 15:33:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 292 transitions. [2018-09-20 15:33:38,270 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 292 transitions. Word has length 72 [2018-09-20 15:33:38,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:33:38,270 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 292 transitions. [2018-09-20 15:33:38,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-20 15:33:38,271 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 292 transitions. [2018-09-20 15:33:38,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-20 15:33:38,273 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:33:38,273 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:33:38,273 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:33:38,274 INFO L82 PathProgramCache]: Analyzing trace with hash -463560330, now seen corresponding path program 1 times [2018-09-20 15:33:38,274 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:33:38,274 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:33:38,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:33:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:33:38,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:33:38,460 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:38,474 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:38,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:38,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:38,531 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:33:38,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:33:38,551 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:38,557 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:38,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:38,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:38,564 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:33:38,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:33:38,738 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:33:38,745 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:33:38,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:38,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:38,761 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:33:38,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-09-20 15:33:38,826 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:33:38,838 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:33:38,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:38,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:38,859 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:38,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:25 [2018-09-20 15:33:39,387 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:39,391 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:39,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:39,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:39,429 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:33:39,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:33:39,518 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:39,535 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:39,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:39,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:39,546 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:33:39,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:33:39,932 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:39,933 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:33:39,944 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:33:39,944 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-09-20 15:33:39,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-20 15:33:39,945 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-20 15:33:39,945 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-09-20 15:33:39,945 INFO L87 Difference]: Start difference. First operand 268 states and 292 transitions. Second operand 22 states. [2018-09-20 15:34:51,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:34:51,465 INFO L93 Difference]: Finished difference Result 450 states and 487 transitions. [2018-09-20 15:34:51,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-20 15:34:51,476 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2018-09-20 15:34:51,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:34:51,479 INFO L225 Difference]: With dead ends: 450 [2018-09-20 15:34:51,479 INFO L226 Difference]: Without dead ends: 442 [2018-09-20 15:34:51,481 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=194, Invalid=1876, Unknown=0, NotChecked=0, Total=2070 [2018-09-20 15:34:51,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-09-20 15:34:51,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 271. [2018-09-20 15:34:51,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-09-20 15:34:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 297 transitions. [2018-09-20 15:34:51,503 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 297 transitions. Word has length 77 [2018-09-20 15:34:51,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:34:51,504 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 297 transitions. [2018-09-20 15:34:51,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-20 15:34:51,504 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 297 transitions. [2018-09-20 15:34:51,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-20 15:34:51,505 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:34:51,506 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:34:51,506 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:34:51,506 INFO L82 PathProgramCache]: Analyzing trace with hash -244705612, now seen corresponding path program 1 times [2018-09-20 15:34:51,506 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:34:51,507 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:34:51,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:34:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:34:51,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:34:51,655 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:51,658 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:51,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:34:51,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:34:51,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:34:51,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:34:51,687 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:51,690 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:51,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:34:51,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:34:51,696 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:51,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:34:51,922 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:51,922 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:34:51,933 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:34:51,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-20 15:34:51,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-20 15:34:51,934 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-20 15:34:51,934 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-20 15:34:51,934 INFO L87 Difference]: Start difference. First operand 271 states and 297 transitions. Second operand 10 states. [2018-09-20 15:35:44,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:35:44,811 INFO L93 Difference]: Finished difference Result 557 states and 600 transitions. [2018-09-20 15:35:44,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-20 15:35:44,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2018-09-20 15:35:44,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:35:44,828 INFO L225 Difference]: With dead ends: 557 [2018-09-20 15:35:44,828 INFO L226 Difference]: Without dead ends: 306 [2018-09-20 15:35:44,829 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-09-20 15:35:44,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-09-20 15:35:44,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 251. [2018-09-20 15:35:44,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-20 15:35:44,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 270 transitions. [2018-09-20 15:35:44,847 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 270 transitions. Word has length 77 [2018-09-20 15:35:44,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:35:44,848 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 270 transitions. [2018-09-20 15:35:44,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-20 15:35:44,849 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 270 transitions. [2018-09-20 15:35:44,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-20 15:35:44,850 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:35:44,850 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:44,852 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:35:44,852 INFO L82 PathProgramCache]: Analyzing trace with hash 988789622, now seen corresponding path program 1 times [2018-09-20 15:35:44,852 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:35:44,853 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:35:44,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:35:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:35:44,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:35:45,011 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:45,014 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:45,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:35:45,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:45,024 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:35:45,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:13 [2018-09-20 15:35:45,056 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:45,059 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:45,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:35:45,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:45,156 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:35:45,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:15 [2018-09-20 15:35:45,342 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:45,346 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:45,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:35:45,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:45,364 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:45,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:35:45,406 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:45,409 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:45,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:35:45,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:45,414 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:45,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:35:45,596 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:45,596 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:35:45,617 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:35:45,618 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-09-20 15:35:45,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-20 15:35:45,618 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-20 15:35:45,619 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-09-20 15:35:45,619 INFO L87 Difference]: Start difference. First operand 251 states and 270 transitions. Second operand 16 states. [2018-09-20 15:35:59,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:35:59,410 INFO L93 Difference]: Finished difference Result 314 states and 337 transitions. [2018-09-20 15:35:59,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-20 15:35:59,410 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2018-09-20 15:35:59,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:35:59,413 INFO L225 Difference]: With dead ends: 314 [2018-09-20 15:35:59,413 INFO L226 Difference]: Without dead ends: 306 [2018-09-20 15:35:59,414 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2018-09-20 15:35:59,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-09-20 15:35:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 251. [2018-09-20 15:35:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-20 15:35:59,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 269 transitions. [2018-09-20 15:35:59,433 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 269 transitions. Word has length 77 [2018-09-20 15:35:59,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:35:59,433 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 269 transitions. [2018-09-20 15:35:59,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-20 15:35:59,434 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 269 transitions. [2018-09-20 15:35:59,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-20 15:35:59,436 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:35:59,436 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:59,436 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:35:59,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1207644340, now seen corresponding path program 1 times [2018-09-20 15:35:59,437 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:35:59,437 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) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-20 15:35:59,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:35:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:35:59,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:35:59,570 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:59,573 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:59,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:35:59,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:59,587 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:59,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:35:59,604 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:59,607 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:59,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:35:59,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:59,612 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:59,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:35:59,687 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:35:59,693 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:35:59,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:35:59,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:59,707 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:35:59,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-09-20 15:35:59,757 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:35:59,761 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:35:59,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:35:59,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:35:59,775 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:35:59,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:25 [2018-09-20 15:36:00,171 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:00,174 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:00,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:36:00,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:36:00,187 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:00,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:36:00,254 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:00,261 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:00,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:36:00,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:36:00,267 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:00,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:36:00,566 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:00,566 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:36:00,578 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:36:00,578 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-09-20 15:36:00,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-20 15:36:00,579 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-20 15:36:00,579 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-09-20 15:36:00,579 INFO L87 Difference]: Start difference. First operand 251 states and 269 transitions. Second operand 21 states. [2018-09-20 15:36:25,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:36:25,140 INFO L93 Difference]: Finished difference Result 258 states and 276 transitions. [2018-09-20 15:36:25,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-20 15:36:25,140 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 77 [2018-09-20 15:36:25,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:36:25,143 INFO L225 Difference]: With dead ends: 258 [2018-09-20 15:36:25,143 INFO L226 Difference]: Without dead ends: 225 [2018-09-20 15:36:25,144 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=179, Invalid=1627, Unknown=0, NotChecked=0, Total=1806 [2018-09-20 15:36:25,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-09-20 15:36:25,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-09-20 15:36:25,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-20 15:36:25,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 242 transitions. [2018-09-20 15:36:25,163 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 242 transitions. Word has length 77 [2018-09-20 15:36:25,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:36:25,167 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 242 transitions. [2018-09-20 15:36:25,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-20 15:36:25,167 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 242 transitions. [2018-09-20 15:36:25,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-20 15:36:25,168 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:36:25,168 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:36:25,168 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:36:25,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1253625132, now seen corresponding path program 1 times [2018-09-20 15:36:25,169 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:36:25,169 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:36:25,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:36:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:36:25,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:36:25,295 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:25,299 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:25,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:36:25,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:36:25,315 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:25,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:36:25,334 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:25,336 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:25,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:36:25,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:36:25,354 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:25,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:36:25,804 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:25,804 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:36:25,814 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:36:25,814 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-20 15:36:25,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-20 15:36:25,816 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-20 15:36:25,816 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-20 15:36:25,816 INFO L87 Difference]: Start difference. First operand 225 states and 242 transitions. Second operand 11 states. [2018-09-20 15:37:14,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:37:14,020 INFO L93 Difference]: Finished difference Result 403 states and 431 transitions. [2018-09-20 15:37:14,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-20 15:37:14,021 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-09-20 15:37:14,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:37:14,022 INFO L225 Difference]: With dead ends: 403 [2018-09-20 15:37:14,023 INFO L226 Difference]: Without dead ends: 245 [2018-09-20 15:37:14,024 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2018-09-20 15:37:14,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-09-20 15:37:14,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 191. [2018-09-20 15:37:14,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-20 15:37:14,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 205 transitions. [2018-09-20 15:37:14,044 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 205 transitions. Word has length 96 [2018-09-20 15:37:14,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:37:14,044 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 205 transitions. [2018-09-20 15:37:14,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-20 15:37:14,044 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 205 transitions. [2018-09-20 15:37:14,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-20 15:37:14,047 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:37:14,047 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] [2018-09-20 15:37:14,047 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:37:14,049 INFO L82 PathProgramCache]: Analyzing trace with hash -621518797, now seen corresponding path program 1 times [2018-09-20 15:37:14,049 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:37:14,049 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:37:14,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:37:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:37:14,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:37:14,505 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:14,510 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:14,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:37:14,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:37:14,524 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:14,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:37:14,543 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:14,549 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:14,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:37:14,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:37:14,558 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:14,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:37:14,704 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:14,710 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:14,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:37:14,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:37:14,726 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:14,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-09-20 15:37:14,776 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:14,780 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:14,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:37:14,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:37:14,792 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:14,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:25 [2018-09-20 15:37:18,004 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-09-20 15:37:20,068 WARN L819 $PredicateComparison]: unable to prove that (exists ((__ieee754_hypotf_~a~0 (_ FloatingPoint 8 24)) (v___ieee754_hypotf_~ha~0_34 (_ BitVec 32))) (and (let ((.cse0 (let ((.cse1 (bvand v___ieee754_hypotf_~ha~0_34 (_ bv2147483647 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (fp.gt (fp.sub RNE __ieee754_hypotf_~a~0 .cse0) .cse0)) (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_34) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_34) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_34)) |c___ieee754_hypotf_#in~x|))) is different from true [2018-09-20 15:37:20,225 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:20,225 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:37:20,243 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:37:20,243 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-20 15:37:20,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-20 15:37:20,244 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-20 15:37:20,244 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=132, Unknown=2, NotChecked=22, Total=182 [2018-09-20 15:37:20,244 INFO L87 Difference]: Start difference. First operand 191 states and 205 transitions. Second operand 14 states. [2018-09-20 15:37:24,105 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-20 15:37:27,844 WARN L178 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-09-20 15:37:39,170 WARN L178 SmtUtils]: Spent 6.29 s on a formula simplification that was a NOOP. DAG size: 34 [2018-09-20 15:38:15,092 WARN L178 SmtUtils]: Spent 721.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-09-20 15:38:48,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:38:48,544 INFO L93 Difference]: Finished difference Result 267 states and 285 transitions. [2018-09-20 15:38:48,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-20 15:38:48,554 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 105 [2018-09-20 15:38:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:38:48,557 INFO L225 Difference]: With dead ends: 267 [2018-09-20 15:38:48,557 INFO L226 Difference]: Without dead ends: 246 [2018-09-20 15:38:48,558 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 34.7s TimeCoverageRelationStatistics Valid=139, Invalid=667, Unknown=10, NotChecked=54, Total=870 [2018-09-20 15:38:48,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-09-20 15:38:48,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 208. [2018-09-20 15:38:48,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-09-20 15:38:48,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 224 transitions. [2018-09-20 15:38:48,593 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 224 transitions. Word has length 105 [2018-09-20 15:38:48,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:38:48,594 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 224 transitions. [2018-09-20 15:38:48,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-20 15:38:48,595 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 224 transitions. [2018-09-20 15:38:48,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-20 15:38:48,597 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:38:48,597 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:48,597 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:38:48,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1651996947, now seen corresponding path program 1 times [2018-09-20 15:38:48,602 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:38:48,602 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) [2018-09-20 15:38:48,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-09-20 15:38:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:38:49,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:38:49,185 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:49,188 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:49,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:38:49,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:38:49,199 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:38:49,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:38:49,216 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:49,244 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:49,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:38:49,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:38:49,295 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:38:49,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:38:50,057 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,057 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:38:50,084 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:38:50,084 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-20 15:38:50,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-20 15:38:50,085 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-20 15:38:50,085 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-20 15:38:50,085 INFO L87 Difference]: Start difference. First operand 208 states and 224 transitions. Second operand 11 states. [2018-09-20 15:39:19,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:39:19,052 INFO L93 Difference]: Finished difference Result 278 states and 295 transitions. [2018-09-20 15:39:19,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-20 15:39:19,053 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 116 [2018-09-20 15:39:19,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:39:19,055 INFO L225 Difference]: With dead ends: 278 [2018-09-20 15:39:19,055 INFO L226 Difference]: Without dead ends: 221 [2018-09-20 15:39:19,055 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-09-20 15:39:19,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-09-20 15:39:19,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 208. [2018-09-20 15:39:19,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-09-20 15:39:19,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 223 transitions. [2018-09-20 15:39:19,081 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 223 transitions. Word has length 116 [2018-09-20 15:39:19,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:39:19,081 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 223 transitions. [2018-09-20 15:39:19,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-20 15:39:19,081 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 223 transitions. [2018-09-20 15:39:19,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-20 15:39:19,084 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:39:19,085 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:39:19,085 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:39:19,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1722647778, now seen corresponding path program 1 times [2018-09-20 15:39:19,086 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:39:19,086 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:19,094 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:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:39:19,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:39:19,585 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:19,597 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:19,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:39:19,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:39:19,611 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:39:19,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:39:19,627 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:19,630 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:19,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:39:19,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:19,635 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:39:19,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:39:19,853 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:39:19,867 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:39:19,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:39:19,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:39:19,881 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:39:19,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-09-20 15:39:19,935 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:39:19,940 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:39:19,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:39:19,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:39:19,955 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:19,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:25 [2018-09-20 15:39:22,212 WARN L178 SmtUtils]: Spent 446.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-09-20 15:39:36,971 WARN L178 SmtUtils]: Spent 769.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-20 15:39:37,183 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:37,183 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:39:37,197 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:39:37,197 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-20 15:39:37,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-20 15:39:37,198 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-20 15:39:37,198 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=152, Unknown=4, NotChecked=0, Total=182 [2018-09-20 15:39:37,198 INFO L87 Difference]: Start difference. First operand 208 states and 223 transitions. Second operand 14 states. [2018-09-20 15:40:13,721 WARN L178 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-09-20 15:40:23,983 WARN L178 SmtUtils]: Spent 4.22 s on a formula simplification that was a NOOP. DAG size: 34 [2018-09-20 15:40:57,352 WARN L178 SmtUtils]: Spent 548.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-09-20 15:41:22,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:41:22,505 INFO L93 Difference]: Finished difference Result 240 states and 254 transitions. [2018-09-20 15:41:22,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-20 15:41:22,506 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 116 [2018-09-20 15:41:22,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:41:22,508 INFO L225 Difference]: With dead ends: 240 [2018-09-20 15:41:22,508 INFO L226 Difference]: Without dead ends: 191 [2018-09-20 15:41:22,509 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 65.1s TimeCoverageRelationStatistics Valid=141, Invalid=710, Unknown=19, NotChecked=0, Total=870 [2018-09-20 15:41:22,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-09-20 15:41:22,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-09-20 15:41:22,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-20 15:41:22,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 204 transitions. [2018-09-20 15:41:22,531 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 204 transitions. Word has length 116 [2018-09-20 15:41:22,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:41:22,531 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 204 transitions. [2018-09-20 15:41:22,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-20 15:41:22,531 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 204 transitions. [2018-09-20 15:41:22,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-20 15:41:22,535 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:41:22,535 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:41:22,535 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:41:22,536 INFO L82 PathProgramCache]: Analyzing trace with hash -58261069, now seen corresponding path program 1 times [2018-09-20 15:41:22,536 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:41:22,536 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:41:22,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:41:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:41:22,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:41:23,006 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:41:23,006 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:41:23,019 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:41:23,020 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:41:23,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:41:23,020 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:41:23,020 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:41:23,021 INFO L87 Difference]: Start difference. First operand 191 states and 204 transitions. Second operand 4 states. [2018-09-20 15:41:27,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:41:27,394 INFO L93 Difference]: Finished difference Result 212 states and 224 transitions. [2018-09-20 15:41:27,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:41:27,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2018-09-20 15:41:27,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:41:27,441 INFO L225 Difference]: With dead ends: 212 [2018-09-20 15:41:27,441 INFO L226 Difference]: Without dead ends: 191 [2018-09-20 15:41:27,443 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:41:27,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-09-20 15:41:27,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-09-20 15:41:27,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-20 15:41:27,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 203 transitions. [2018-09-20 15:41:27,465 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 203 transitions. Word has length 126 [2018-09-20 15:41:27,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:41:27,467 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 203 transitions. [2018-09-20 15:41:27,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:41:27,467 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 203 transitions. [2018-09-20 15:41:27,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-09-20 15:41:27,468 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:41:27,468 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:41:27,470 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:41:27,470 INFO L82 PathProgramCache]: Analyzing trace with hash -2018577566, now seen corresponding path program 1 times [2018-09-20 15:41:27,471 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:41:27,471 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-09-20 15:41:27,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:41:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:41:28,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:41:28,035 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:41:28,044 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:41:28,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:41:28,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:41:28,057 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:41:28,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:41:28,074 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:41:28,077 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:41:28,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:41:28,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:41:28,084 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:41:28,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:41:29,052 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:41:29,053 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:41:29,075 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:41:29,075 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-20 15:41:29,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-20 15:41:29,075 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-20 15:41:29,076 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-09-20 15:41:29,076 INFO L87 Difference]: Start difference. First operand 191 states and 203 transitions. Second operand 12 states. [2018-09-20 15:41:47,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:41:47,099 INFO L93 Difference]: Finished difference Result 224 states and 235 transitions. [2018-09-20 15:41:47,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-20 15:41:47,100 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 137 [2018-09-20 15:41:47,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:41:47,102 INFO L225 Difference]: With dead ends: 224 [2018-09-20 15:41:47,102 INFO L226 Difference]: Without dead ends: 178 [2018-09-20 15:41:47,103 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-09-20 15:41:47,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-09-20 15:41:47,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-09-20 15:41:47,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-09-20 15:41:47,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 188 transitions. [2018-09-20 15:41:47,123 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 188 transitions. Word has length 137 [2018-09-20 15:41:47,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:41:47,123 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 188 transitions. [2018-09-20 15:41:47,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-20 15:41:47,123 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 188 transitions. [2018-09-20 15:41:47,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-20 15:41:47,127 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:41:47,127 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:41:47,127 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:41:47,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1803771518, now seen corresponding path program 1 times [2018-09-20 15:41:47,128 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:41:47,128 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-09-20 15:41:47,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:41:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:41:47,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:41:47,794 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:41:47,797 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:41:47,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:41:47,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:41:47,812 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:41:47,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:41:47,829 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:41:47,832 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:41:47,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:41:47,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:41:47,838 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:41:47,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:41:49,078 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:41:49,078 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:41:49,093 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:41:49,093 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-20 15:41:49,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-20 15:41:49,094 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-20 15:41:49,094 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-09-20 15:41:49,095 INFO L87 Difference]: Start difference. First operand 178 states and 188 transitions. Second operand 12 states. [2018-09-20 15:42:01,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:42:01,352 INFO L93 Difference]: Finished difference Result 178 states and 188 transitions. [2018-09-20 15:42:01,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-20 15:42:01,354 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 148 [2018-09-20 15:42:01,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:42:01,354 INFO L225 Difference]: With dead ends: 178 [2018-09-20 15:42:01,354 INFO L226 Difference]: Without dead ends: 0 [2018-09-20 15:42:01,355 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-09-20 15:42:01,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-20 15:42:01,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-20 15:42:01,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-20 15:42:01,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-20 15:42:01,356 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 148 [2018-09-20 15:42:01,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:42:01,356 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-20 15:42:01,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-20 15:42:01,356 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-20 15:42:01,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-20 15:42:01,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-20 15:42:01,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-20 15:42:01,881 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 19 [2018-09-20 15:42:02,215 WARN L178 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 19 [2018-09-20 15:42:02,474 WARN L178 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 19 [2018-09-20 15:42:03,166 WARN L178 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 19 [2018-09-20 15:42:03,918 WARN L178 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 19 [2018-09-20 15:42:04,030 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 19 [2018-09-20 15:42:04,171 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 16 [2018-09-20 15:42:04,284 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 19 [2018-09-20 15:42:04,377 INFO L426 ceAbstractionStarter]: For program point L216(line 216) no Hoare annotation was computed. [2018-09-20 15:42:04,378 INFO L426 ceAbstractionStarter]: For program point L215(line 215) no Hoare annotation was computed. [2018-09-20 15:42:04,378 INFO L426 ceAbstractionStarter]: For program point L216-1(line 216) no Hoare annotation was computed. [2018-09-20 15:42:04,378 INFO L426 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2018-09-20 15:42:04,378 INFO L426 ceAbstractionStarter]: For program point L216-2(line 216) no Hoare annotation was computed. [2018-09-20 15:42:04,378 INFO L426 ceAbstractionStarter]: For program point L214-1(line 214) no Hoare annotation was computed. [2018-09-20 15:42:04,378 INFO L426 ceAbstractionStarter]: For program point L214-2(line 214) no Hoare annotation was computed. [2018-09-20 15:42:04,378 INFO L426 ceAbstractionStarter]: For program point L213-1(lines 213 217) no Hoare annotation was computed. [2018-09-20 15:42:04,378 INFO L426 ceAbstractionStarter]: For program point L214-3(line 214) no Hoare annotation was computed. [2018-09-20 15:42:04,379 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:42:04,379 INFO L426 ceAbstractionStarter]: For program point L213-4(lines 213 217) no Hoare annotation was computed. [2018-09-20 15:42:04,379 INFO L429 ceAbstractionStarter]: At program point isinf_floatENTRY(lines 211 220) the Hoare annotation is: true [2018-09-20 15:42:04,379 INFO L426 ceAbstractionStarter]: For program point isinf_floatEXIT(lines 211 220) no Hoare annotation was computed. [2018-09-20 15:42:04,379 INFO L426 ceAbstractionStarter]: For program point isinf_floatFINAL(lines 211 220) no Hoare annotation was computed. [2018-09-20 15:42:04,379 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-20 15:42:04,379 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-09-20 15:42:04,379 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-20 15:42:04,379 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-20 15:42:04,379 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-20 15:42:04,379 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-20 15:42:04,379 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-20 15:42:04,380 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 234) no Hoare annotation was computed. [2018-09-20 15:42:04,380 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 222 238) the Hoare annotation is: true [2018-09-20 15:42:04,380 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 222 238) no Hoare annotation was computed. [2018-09-20 15:42:04,380 INFO L426 ceAbstractionStarter]: For program point L234(line 234) no Hoare annotation was computed. [2018-09-20 15:42:04,380 INFO L422 ceAbstractionStarter]: At program point L233(line 233) the Hoare annotation is: (and (= main_~res~0 (fp (_ bv0 1) (_ bv255 8) (_ bv0 23))) (= (fp.div RNE ((_ to_fp 8 24) RNE 1.0) (_ +zero 8 24)) main_~x~0)) [2018-09-20 15:42:04,380 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 222 238) no Hoare annotation was computed. [2018-09-20 15:42:04,380 INFO L426 ceAbstractionStarter]: For program point L233-1(lines 233 236) no Hoare annotation was computed. [2018-09-20 15:42:04,380 INFO L422 ceAbstractionStarter]: At program point L231(line 231) the Hoare annotation is: (= (fp.div RNE ((_ to_fp 8 24) RNE 1.0) (_ +zero 8 24)) main_~x~0) [2018-09-20 15:42:04,380 INFO L426 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2018-09-20 15:42:04,381 INFO L426 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-09-20 15:42:04,381 INFO L426 ceAbstractionStarter]: For program point L85-1(lines 85 89) no Hoare annotation was computed. [2018-09-20 15:42:04,381 INFO L422 ceAbstractionStarter]: At program point L85-3(lines 85 89) the Hoare annotation is: (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x) [2018-09-20 15:42:04,381 INFO L426 ceAbstractionStarter]: For program point L85-4(lines 85 89) no Hoare annotation was computed. [2018-09-20 15:42:04,381 INFO L426 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-09-20 15:42:04,381 INFO L426 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-09-20 15:42:04,381 INFO L426 ceAbstractionStarter]: For program point L201-1(line 201) no Hoare annotation was computed. [2018-09-20 15:42:04,381 INFO L426 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-09-20 15:42:04,381 INFO L426 ceAbstractionStarter]: For program point L201-2(line 201) no Hoare annotation was computed. [2018-09-20 15:42:04,381 INFO L426 ceAbstractionStarter]: For program point L135-1(line 135) no Hoare annotation was computed. [2018-09-20 15:42:04,381 INFO L426 ceAbstractionStarter]: For program point L201-3(line 201) no Hoare annotation was computed. [2018-09-20 15:42:04,381 INFO L426 ceAbstractionStarter]: For program point L135-2(line 135) no Hoare annotation was computed. [2018-09-20 15:42:04,382 INFO L426 ceAbstractionStarter]: For program point L135-3(line 135) no Hoare annotation was computed. [2018-09-20 15:42:04,382 INFO L426 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-09-20 15:42:04,382 INFO L426 ceAbstractionStarter]: For program point L185-1(lines 185 189) no Hoare annotation was computed. [2018-09-20 15:42:04,382 INFO L426 ceAbstractionStarter]: For program point L152-1(line 152) no Hoare annotation was computed. [2018-09-20 15:42:04,382 INFO L426 ceAbstractionStarter]: For program point L86(line 86) no Hoare annotation was computed. [2018-09-20 15:42:04,382 INFO L426 ceAbstractionStarter]: For program point L152-2(line 152) no Hoare annotation was computed. [2018-09-20 15:42:04,382 INFO L422 ceAbstractionStarter]: At program point L185-3(lines 185 189) the Hoare annotation is: (and (exists ((v___ieee754_hypotf_~ha~0_29 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_29) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_29) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_29)) |__ieee754_hypotf_#in~x|) (not (= (bvadd (bvand v___ieee754_hypotf_~ha~0_29 (_ bv2147483647 32)) (_ bv2155872256 32)) (_ bv0 32))))) (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x)) [2018-09-20 15:42:04,382 INFO L426 ceAbstractionStarter]: For program point L86-1(line 86) no Hoare annotation was computed. [2018-09-20 15:42:04,382 INFO L426 ceAbstractionStarter]: For program point L185-4(lines 185 189) no Hoare annotation was computed. [2018-09-20 15:42:04,382 INFO L426 ceAbstractionStarter]: For program point L86-2(line 86) no Hoare annotation was computed. [2018-09-20 15:42:04,383 INFO L426 ceAbstractionStarter]: For program point L86-3(line 86) no Hoare annotation was computed. [2018-09-20 15:42:04,383 INFO L426 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-09-20 15:42:04,383 INFO L426 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-09-20 15:42:04,383 INFO L426 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-09-20 15:42:04,383 INFO L426 ceAbstractionStarter]: For program point L169-1(line 169) no Hoare annotation was computed. [2018-09-20 15:42:04,383 INFO L426 ceAbstractionStarter]: For program point L169-2(line 169) no Hoare annotation was computed. [2018-09-20 15:42:04,383 INFO L426 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-09-20 15:42:04,383 INFO L426 ceAbstractionStarter]: For program point L186-1(line 186) no Hoare annotation was computed. [2018-09-20 15:42:04,383 INFO L426 ceAbstractionStarter]: For program point L186-2(line 186) no Hoare annotation was computed. [2018-09-20 15:42:04,383 INFO L426 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-09-20 15:42:04,383 INFO L426 ceAbstractionStarter]: For program point L186-3(line 186) no Hoare annotation was computed. [2018-09-20 15:42:04,384 INFO L426 ceAbstractionStarter]: For program point __ieee754_hypotfFINAL(lines 81 208) no Hoare annotation was computed. [2018-09-20 15:42:04,384 INFO L426 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2018-09-20 15:42:04,384 INFO L426 ceAbstractionStarter]: For program point L203-1(line 203) no Hoare annotation was computed. [2018-09-20 15:42:04,384 INFO L426 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2018-09-20 15:42:04,384 INFO L426 ceAbstractionStarter]: For program point L203-2(line 203) no Hoare annotation was computed. [2018-09-20 15:42:04,384 INFO L426 ceAbstractionStarter]: For program point __ieee754_hypotfEXIT(lines 81 208) no Hoare annotation was computed. [2018-09-20 15:42:04,384 INFO L426 ceAbstractionStarter]: For program point L137-1(line 137) no Hoare annotation was computed. [2018-09-20 15:42:04,384 INFO L426 ceAbstractionStarter]: For program point L137-2(line 137) no Hoare annotation was computed. [2018-09-20 15:42:04,384 INFO L426 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-09-20 15:42:04,384 INFO L426 ceAbstractionStarter]: For program point L121(lines 121 144) no Hoare annotation was computed. [2018-09-20 15:42:04,384 INFO L426 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-09-20 15:42:04,385 INFO L426 ceAbstractionStarter]: For program point L121-1(lines 81 208) no Hoare annotation was computed. [2018-09-20 15:42:04,385 INFO L426 ceAbstractionStarter]: For program point L88-1(line 88) no Hoare annotation was computed. [2018-09-20 15:42:04,385 INFO L426 ceAbstractionStarter]: For program point L88-2(line 88) no Hoare annotation was computed. [2018-09-20 15:42:04,385 INFO L426 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2018-09-20 15:42:04,385 INFO L426 ceAbstractionStarter]: For program point L188-1(line 188) no Hoare annotation was computed. [2018-09-20 15:42:04,385 INFO L426 ceAbstractionStarter]: For program point L122(lines 122 129) no Hoare annotation was computed. [2018-09-20 15:42:04,385 INFO L426 ceAbstractionStarter]: For program point L188-2(line 188) no Hoare annotation was computed. [2018-09-20 15:42:04,385 INFO L426 ceAbstractionStarter]: For program point L139(lines 139 143) no Hoare annotation was computed. [2018-09-20 15:42:04,385 INFO L426 ceAbstractionStarter]: For program point L139-2(lines 121 144) no Hoare annotation was computed. [2018-09-20 15:42:04,385 INFO L426 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-09-20 15:42:04,385 INFO L426 ceAbstractionStarter]: For program point L107(lines 107 111) no Hoare annotation was computed. [2018-09-20 15:42:04,386 INFO L426 ceAbstractionStarter]: For program point L140-1(line 140) no Hoare annotation was computed. [2018-09-20 15:42:04,386 INFO L426 ceAbstractionStarter]: For program point L140-2(line 140) no Hoare annotation was computed. [2018-09-20 15:42:04,386 INFO L426 ceAbstractionStarter]: For program point L107-2(lines 81 208) no Hoare annotation was computed. [2018-09-20 15:42:04,386 INFO L426 ceAbstractionStarter]: For program point L140-3(line 140) no Hoare annotation was computed. [2018-09-20 15:42:04,386 INFO L426 ceAbstractionStarter]: For program point L124(lines 124 125) no Hoare annotation was computed. [2018-09-20 15:42:04,386 INFO L426 ceAbstractionStarter]: For program point L91-1(lines 91 95) no Hoare annotation was computed. [2018-09-20 15:42:04,386 INFO L426 ceAbstractionStarter]: For program point L124-2(lines 122 129) no Hoare annotation was computed. [2018-09-20 15:42:04,386 INFO L422 ceAbstractionStarter]: At program point L91-3(lines 91 95) the Hoare annotation is: (and (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x) (exists ((v___ieee754_hypotf_~ha~0_36 (_ BitVec 32))) (and (= (bvand v___ieee754_hypotf_~ha~0_36 (_ bv2147483647 32)) __ieee754_hypotf_~ha~0) (= |__ieee754_hypotf_#in~x| (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_36) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_36) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_36)))))) [2018-09-20 15:42:04,386 INFO L426 ceAbstractionStarter]: For program point L91-4(lines 91 95) no Hoare annotation was computed. [2018-09-20 15:42:04,386 INFO L426 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-09-20 15:42:04,393 INFO L426 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-09-20 15:42:04,394 INFO L426 ceAbstractionStarter]: For program point L108-1(line 108) no Hoare annotation was computed. [2018-09-20 15:42:04,394 INFO L426 ceAbstractionStarter]: For program point L108-2(line 108) no Hoare annotation was computed. [2018-09-20 15:42:04,394 INFO L426 ceAbstractionStarter]: For program point L108-3(line 108) no Hoare annotation was computed. [2018-09-20 15:42:04,394 INFO L426 ceAbstractionStarter]: For program point L191-1(lines 191 195) no Hoare annotation was computed. [2018-09-20 15:42:04,394 INFO L426 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2018-09-20 15:42:04,394 INFO L422 ceAbstractionStarter]: At program point L191-3(lines 191 195) the Hoare annotation is: (and (exists ((v___ieee754_hypotf_~ha~0_29 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_29) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_29) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_29)) |__ieee754_hypotf_#in~x|) (not (= (bvadd (bvand v___ieee754_hypotf_~ha~0_29 (_ bv2147483647 32)) (_ bv2155872256 32)) (_ bv0 32))))) (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x)) [2018-09-20 15:42:04,394 INFO L426 ceAbstractionStarter]: For program point L92-1(line 92) no Hoare annotation was computed. [2018-09-20 15:42:04,394 INFO L426 ceAbstractionStarter]: For program point L191-4(lines 191 195) no Hoare annotation was computed. [2018-09-20 15:42:04,394 INFO L426 ceAbstractionStarter]: For program point L92-2(line 92) no Hoare annotation was computed. [2018-09-20 15:42:04,394 INFO L426 ceAbstractionStarter]: For program point L92-3(line 92) no Hoare annotation was computed. [2018-09-20 15:42:04,394 INFO L426 ceAbstractionStarter]: For program point L175(lines 175 198) no Hoare annotation was computed. [2018-09-20 15:42:04,395 INFO L426 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-09-20 15:42:04,395 INFO L426 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-09-20 15:42:04,395 INFO L426 ceAbstractionStarter]: For program point L142-1(line 142) no Hoare annotation was computed. [2018-09-20 15:42:04,395 INFO L426 ceAbstractionStarter]: For program point L175-2(lines 81 208) no Hoare annotation was computed. [2018-09-20 15:42:04,395 INFO L426 ceAbstractionStarter]: For program point L142-2(line 142) no Hoare annotation was computed. [2018-09-20 15:42:04,395 INFO L426 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-09-20 15:42:04,395 INFO L426 ceAbstractionStarter]: For program point L192-1(line 192) no Hoare annotation was computed. [2018-09-20 15:42:04,395 INFO L426 ceAbstractionStarter]: For program point L192-2(line 192) no Hoare annotation was computed. [2018-09-20 15:42:04,395 INFO L426 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-09-20 15:42:04,395 INFO L426 ceAbstractionStarter]: For program point L126-1(lines 126 127) no Hoare annotation was computed. [2018-09-20 15:42:04,395 INFO L426 ceAbstractionStarter]: For program point L192-3(line 192) no Hoare annotation was computed. [2018-09-20 15:42:04,395 INFO L426 ceAbstractionStarter]: For program point L176-1(lines 176 180) no Hoare annotation was computed. [2018-09-20 15:42:04,396 INFO L426 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-09-20 15:42:04,396 INFO L426 ceAbstractionStarter]: For program point L110-1(line 110) no Hoare annotation was computed. [2018-09-20 15:42:04,396 INFO L422 ceAbstractionStarter]: At program point L176-3(lines 176 180) the Hoare annotation is: (and (exists ((v___ieee754_hypotf_~ha~0_29 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_29) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_29) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_29)) |__ieee754_hypotf_#in~x|) (not (= (bvadd (bvand v___ieee754_hypotf_~ha~0_29 (_ bv2147483647 32)) (_ bv2155872256 32)) (_ bv0 32))))) (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x)) [2018-09-20 15:42:04,396 INFO L426 ceAbstractionStarter]: For program point L110-2(line 110) no Hoare annotation was computed. [2018-09-20 15:42:04,396 INFO L426 ceAbstractionStarter]: For program point L176-4(lines 176 180) no Hoare annotation was computed. [2018-09-20 15:42:04,396 INFO L426 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-09-20 15:42:04,396 INFO L426 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-09-20 15:42:04,396 INFO L426 ceAbstractionStarter]: For program point L94-1(line 94) no Hoare annotation was computed. [2018-09-20 15:42:04,396 INFO L426 ceAbstractionStarter]: For program point L94-2(line 94) no Hoare annotation was computed. [2018-09-20 15:42:04,396 INFO L426 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-09-20 15:42:04,396 INFO L426 ceAbstractionStarter]: For program point L177-1(line 177) no Hoare annotation was computed. [2018-09-20 15:42:04,397 INFO L426 ceAbstractionStarter]: For program point L177-2(line 177) no Hoare annotation was computed. [2018-09-20 15:42:04,397 INFO L426 ceAbstractionStarter]: For program point L177-3(line 177) no Hoare annotation was computed. [2018-09-20 15:42:04,397 INFO L426 ceAbstractionStarter]: For program point L194(line 194) no Hoare annotation was computed. [2018-09-20 15:42:04,397 INFO L426 ceAbstractionStarter]: For program point L194-1(line 194) no Hoare annotation was computed. [2018-09-20 15:42:04,397 INFO L426 ceAbstractionStarter]: For program point L161-1(lines 161 165) no Hoare annotation was computed. [2018-09-20 15:42:04,397 INFO L426 ceAbstractionStarter]: For program point L194-2(line 194) no Hoare annotation was computed. [2018-09-20 15:42:04,397 INFO L422 ceAbstractionStarter]: At program point L161-3(lines 161 165) the Hoare annotation is: (and (exists ((v___ieee754_hypotf_~ha~0_29 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_29) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_29) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_29)) |__ieee754_hypotf_#in~x|) (not (= (bvadd (bvand v___ieee754_hypotf_~ha~0_29 (_ bv2147483647 32)) (_ bv2155872256 32)) (_ bv0 32))))) (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x)) [2018-09-20 15:42:04,397 INFO L426 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-09-20 15:42:04,397 INFO L426 ceAbstractionStarter]: For program point L145(lines 145 172) no Hoare annotation was computed. [2018-09-20 15:42:04,397 INFO L426 ceAbstractionStarter]: For program point L112(lines 112 116) no Hoare annotation was computed. [2018-09-20 15:42:04,397 INFO L426 ceAbstractionStarter]: For program point L112-2(lines 81 208) no Hoare annotation was computed. [2018-09-20 15:42:04,397 INFO L426 ceAbstractionStarter]: For program point L112-3(lines 81 208) no Hoare annotation was computed. [2018-09-20 15:42:04,398 INFO L429 ceAbstractionStarter]: At program point __ieee754_hypotfENTRY(lines 81 208) the Hoare annotation is: true [2018-09-20 15:42:04,398 INFO L426 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-09-20 15:42:04,398 INFO L426 ceAbstractionStarter]: For program point L162-1(line 162) no Hoare annotation was computed. [2018-09-20 15:42:04,398 INFO L426 ceAbstractionStarter]: For program point L162-2(line 162) no Hoare annotation was computed. [2018-09-20 15:42:04,398 INFO L426 ceAbstractionStarter]: For program point L162-3(line 162) no Hoare annotation was computed. [2018-09-20 15:42:04,398 INFO L426 ceAbstractionStarter]: For program point L179(line 179) no Hoare annotation was computed. [2018-09-20 15:42:04,398 INFO L426 ceAbstractionStarter]: For program point L146(lines 146 171) no Hoare annotation was computed. [2018-09-20 15:42:04,398 INFO L426 ceAbstractionStarter]: For program point L179-1(line 179) no Hoare annotation was computed. [2018-09-20 15:42:04,398 INFO L426 ceAbstractionStarter]: For program point L113(line 113) no Hoare annotation was computed. [2018-09-20 15:42:04,398 INFO L426 ceAbstractionStarter]: For program point L179-2(line 179) no Hoare annotation was computed. [2018-09-20 15:42:04,398 INFO L426 ceAbstractionStarter]: For program point L113-1(line 113) no Hoare annotation was computed. [2018-09-20 15:42:04,398 INFO L426 ceAbstractionStarter]: For program point L113-2(line 113) no Hoare annotation was computed. [2018-09-20 15:42:04,399 INFO L426 ceAbstractionStarter]: For program point L113-3(line 113) no Hoare annotation was computed. [2018-09-20 15:42:04,399 INFO L426 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-09-20 15:42:04,399 INFO L426 ceAbstractionStarter]: For program point L97(lines 97 106) no Hoare annotation was computed. [2018-09-20 15:42:04,399 INFO L426 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-09-20 15:42:04,399 INFO L422 ceAbstractionStarter]: At program point L197(line 197) the Hoare annotation is: (and (exists ((v___ieee754_hypotf_~ha~0_29 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_29) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_29) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_29)) |__ieee754_hypotf_#in~x|) (not (= (bvadd (bvand v___ieee754_hypotf_~ha~0_29 (_ bv2147483647 32)) (_ bv2155872256 32)) (_ bv0 32))))) (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x)) [2018-09-20 15:42:04,399 INFO L426 ceAbstractionStarter]: For program point L164(line 164) no Hoare annotation was computed. [2018-09-20 15:42:04,399 INFO L426 ceAbstractionStarter]: For program point L197-1(line 197) no Hoare annotation was computed. [2018-09-20 15:42:04,399 INFO L426 ceAbstractionStarter]: For program point L164-1(line 164) no Hoare annotation was computed. [2018-09-20 15:42:04,399 INFO L426 ceAbstractionStarter]: For program point L164-2(line 164) no Hoare annotation was computed. [2018-09-20 15:42:04,399 INFO L426 ceAbstractionStarter]: For program point L148(lines 148 171) no Hoare annotation was computed. [2018-09-20 15:42:04,400 INFO L426 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-09-20 15:42:04,400 INFO L426 ceAbstractionStarter]: For program point L115-1(line 115) no Hoare annotation was computed. [2018-09-20 15:42:04,400 INFO L426 ceAbstractionStarter]: For program point L115-2(line 115) no Hoare annotation was computed. [2018-09-20 15:42:04,400 INFO L422 ceAbstractionStarter]: At program point L182(line 182) the Hoare annotation is: (and (exists ((v___ieee754_hypotf_~ha~0_29 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_29) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_29) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_29)) |__ieee754_hypotf_#in~x|) (not (= (bvadd (bvand v___ieee754_hypotf_~ha~0_29 (_ bv2147483647 32)) (_ bv2155872256 32)) (_ bv0 32))))) (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x)) [2018-09-20 15:42:04,400 INFO L426 ceAbstractionStarter]: For program point L182-1(line 182) no Hoare annotation was computed. [2018-09-20 15:42:04,400 INFO L426 ceAbstractionStarter]: For program point L149-1(lines 149 153) no Hoare annotation was computed. [2018-09-20 15:42:04,400 INFO L422 ceAbstractionStarter]: At program point L149-3(lines 149 153) the Hoare annotation is: (and (exists ((v___ieee754_hypotf_~ha~0_29 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_29) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_29) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_29)) |__ieee754_hypotf_#in~x|) (not (= (bvadd (bvand v___ieee754_hypotf_~ha~0_29 (_ bv2147483647 32)) (_ bv2155872256 32)) (_ bv0 32))))) (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x)) [2018-09-20 15:42:04,400 INFO L426 ceAbstractionStarter]: For program point L149-4(lines 149 153) no Hoare annotation was computed. [2018-09-20 15:42:04,400 INFO L426 ceAbstractionStarter]: For program point L166(lines 166 170) no Hoare annotation was computed. [2018-09-20 15:42:04,400 INFO L426 ceAbstractionStarter]: For program point L166-2(lines 157 171) no Hoare annotation was computed. [2018-09-20 15:42:04,401 INFO L426 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-09-20 15:42:04,401 INFO L426 ceAbstractionStarter]: For program point L150-1(line 150) no Hoare annotation was computed. [2018-09-20 15:42:04,401 INFO L426 ceAbstractionStarter]: For program point L150-2(line 150) no Hoare annotation was computed. [2018-09-20 15:42:04,401 INFO L426 ceAbstractionStarter]: For program point L150-3(line 150) no Hoare annotation was computed. [2018-09-20 15:42:04,401 INFO L426 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2018-09-20 15:42:04,401 INFO L426 ceAbstractionStarter]: For program point L200-1(lines 200 204) no Hoare annotation was computed. [2018-09-20 15:42:04,401 INFO L426 ceAbstractionStarter]: For program point L167-1(line 167) no Hoare annotation was computed. [2018-09-20 15:42:04,401 INFO L426 ceAbstractionStarter]: For program point L134-1(lines 134 138) no Hoare annotation was computed. [2018-09-20 15:42:04,401 INFO L426 ceAbstractionStarter]: For program point L167-2(line 167) no Hoare annotation was computed. [2018-09-20 15:42:04,401 INFO L422 ceAbstractionStarter]: At program point L200-3(lines 200 204) the Hoare annotation is: (and (exists ((v___ieee754_hypotf_~ha~0_29 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_29) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_29) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_29)) |__ieee754_hypotf_#in~x|) (not (= (bvadd (bvand v___ieee754_hypotf_~ha~0_29 (_ bv2147483647 32)) (_ bv2155872256 32)) (_ bv0 32))))) (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x)) [2018-09-20 15:42:04,402 INFO L426 ceAbstractionStarter]: For program point L167-3(line 167) no Hoare annotation was computed. [2018-09-20 15:42:04,402 INFO L426 ceAbstractionStarter]: For program point L200-4(lines 200 204) no Hoare annotation was computed. [2018-09-20 15:42:04,402 INFO L422 ceAbstractionStarter]: At program point L134-3(lines 134 138) the Hoare annotation is: (and (exists ((v___ieee754_hypotf_~ha~0_29 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_29) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_29) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_29)) |__ieee754_hypotf_#in~x|) (not (= (bvadd (bvand v___ieee754_hypotf_~ha~0_29 (_ bv2147483647 32)) (_ bv2155872256 32)) (_ bv0 32))))) (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x)) [2018-09-20 15:42:04,402 INFO L426 ceAbstractionStarter]: For program point L35-2(lines 35 39) no Hoare annotation was computed. [2018-09-20 15:42:04,402 INFO L426 ceAbstractionStarter]: For program point L52(lines 52 56) no Hoare annotation was computed. [2018-09-20 15:42:04,402 INFO L426 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2018-09-20 15:42:04,402 INFO L426 ceAbstractionStarter]: For program point L52-2(lines 52 56) no Hoare annotation was computed. [2018-09-20 15:42:04,402 INFO L429 ceAbstractionStarter]: At program point L19-3(lines 19 23) the Hoare annotation is: true [2018-09-20 15:42:04,402 INFO L426 ceAbstractionStarter]: For program point L19-4(lines 19 23) no Hoare annotation was computed. [2018-09-20 15:42:04,402 INFO L426 ceAbstractionStarter]: For program point L36-1(lines 36 37) no Hoare annotation was computed. [2018-09-20 15:42:04,403 INFO L426 ceAbstractionStarter]: For program point L36-3(lines 36 37) no Hoare annotation was computed. [2018-09-20 15:42:04,403 INFO L429 ceAbstractionStarter]: At program point L36-4(lines 36 37) the Hoare annotation is: true [2018-09-20 15:42:04,403 INFO L426 ceAbstractionStarter]: For program point L36-5(lines 36 37) no Hoare annotation was computed. [2018-09-20 15:42:04,403 INFO L426 ceAbstractionStarter]: For program point L61(lines 61 70) no Hoare annotation was computed. [2018-09-20 15:42:04,403 INFO L426 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-09-20 15:42:04,403 INFO L426 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-09-20 15:42:04,403 INFO L426 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. [2018-09-20 15:42:04,403 INFO L426 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-09-20 15:42:04,403 INFO L429 ceAbstractionStarter]: At program point __ieee754_sqrtfENTRY(lines 14 79) the Hoare annotation is: true [2018-09-20 15:42:04,403 INFO L426 ceAbstractionStarter]: For program point __ieee754_sqrtfFINAL(lines 14 79) no Hoare annotation was computed. [2018-09-20 15:42:04,404 INFO L426 ceAbstractionStarter]: For program point L29(lines 29 30) no Hoare annotation was computed. [2018-09-20 15:42:04,404 INFO L426 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-09-20 15:42:04,404 INFO L426 ceAbstractionStarter]: For program point __ieee754_sqrtfEXIT(lines 14 79) no Hoare annotation was computed. [2018-09-20 15:42:04,404 INFO L426 ceAbstractionStarter]: For program point L63(lines 63 69) no Hoare annotation was computed. [2018-09-20 15:42:04,404 INFO L426 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-09-20 15:42:04,405 INFO L426 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2018-09-20 15:42:04,405 INFO L426 ceAbstractionStarter]: For program point L22-2(line 22) no Hoare annotation was computed. [2018-09-20 15:42:04,405 INFO L426 ceAbstractionStarter]: For program point L31(lines 31 32) no Hoare annotation was computed. [2018-09-20 15:42:04,406 INFO L426 ceAbstractionStarter]: For program point L73-1(lines 73 77) no Hoare annotation was computed. [2018-09-20 15:42:04,406 INFO L429 ceAbstractionStarter]: At program point L73-3(lines 73 77) the Hoare annotation is: true [2018-09-20 15:42:04,406 INFO L426 ceAbstractionStarter]: For program point L73-4(lines 73 77) no Hoare annotation was computed. [2018-09-20 15:42:04,406 INFO L426 ceAbstractionStarter]: For program point L65(lines 65 68) no Hoare annotation was computed. [2018-09-20 15:42:04,406 INFO L426 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2018-09-20 15:42:04,406 INFO L426 ceAbstractionStarter]: For program point L74-1(line 74) no Hoare annotation was computed. [2018-09-20 15:42:04,406 INFO L426 ceAbstractionStarter]: For program point L74-2(line 74) no Hoare annotation was computed. [2018-09-20 15:42:04,406 INFO L426 ceAbstractionStarter]: For program point L74-3(line 74) no Hoare annotation was computed. [2018-09-20 15:42:04,406 INFO L426 ceAbstractionStarter]: For program point L50-1(lines 50 59) no Hoare annotation was computed. [2018-09-20 15:42:04,406 INFO L429 ceAbstractionStarter]: At program point L50-3(lines 50 59) the Hoare annotation is: true [2018-09-20 15:42:04,406 INFO L426 ceAbstractionStarter]: For program point L50-4(lines 14 79) no Hoare annotation was computed. [2018-09-20 15:42:04,406 INFO L426 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-09-20 15:42:04,406 INFO L426 ceAbstractionStarter]: For program point L42(lines 42 43) no Hoare annotation was computed. [2018-09-20 15:42:04,406 INFO L426 ceAbstractionStarter]: For program point L42-2(lines 42 43) no Hoare annotation was computed. [2018-09-20 15:42:04,406 INFO L426 ceAbstractionStarter]: For program point L26(lines 26 27) no Hoare annotation was computed. [2018-09-20 15:42:04,406 INFO L426 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-09-20 15:42:04,406 INFO L426 ceAbstractionStarter]: For program point L76-1(line 76) no Hoare annotation was computed. [2018-09-20 15:42:04,406 INFO L426 ceAbstractionStarter]: For program point L76-2(line 76) no Hoare annotation was computed. [2018-09-20 15:42:04,407 INFO L426 ceAbstractionStarter]: For program point L35(lines 35 39) no Hoare annotation was computed. [2018-09-20 15:42:04,435 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,436 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,436 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,436 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,440 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,440 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,440 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,440 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,441 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,441 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,442 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,442 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,453 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,453 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,453 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,453 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,454 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,454 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,460 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,460 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,461 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,461 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,461 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,461 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,464 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,465 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,465 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,465 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,469 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,469 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,469 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,469 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,472 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_36,QUANTIFIED] [2018-09-20 15:42:04,472 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_36,QUANTIFIED] [2018-09-20 15:42:04,472 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_36,QUANTIFIED] [2018-09-20 15:42:04,472 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_36,QUANTIFIED] [2018-09-20 15:42:04,474 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_36,QUANTIFIED] [2018-09-20 15:42:04,474 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_36,QUANTIFIED] [2018-09-20 15:42:04,475 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_36,QUANTIFIED] [2018-09-20 15:42:04,475 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_36,QUANTIFIED] [2018-09-20 15:42:04,476 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,476 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,476 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,476 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,477 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,477 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,477 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,477 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,484 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,484 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,484 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,484 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,485 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,485 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,485 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,485 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,486 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,486 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,486 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,486 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,490 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,490 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,490 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,490 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 03:42:04 BoogieIcfgContainer [2018-09-20 15:42:04,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 15:42:04,496 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 15:42:04,496 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 15:42:04,496 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 15:42:04,498 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:31:58" (3/4) ... [2018-09-20 15:42:04,502 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-09-20 15:42:04,511 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-09-20 15:42:04,512 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure isinf_float [2018-09-20 15:42:04,513 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-09-20 15:42:04,513 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __ieee754_hypotf [2018-09-20 15:42:04,513 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __ieee754_sqrtf [2018-09-20 15:42:04,528 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 54 nodes and edges [2018-09-20 15:42:04,531 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2018-09-20 15:42:04,533 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-09-20 15:42:04,560 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-09-20 15:42:04,560 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-09-20 15:42:04,560 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x && (\exists v___ieee754_hypotf_~ha~0_36 : bv32 :: ~bvand32(v___ieee754_hypotf_~ha~0_36, 2147483647bv32) == ha && \old(x) == ~fp~LONGDOUBLE(v___ieee754_hypotf_~ha~0_36[31:31], v___ieee754_hypotf_~ha~0_36[30:23], v___ieee754_hypotf_~ha~0_36[22:0])) [2018-09-20 15:42:04,561 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v___ieee754_hypotf_~ha~0_29 : bv32 :: ~fp~LONGDOUBLE(v___ieee754_hypotf_~ha~0_29[31:31], v___ieee754_hypotf_~ha~0_29[30:23], v___ieee754_hypotf_~ha~0_29[22:0]) == \old(x) && !(~bvadd64(~bvand32(v___ieee754_hypotf_~ha~0_29, 2147483647bv32), 2155872256bv32) == 0bv32)) && \old(x) == x [2018-09-20 15:42:04,561 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v___ieee754_hypotf_~ha~0_29 : bv32 :: ~fp~LONGDOUBLE(v___ieee754_hypotf_~ha~0_29[31:31], v___ieee754_hypotf_~ha~0_29[30:23], v___ieee754_hypotf_~ha~0_29[22:0]) == \old(x) && !(~bvadd64(~bvand32(v___ieee754_hypotf_~ha~0_29, 2147483647bv32), 2155872256bv32) == 0bv32)) && \old(x) == x [2018-09-20 15:42:04,561 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v___ieee754_hypotf_~ha~0_29 : bv32 :: ~fp~LONGDOUBLE(v___ieee754_hypotf_~ha~0_29[31:31], v___ieee754_hypotf_~ha~0_29[30:23], v___ieee754_hypotf_~ha~0_29[22:0]) == \old(x) && !(~bvadd64(~bvand32(v___ieee754_hypotf_~ha~0_29, 2147483647bv32), 2155872256bv32) == 0bv32)) && \old(x) == x [2018-09-20 15:42:04,562 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v___ieee754_hypotf_~ha~0_29 : bv32 :: ~fp~LONGDOUBLE(v___ieee754_hypotf_~ha~0_29[31:31], v___ieee754_hypotf_~ha~0_29[30:23], v___ieee754_hypotf_~ha~0_29[22:0]) == \old(x) && !(~bvadd64(~bvand32(v___ieee754_hypotf_~ha~0_29, 2147483647bv32), 2155872256bv32) == 0bv32)) && \old(x) == x [2018-09-20 15:42:04,562 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v___ieee754_hypotf_~ha~0_29 : bv32 :: ~fp~LONGDOUBLE(v___ieee754_hypotf_~ha~0_29[31:31], v___ieee754_hypotf_~ha~0_29[30:23], v___ieee754_hypotf_~ha~0_29[22:0]) == \old(x) && !(~bvadd64(~bvand32(v___ieee754_hypotf_~ha~0_29, 2147483647bv32), 2155872256bv32) == 0bv32)) && \old(x) == x [2018-09-20 15:42:04,562 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v___ieee754_hypotf_~ha~0_29 : bv32 :: ~fp~LONGDOUBLE(v___ieee754_hypotf_~ha~0_29[31:31], v___ieee754_hypotf_~ha~0_29[30:23], v___ieee754_hypotf_~ha~0_29[22:0]) == \old(x) && !(~bvadd64(~bvand32(v___ieee754_hypotf_~ha~0_29, 2147483647bv32), 2155872256bv32) == 0bv32)) && \old(x) == x [2018-09-20 15:42:04,563 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v___ieee754_hypotf_~ha~0_29 : bv32 :: ~fp~LONGDOUBLE(v___ieee754_hypotf_~ha~0_29[31:31], v___ieee754_hypotf_~ha~0_29[30:23], v___ieee754_hypotf_~ha~0_29[22:0]) == \old(x) && !(~bvadd64(~bvand32(v___ieee754_hypotf_~ha~0_29, 2147483647bv32), 2155872256bv32) == 0bv32)) && \old(x) == x [2018-09-20 15:42:04,605 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-09-20 15:42:04,605 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 15:42:04,606 INFO L168 Benchmark]: Toolchain (without parser) took 609209.52 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.9 MB). Free memory was 950.5 MB in the beginning and 807.7 MB in the end (delta: 142.9 MB). Peak memory consumption was 367.8 MB. Max. memory is 11.5 GB. [2018-09-20 15:42:04,608 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:42:04,608 INFO L168 Benchmark]: CACSL2BoogieTranslator took 492.97 ms. Allocated memory is still 1.0 GB. Free memory was 950.5 MB in the beginning and 934.4 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:42:04,608 INFO L168 Benchmark]: Boogie Preprocessor took 124.37 ms. Allocated memory is still 1.0 GB. Free memory was 934.4 MB in the beginning and 929.0 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:42:04,608 INFO L168 Benchmark]: RCFGBuilder took 2437.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 929.0 MB in the beginning and 1.1 GB in the end (delta: -142.5 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-09-20 15:42:04,609 INFO L168 Benchmark]: TraceAbstraction took 606037.52 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 85.5 MB). Free memory was 1.1 GB in the beginning and 815.8 MB in the end (delta: 255.7 MB). Peak memory consumption was 341.2 MB. Max. memory is 11.5 GB. [2018-09-20 15:42:04,609 INFO L168 Benchmark]: Witness Printer took 109.63 ms. Allocated memory is still 1.3 GB. Free memory was 815.8 MB in the beginning and 807.7 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2018-09-20 15:42:04,614 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 492.97 ms. Allocated memory is still 1.0 GB. Free memory was 950.5 MB in the beginning and 934.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 124.37 ms. Allocated memory is still 1.0 GB. Free memory was 934.4 MB in the beginning and 929.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2437.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 929.0 MB in the beginning and 1.1 GB in the end (delta: -142.5 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 606037.52 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 85.5 MB). Free memory was 1.1 GB in the beginning and 815.8 MB in the end (delta: 255.7 MB). Peak memory consumption was 341.2 MB. Max. memory is 11.5 GB. * Witness Printer took 109.63 ms. Allocated memory is still 1.3 GB. Free memory was 815.8 MB in the beginning and 807.7 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 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_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 234]: 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(x) == x - InvariantResult [Line: 149]: Loop Invariant [2018-09-20 15:42:04,627 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,627 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,627 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,627 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,632 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,632 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,632 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,632 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] Derived loop invariant: (\exists v___ieee754_hypotf_~ha~0_29 : bv32 :: ~fp~LONGDOUBLE(v___ieee754_hypotf_~ha~0_29[31:31], v___ieee754_hypotf_~ha~0_29[30:23], v___ieee754_hypotf_~ha~0_29[22:0]) == \old(x) && !(~bvadd64(~bvand32(v___ieee754_hypotf_~ha~0_29, 2147483647bv32), 2155872256bv32) == 0bv32)) && \old(x) == x - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 191]: Loop Invariant [2018-09-20 15:42:04,633 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,633 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,633 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,633 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,634 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,634 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,634 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,634 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] Derived loop invariant: (\exists v___ieee754_hypotf_~ha~0_29 : bv32 :: ~fp~LONGDOUBLE(v___ieee754_hypotf_~ha~0_29[31:31], v___ieee754_hypotf_~ha~0_29[30:23], v___ieee754_hypotf_~ha~0_29[22:0]) == \old(x) && !(~bvadd64(~bvand32(v___ieee754_hypotf_~ha~0_29, 2147483647bv32), 2155872256bv32) == 0bv32)) && \old(x) == x - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 200]: Loop Invariant [2018-09-20 15:42:04,635 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,635 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,635 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,635 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,638 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,639 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,639 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,639 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] Derived loop invariant: (\exists v___ieee754_hypotf_~ha~0_29 : bv32 :: ~fp~LONGDOUBLE(v___ieee754_hypotf_~ha~0_29[31:31], v___ieee754_hypotf_~ha~0_29[30:23], v___ieee754_hypotf_~ha~0_29[22:0]) == \old(x) && !(~bvadd64(~bvand32(v___ieee754_hypotf_~ha~0_29, 2147483647bv32), 2155872256bv32) == 0bv32)) && \old(x) == x - InvariantResult [Line: 134]: Loop Invariant [2018-09-20 15:42:04,639 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,640 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,640 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,640 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,640 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,643 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,644 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,644 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] Derived loop invariant: (\exists v___ieee754_hypotf_~ha~0_29 : bv32 :: ~fp~LONGDOUBLE(v___ieee754_hypotf_~ha~0_29[31:31], v___ieee754_hypotf_~ha~0_29[30:23], v___ieee754_hypotf_~ha~0_29[22:0]) == \old(x) && !(~bvadd64(~bvand32(v___ieee754_hypotf_~ha~0_29, 2147483647bv32), 2155872256bv32) == 0bv32)) && \old(x) == x - InvariantResult [Line: 91]: Loop Invariant [2018-09-20 15:42:04,644 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_36,QUANTIFIED] [2018-09-20 15:42:04,644 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_36,QUANTIFIED] [2018-09-20 15:42:04,644 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_36,QUANTIFIED] [2018-09-20 15:42:04,645 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_36,QUANTIFIED] [2018-09-20 15:42:04,645 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_36,QUANTIFIED] [2018-09-20 15:42:04,645 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_36,QUANTIFIED] [2018-09-20 15:42:04,645 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_36,QUANTIFIED] [2018-09-20 15:42:04,645 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_36,QUANTIFIED] Derived loop invariant: \old(x) == x && (\exists v___ieee754_hypotf_~ha~0_36 : bv32 :: ~bvand32(v___ieee754_hypotf_~ha~0_36, 2147483647bv32) == ha && \old(x) == ~fp~LONGDOUBLE(v___ieee754_hypotf_~ha~0_36[31:31], v___ieee754_hypotf_~ha~0_36[30:23], v___ieee754_hypotf_~ha~0_36[22:0])) - 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:42:04,646 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,646 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,646 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,646 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,647 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,647 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,647 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,647 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] Derived loop invariant: (\exists v___ieee754_hypotf_~ha~0_29 : bv32 :: ~fp~LONGDOUBLE(v___ieee754_hypotf_~ha~0_29[31:31], v___ieee754_hypotf_~ha~0_29[30:23], v___ieee754_hypotf_~ha~0_29[22:0]) == \old(x) && !(~bvadd64(~bvand32(v___ieee754_hypotf_~ha~0_29, 2147483647bv32), 2155872256bv32) == 0bv32)) && \old(x) == x - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 185]: Loop Invariant [2018-09-20 15:42:04,651 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,651 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,651 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,651 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,652 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,652 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,652 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,652 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] Derived loop invariant: (\exists v___ieee754_hypotf_~ha~0_29 : bv32 :: ~fp~LONGDOUBLE(v___ieee754_hypotf_~ha~0_29[31:31], v___ieee754_hypotf_~ha~0_29[30:23], v___ieee754_hypotf_~ha~0_29[22:0]) == \old(x) && !(~bvadd64(~bvand32(v___ieee754_hypotf_~ha~0_29, 2147483647bv32), 2155872256bv32) == 0bv32)) && \old(x) == x - InvariantResult [Line: 161]: Loop Invariant [2018-09-20 15:42:04,655 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,655 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,655 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,655 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,656 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,656 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,656 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-09-20 15:42:04,656 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] Derived loop invariant: (\exists v___ieee754_hypotf_~ha~0_29 : bv32 :: ~fp~LONGDOUBLE(v___ieee754_hypotf_~ha~0_29[31:31], v___ieee754_hypotf_~ha~0_29[30:23], v___ieee754_hypotf_~ha~0_29[22:0]) == \old(x) && !(~bvadd64(~bvand32(v___ieee754_hypotf_~ha~0_29, 2147483647bv32), 2155872256bv32) == 0bv32)) && \old(x) == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 231 locations, 1 error locations. SAFE Result, 605.8s OverallTime, 14 OverallIterations, 1 TraceHistogramMax, 559.6s AutomataDifference, 0.0s DeadEndRemovalTime, 3.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3611 SDtfs, 4507 SDslu, 31580 SDs, 0 SdLazy, 5547 SolverSat, 204 SolverUnsat, 171 SolverUnknown, 0 SolverNotchecked, 453.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1486 GetRequests, 1153 SyntacticMatches, 0 SemanticMatches, 333 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1582 ImplicationChecksByTransitivity, 132.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=271occurred in iteration=4, 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, 14 MinimizatonAttempts, 575 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 136 PreInvPairs, 270 NumberOfFragments, 267 HoareAnnotationTreeSize, 136 FomulaSimplifications, 257642 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 25 FomulaSimplificationsInter, 2581 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 38.7s InterpolantComputationTime, 1323 NumberOfCodeBlocks, 1323 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1309 ConstructedInterpolants, 651 QuantifiedInterpolants, 1652665 SizeOfPredicates, 155 NumberOfNonLiveVariables, 2476 ConjunctsInSsa, 208 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...