/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/double_req_bl_0730c_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/double_req_bl_0730c_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 fb0b06f0fabe52e4995034e0b478ee6377b6d993 ................................................................................................................................................................................................................................................................................................... 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/double_req_bl_0730c_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 fb0b06f0fabe52e4995034e0b478ee6377b6d993 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 14:45:51,738 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 14:45:51,741 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 14:45:51,753 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 14:45:51,753 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 14:45:51,754 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 14:45:51,755 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 14:45:51,758 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 14:45:51,760 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 14:45:51,763 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 14:45:51,765 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 14:45:51,766 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 14:45:51,767 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 14:45:51,770 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 14:45:51,774 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 14:45:51,775 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 14:45:51,776 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 14:45:51,781 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 14:45:51,784 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 14:45:51,789 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 14:45:51,789 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 14:45:51,792 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 14:45:51,795 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 14:45:51,795 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 14:45:51,796 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 14:45:51,796 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 14:45:51,797 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 14:45:51,798 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 14:45:51,799 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 14:45:51,800 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 14:45:51,800 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 14:45:51,800 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 14:45:51,801 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 14:45:51,801 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 14:45:51,802 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 14:45:51,802 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 14:45:51,802 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-20 14:45:51,827 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 14:45:51,828 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 14:45:51,829 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 14:45:51,833 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 14:45:51,833 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 14:45:51,834 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 14:45:51,834 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 14:45:51,834 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 14:45:51,834 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 14:45:51,836 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-20 14:45:51,836 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 14:45:51,836 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 14:45:51,837 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 14:45:51,837 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 14:45:51,837 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 14:45:51,837 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 14:45:51,837 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 14:45:51,838 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 14:45:51,838 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 14:45:51,838 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 14:45:51,838 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 14:45:51,838 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 14:45:51,838 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 14:45:51,839 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 14:45:51,839 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 14:45:51,839 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 14:45:51,839 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-20 14:45:51,839 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 14:45:51,839 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-20 14:45:51,840 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 -> fb0b06f0fabe52e4995034e0b478ee6377b6d993 [2018-09-20 14:45:51,897 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 14:45:51,909 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 14:45:51,913 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 14:45:51,915 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 14:45:51,915 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 14:45:51,916 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0730c_true-unreach-call.c [2018-09-20 14:45:52,253 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a12cea49/a44e3cbd11194fdab3b5efb1626abc22/FLAG32c31af66 [2018-09-20 14:45:52,440 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 14:45:52,441 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0730c_true-unreach-call.c [2018-09-20 14:45:52,451 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a12cea49/a44e3cbd11194fdab3b5efb1626abc22/FLAG32c31af66 [2018-09-20 14:45:52,472 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a12cea49/a44e3cbd11194fdab3b5efb1626abc22 [2018-09-20 14:45:52,475 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 14:45:52,479 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 14:45:52,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 14:45:52,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 14:45:52,487 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 14:45:52,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 02:45:52" (1/1) ... [2018-09-20 14:45:52,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45d5fda7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:45:52, skipping insertion in model container [2018-09-20 14:45:52,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 02:45:52" (1/1) ... [2018-09-20 14:45:52,502 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 14:45:52,726 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 14:45:52,744 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 14:45:52,788 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 14:45:52,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:45:52 WrapperNode [2018-09-20 14:45:52,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 14:45:52,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 14:45:52,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 14:45:52,849 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 14:45:52,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:45:52" (1/1) ... [2018-09-20 14:45:52,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:45:52" (1/1) ... [2018-09-20 14:45:52,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:45:52" (1/1) ... [2018-09-20 14:45:52,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:45:52" (1/1) ... [2018-09-20 14:45:52,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:45:52" (1/1) ... [2018-09-20 14:45:52,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:45:52" (1/1) ... [2018-09-20 14:45:52,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:45:52" (1/1) ... [2018-09-20 14:45:52,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 14:45:52,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 14:45:52,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 14:45:52,950 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 14:45:52,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:45:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 14:45:53,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 14:45:53,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 14:45:53,124 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrt [2018-09-20 14:45:53,124 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-09-20 14:45:53,124 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 14:45:53,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 14:45:53,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-20 14:45:53,124 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrt [2018-09-20 14:45:53,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 14:45:53,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-09-20 14:45:53,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-09-20 14:45:53,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 14:45:53,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-09-20 14:45:53,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-09-20 14:45:53,126 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-09-20 14:45:53,126 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 14:45:53,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 14:45:53,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 14:45:53,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2018-09-20 14:45:53,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-09-20 14:45:54,058 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 14:45:54,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:45:54 BoogieIcfgContainer [2018-09-20 14:45:54,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 14:45:54,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 14:45:54,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 14:45:54,063 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 14:45:54,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 02:45:52" (1/3) ... [2018-09-20 14:45:54,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64470be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 02:45:54, skipping insertion in model container [2018-09-20 14:45:54,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:45:52" (2/3) ... [2018-09-20 14:45:54,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64470be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 02:45:54, skipping insertion in model container [2018-09-20 14:45:54,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:45:54" (3/3) ... [2018-09-20 14:45:54,068 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0730c_true-unreach-call.c [2018-09-20 14:45:54,078 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 14:45:54,086 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 14:45:54,130 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 14:45:54,130 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 14:45:54,131 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 14:45:54,131 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 14:45:54,131 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 14:45:54,131 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 14:45:54,131 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 14:45:54,132 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 14:45:54,132 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 14:45:54,153 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2018-09-20 14:45:54,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-20 14:45:54,160 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:45:54,161 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:45:54,164 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:45:54,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1374597462, now seen corresponding path program 1 times [2018-09-20 14:45:54,174 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 14:45:54,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 14:45:54,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 14:45:54,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:45:54,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 14:45:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:45:54,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:45:54,319 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:45:54,319 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 14:45:54,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 14:45:54,338 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 14:45:54,339 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 14:45:54,341 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 2 states. [2018-09-20 14:45:54,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:45:54,376 INFO L93 Difference]: Finished difference Result 192 states and 255 transitions. [2018-09-20 14:45:54,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 14:45:54,378 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-09-20 14:45:54,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:45:54,389 INFO L225 Difference]: With dead ends: 192 [2018-09-20 14:45:54,390 INFO L226 Difference]: Without dead ends: 96 [2018-09-20 14:45:54,394 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 14:45:54,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-20 14:45:54,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-09-20 14:45:54,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-20 14:45:54,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2018-09-20 14:45:54,442 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 16 [2018-09-20 14:45:54,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:45:54,442 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2018-09-20 14:45:54,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 14:45:54,443 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2018-09-20 14:45:54,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-20 14:45:54,444 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:45:54,444 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] [2018-09-20 14:45:54,445 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:45:54,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1447842776, now seen corresponding path program 1 times [2018-09-20 14:45:54,445 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 14:45:54,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 14:45:54,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 14:45:54,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:45:54,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 14:45:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 14:45:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 14:45:54,552 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-20 14:45:54,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 02:45:54 BoogieIcfgContainer [2018-09-20 14:45:54,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 14:45:54,591 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 14:45:54,591 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 14:45:54,591 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 14:45:54,592 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:45:54" (3/4) ... [2018-09-20 14:45:54,596 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-09-20 14:45:54,596 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 14:45:54,597 INFO L168 Benchmark]: Toolchain (without parser) took 2121.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -119.2 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2018-09-20 14:45:54,599 INFO L168 Benchmark]: CDTParser took 0.20 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 14:45:54,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.22 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-09-20 14:45:54,600 INFO L168 Benchmark]: Boogie Preprocessor took 101.18 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 14:45:54,601 INFO L168 Benchmark]: RCFGBuilder took 1108.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -162.9 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2018-09-20 14:45:54,602 INFO L168 Benchmark]: TraceAbstraction took 530.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. [2018-09-20 14:45:54,603 INFO L168 Benchmark]: Witness Printer took 5.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 14:45:54,606 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.20 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 368.22 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 101.18 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1108.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -162.9 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 530.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 154]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 153, overapproximation of someBinaryArithmeticDOUBLEoperation at line 33, overapproximation of bitwiseAnd at line 32. Possible FailurePath: [L17] static const double one_sqrt = 1.0, tiny_sqrt = 1.0e-300; VAL [\old(one_sqrt)=6442450951, \old(tiny_sqrt)=6442450947, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L149] double x = 0.0; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L150] CALL, EXPR __ieee754_sqrt(x) VAL [\old(x)=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L20] double z; [L21] __int32_t sign = 0x80000000; [L22] __uint32_t r, t1, s1, ix1, q1; [L23] __int32_t ix0, s0, q, m, t, i; VAL [\old(x)=0, one_sqrt=1, sign=-2147483648, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L26] FCALL ieee_double_shape_type ew_u; VAL [\old(x)=0, ew_u={6442450944:0}, one_sqrt=1, sign=-2147483648, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L27] FCALL ew_u.value = (x) VAL [\old(x)=0, ew_u={6442450944:0}, one_sqrt=1, sign=-2147483648, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L28] EXPR, FCALL ew_u.parts.msw VAL [\old(x)=0, ew_u={6442450944:0}, ew_u.parts.msw=6442450943, one_sqrt=1, sign=-2147483648, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L28] (ix0) = ew_u.parts.msw VAL [\old(x)=0, ew_u={6442450944:0}, ew_u.parts.msw=6442450943, ix0=2147483647, one_sqrt=1, sign=-2147483648, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L28] FCALL (ix0) = ew_u.parts.msw VAL [(ix0) = ew_u.parts.msw=6442450948, \old(x)=0, ew_u={6442450944:0}, ew_u.parts.msw=6442450943, ix0=2147483647, one_sqrt=1, sign=-2147483648, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L29] EXPR, FCALL ew_u.parts.lsw VAL [\old(x)=0, ew_u={6442450944:0}, ew_u.parts.lsw=6442450949, ix0=2147483647, one_sqrt=1, sign=-2147483648, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L29] (ix1) = ew_u.parts.lsw VAL [\old(x)=0, ew_u={6442450944:0}, ew_u.parts.lsw=6442450949, ix0=2147483647, ix1=6442450949, one_sqrt=1, sign=-2147483648, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L29] FCALL (ix1) = ew_u.parts.lsw VAL [(ix1) = ew_u.parts.lsw=6442450946, \old(x)=0, ew_u={6442450944:0}, ew_u.parts.lsw=6442450949, ix0=2147483647, ix1=6442450949, one_sqrt=1, sign=-2147483648, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L30] COND FALSE !(0) VAL [\old(x)=0, ix0=2147483647, ix1=6442450949, one_sqrt=1, sign=-2147483648, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L32] COND TRUE (ix0 & 0x7ff00000) == 0x7ff00000 [L33] RET return x * x + x; VAL [\old(x)=0, ix0=2147483647, ix1=6442450949, one_sqrt=1, sign=-2147483648, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L150] EXPR __ieee754_sqrt(x) VAL [__ieee754_sqrt(x)=6442450950, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L150] double res = __ieee754_sqrt(x); [L153] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [one_sqrt=1, res=6442450950, res == 0.0 && __signbit_double(res) == 0=0, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L153] COND FALSE, EXPR !(res == 0.0 && __signbit_double(res) == 0) VAL [one_sqrt=1, res=6442450950, res == 0.0 && __signbit_double(res) == 0=0, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L153] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L154] __VERIFIER_error() VAL [one_sqrt=1, res=6442450950, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 100 locations, 1 error locations. UNSAFE Result, 0.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 120 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=100occurred 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 225 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 14:45:56,919 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 14:45:56,920 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 14:45:56,933 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 14:45:56,933 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 14:45:56,934 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 14:45:56,936 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 14:45:56,938 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 14:45:56,940 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 14:45:56,941 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 14:45:56,942 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 14:45:56,942 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 14:45:56,943 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 14:45:56,944 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 14:45:56,945 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 14:45:56,946 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 14:45:56,947 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 14:45:56,949 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 14:45:56,951 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 14:45:56,953 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 14:45:56,954 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 14:45:56,955 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 14:45:56,958 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 14:45:56,959 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 14:45:56,959 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 14:45:56,960 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 14:45:56,961 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 14:45:56,962 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 14:45:56,963 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 14:45:56,964 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 14:45:56,964 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 14:45:56,965 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 14:45:56,965 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 14:45:56,966 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 14:45:56,967 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 14:45:56,967 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 14:45:56,968 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-20 14:45:56,984 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 14:45:56,985 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 14:45:56,985 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 14:45:56,986 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 14:45:56,986 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 14:45:56,986 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 14:45:56,987 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 14:45:56,987 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 14:45:56,987 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 14:45:56,987 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 14:45:56,988 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 14:45:56,988 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 14:45:56,988 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 14:45:56,988 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 14:45:56,988 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-20 14:45:56,989 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-20 14:45:56,989 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 14:45:56,989 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 14:45:56,989 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 14:45:56,990 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 14:45:56,990 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 14:45:56,990 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 14:45:56,990 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 14:45:56,990 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 14:45:56,990 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 14:45:56,991 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 14:45:56,991 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 14:45:56,991 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-20 14:45:56,991 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 14:45:56,991 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-20 14:45:56,991 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-20 14:45:56,992 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 -> fb0b06f0fabe52e4995034e0b478ee6377b6d993 [2018-09-20 14:45:57,042 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 14:45:57,062 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 14:45:57,066 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 14:45:57,067 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 14:45:57,068 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 14:45:57,068 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0730c_true-unreach-call.c [2018-09-20 14:45:57,439 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0c7b9d1c/aff54a497a8c494b9adc0007e77812bd/FLAG585b0a64e [2018-09-20 14:45:57,593 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 14:45:57,593 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0730c_true-unreach-call.c [2018-09-20 14:45:57,602 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0c7b9d1c/aff54a497a8c494b9adc0007e77812bd/FLAG585b0a64e [2018-09-20 14:45:57,617 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0c7b9d1c/aff54a497a8c494b9adc0007e77812bd [2018-09-20 14:45:57,621 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 14:45:57,624 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 14:45:57,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 14:45:57,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 14:45:57,632 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 14:45:57,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 02:45:57" (1/1) ... [2018-09-20 14:45:57,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a0a11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:45:57, skipping insertion in model container [2018-09-20 14:45:57,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 02:45:57" (1/1) ... [2018-09-20 14:45:57,649 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 14:45:57,907 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 14:45:57,931 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 14:45:57,979 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 14:45:58,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:45:58 WrapperNode [2018-09-20 14:45:58,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 14:45:58,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 14:45:58,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 14:45:58,019 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 14:45:58,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:45:58" (1/1) ... [2018-09-20 14:45:58,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:45:58" (1/1) ... [2018-09-20 14:45:58,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:45:58" (1/1) ... [2018-09-20 14:45:58,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:45:58" (1/1) ... [2018-09-20 14:45:58,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:45:58" (1/1) ... [2018-09-20 14:45:58,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:45:58" (1/1) ... [2018-09-20 14:45:58,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:45:58" (1/1) ... [2018-09-20 14:45:58,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 14:45:58,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 14:45:58,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 14:45:58,080 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 14:45:58,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:45:58" (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 14:45:58,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 14:45:58,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 14:45:58,218 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrt [2018-09-20 14:45:58,218 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-09-20 14:45:58,219 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 14:45:58,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 14:45:58,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-20 14:45:58,219 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrt [2018-09-20 14:45:58,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 14:45:58,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-20 14:45:58,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-20 14:45:58,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 14:45:58,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-20 14:45:58,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-20 14:45:58,220 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-09-20 14:45:58,220 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 14:45:58,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 14:45:58,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 14:45:58,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-20 14:45:58,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-20 14:45:58,463 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:45:58,504 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:45:58,762 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:45:58,789 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:45:58,815 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 14:46:02,448 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 14:46:02,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:46:02 BoogieIcfgContainer [2018-09-20 14:46:02,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 14:46:02,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 14:46:02,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 14:46:02,455 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 14:46:02,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 02:45:57" (1/3) ... [2018-09-20 14:46:02,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aff40c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 02:46:02, skipping insertion in model container [2018-09-20 14:46:02,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:45:58" (2/3) ... [2018-09-20 14:46:02,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aff40c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 02:46:02, skipping insertion in model container [2018-09-20 14:46:02,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:46:02" (3/3) ... [2018-09-20 14:46:02,460 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0730c_true-unreach-call.c [2018-09-20 14:46:02,471 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 14:46:02,484 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 14:46:02,540 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 14:46:02,540 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 14:46:02,540 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 14:46:02,541 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 14:46:02,541 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 14:46:02,541 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 14:46:02,541 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 14:46:02,541 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 14:46:02,542 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 14:46:02,562 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2018-09-20 14:46:02,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-20 14:46:02,572 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:46:02,574 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:46:02,577 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:46:02,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1374597462, now seen corresponding path program 1 times [2018-09-20 14:46:02,586 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:46:02,587 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 14:46:02,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:46:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:46:03,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:46:03,064 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 14:46:03,065 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:46:03,083 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:46:03,083 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 14:46:03,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 14:46:03,099 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 14:46:03,100 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 14:46:03,102 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 2 states. [2018-09-20 14:46:03,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:46:03,135 INFO L93 Difference]: Finished difference Result 192 states and 255 transitions. [2018-09-20 14:46:03,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 14:46:03,136 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-09-20 14:46:03,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:46:03,148 INFO L225 Difference]: With dead ends: 192 [2018-09-20 14:46:03,148 INFO L226 Difference]: Without dead ends: 96 [2018-09-20 14:46:03,153 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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 14:46:03,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-20 14:46:03,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-09-20 14:46:03,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-20 14:46:03,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2018-09-20 14:46:03,208 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 16 [2018-09-20 14:46:03,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:46:03,208 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2018-09-20 14:46:03,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 14:46:03,208 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2018-09-20 14:46:03,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-20 14:46:03,210 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:46:03,210 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:46:03,211 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:46:03,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1447842776, now seen corresponding path program 1 times [2018-09-20 14:46:03,212 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:46:03,212 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) [2018-09-20 14:46:03,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-20 14:46:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:46:03,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:46:03,729 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 14 treesize of output 11 [2018-09-20 14:46:03,740 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 11 treesize of output 10 [2018-09-20 14:46:03,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:46:03,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:46:03,774 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 14:46:03,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 14:46:03,845 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 20 treesize of output 16 [2018-09-20 14:46:03,865 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 16 treesize of output 4 [2018-09-20 14:46:03,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:46:03,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:46:03,961 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 14:46:03,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 14:46:04,362 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 14:46:04,362 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:46:04,379 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:46:04,379 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-20 14:46:04,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-20 14:46:04,382 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-20 14:46:04,382 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-20 14:46:04,382 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand 8 states. [2018-09-20 14:46:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:46:10,446 INFO L93 Difference]: Finished difference Result 128 states and 150 transitions. [2018-09-20 14:46:10,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-20 14:46:10,449 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-09-20 14:46:10,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:46:10,456 INFO L225 Difference]: With dead ends: 128 [2018-09-20 14:46:10,456 INFO L226 Difference]: Without dead ends: 105 [2018-09-20 14:46:10,458 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-09-20 14:46:10,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-20 14:46:10,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2018-09-20 14:46:10,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-20 14:46:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2018-09-20 14:46:10,478 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 115 transitions. Word has length 29 [2018-09-20 14:46:10,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:46:10,478 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 115 transitions. [2018-09-20 14:46:10,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-20 14:46:10,482 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2018-09-20 14:46:10,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-20 14:46:10,483 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:46:10,483 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] [2018-09-20 14:46:10,486 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:46:10,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1588044780, now seen corresponding path program 1 times [2018-09-20 14:46:10,487 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:46:10,488 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 14:46:10,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:46:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:46:10,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:46:10,730 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 14:46:10,730 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:46:10,746 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:46:10,746 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-20 14:46:10,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-20 14:46:10,747 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-20 14:46:10,747 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-20 14:46:10,748 INFO L87 Difference]: Start difference. First operand 96 states and 115 transitions. Second operand 7 states. [2018-09-20 14:46:14,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:46:14,210 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2018-09-20 14:46:14,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-20 14:46:14,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-09-20 14:46:14,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:46:14,213 INFO L225 Difference]: With dead ends: 103 [2018-09-20 14:46:14,213 INFO L226 Difference]: Without dead ends: 100 [2018-09-20 14:46:14,214 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-09-20 14:46:14,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-20 14:46:14,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-09-20 14:46:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-20 14:46:14,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2018-09-20 14:46:14,226 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 31 [2018-09-20 14:46:14,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:46:14,228 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2018-09-20 14:46:14,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-20 14:46:14,228 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2018-09-20 14:46:14,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-20 14:46:14,230 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:46:14,230 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] [2018-09-20 14:46:14,230 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:46:14,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1854185662, now seen corresponding path program 1 times [2018-09-20 14:46:14,231 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:46:14,232 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 14:46:14,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:46:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:46:15,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:46:15,199 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 14 treesize of output 11 [2018-09-20 14:46:15,205 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 11 treesize of output 10 [2018-09-20 14:46:15,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:46:15,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:46:15,249 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 14:46:15,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 14:46:15,303 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 20 treesize of output 16 [2018-09-20 14:46:15,309 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 16 treesize of output 4 [2018-09-20 14:46:15,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:46:15,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:46:15,328 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 14:46:15,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 14:46:15,483 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 14:46:15,483 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:46:15,506 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:46:15,507 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-20 14:46:15,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-20 14:46:15,507 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-20 14:46:15,507 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-20 14:46:15,508 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand 8 states. [2018-09-20 14:46:19,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:46:19,680 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2018-09-20 14:46:19,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-20 14:46:19,682 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-09-20 14:46:19,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:46:19,684 INFO L225 Difference]: With dead ends: 130 [2018-09-20 14:46:19,684 INFO L226 Difference]: Without dead ends: 107 [2018-09-20 14:46:19,686 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-09-20 14:46:19,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-20 14:46:19,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2018-09-20 14:46:19,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-20 14:46:19,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 118 transitions. [2018-09-20 14:46:19,699 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 118 transitions. Word has length 32 [2018-09-20 14:46:19,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:46:19,700 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 118 transitions. [2018-09-20 14:46:19,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-20 14:46:19,700 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 118 transitions. [2018-09-20 14:46:19,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-20 14:46:19,702 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:46:19,703 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] [2018-09-20 14:46:19,703 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:46:19,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1175923215, now seen corresponding path program 1 times [2018-09-20 14:46:19,704 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:46:19,705 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 14:46:19,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:46:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:46:19,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:46:19,945 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 14 treesize of output 11 [2018-09-20 14:46:19,951 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 11 treesize of output 10 [2018-09-20 14:46:19,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:46:19,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:46:19,975 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 14:46:19,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 14:46:20,048 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 20 treesize of output 16 [2018-09-20 14:46:20,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 14:46:20,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:46:20,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:46:20,077 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 14:46:20,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 14:46:20,523 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 14:46:20,523 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:46:20,536 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:46:20,536 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-20 14:46:20,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-20 14:46:20,537 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-20 14:46:20,537 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-20 14:46:20,537 INFO L87 Difference]: Start difference. First operand 100 states and 118 transitions. Second operand 14 states. [2018-09-20 14:46:21,553 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-20 14:46:22,418 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-09-20 14:46:22,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:46:22,772 INFO L93 Difference]: Finished difference Result 105 states and 123 transitions. [2018-09-20 14:46:22,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-20 14:46:22,774 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2018-09-20 14:46:22,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:46:22,776 INFO L225 Difference]: With dead ends: 105 [2018-09-20 14:46:22,776 INFO L226 Difference]: Without dead ends: 96 [2018-09-20 14:46:22,778 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2018-09-20 14:46:22,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-20 14:46:22,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-09-20 14:46:22,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-20 14:46:22,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 113 transitions. [2018-09-20 14:46:22,792 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 113 transitions. Word has length 47 [2018-09-20 14:46:22,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:46:22,793 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 113 transitions. [2018-09-20 14:46:22,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-20 14:46:22,794 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 113 transitions. [2018-09-20 14:46:22,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-20 14:46:22,796 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:46:22,797 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] [2018-09-20 14:46:22,797 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:46:22,797 INFO L82 PathProgramCache]: Analyzing trace with hash -2066914366, now seen corresponding path program 1 times [2018-09-20 14:46:22,798 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:46:22,799 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 14:46:22,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:46:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:46:22,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:46:22,959 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 14 treesize of output 11 [2018-09-20 14:46:22,966 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 11 treesize of output 10 [2018-09-20 14:46:22,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:46:22,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:46:22,998 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 14:46:22,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 14:46:23,035 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 20 treesize of output 16 [2018-09-20 14:46:23,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 16 treesize of output 4 [2018-09-20 14:46:23,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:46:23,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:46:23,165 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 14:46:23,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 14:46:23,444 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 14:46:23,445 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:46:23,460 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:46:23,460 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-20 14:46:23,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-20 14:46:23,461 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-20 14:46:23,461 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-20 14:46:23,463 INFO L87 Difference]: Start difference. First operand 96 states and 113 transitions. Second operand 8 states. [2018-09-20 14:46:25,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:46:25,926 INFO L93 Difference]: Finished difference Result 224 states and 275 transitions. [2018-09-20 14:46:25,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-20 14:46:25,927 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2018-09-20 14:46:25,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:46:25,929 INFO L225 Difference]: With dead ends: 224 [2018-09-20 14:46:25,929 INFO L226 Difference]: Without dead ends: 103 [2018-09-20 14:46:25,930 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-09-20 14:46:25,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-20 14:46:25,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2018-09-20 14:46:25,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-20 14:46:25,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2018-09-20 14:46:25,939 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 57 [2018-09-20 14:46:25,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:46:25,940 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2018-09-20 14:46:25,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-20 14:46:25,940 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2018-09-20 14:46:25,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-20 14:46:25,944 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:46:25,944 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] [2018-09-20 14:46:25,944 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:46:25,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1537492296, now seen corresponding path program 1 times [2018-09-20 14:46:25,945 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:46:25,945 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 14:46:25,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:46:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:46:26,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:46:26,088 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 14 treesize of output 11 [2018-09-20 14:46:26,095 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 11 treesize of output 10 [2018-09-20 14:46:26,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:46:26,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:46:26,119 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 14:46:26,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 14:46:26,157 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 20 treesize of output 16 [2018-09-20 14:46:26,163 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 16 treesize of output 4 [2018-09-20 14:46:26,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:46:26,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:46:26,177 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 14:46:26,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 14:46:26,722 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 14:46:26,724 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:46:26,743 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:46:26,743 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-20 14:46:26,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-20 14:46:26,744 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-20 14:46:26,744 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-20 14:46:26,744 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand 9 states. [2018-09-20 14:46:29,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:46:29,957 INFO L93 Difference]: Finished difference Result 168 states and 200 transitions. [2018-09-20 14:46:29,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-20 14:46:29,959 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2018-09-20 14:46:29,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:46:29,960 INFO L225 Difference]: With dead ends: 168 [2018-09-20 14:46:29,960 INFO L226 Difference]: Without dead ends: 105 [2018-09-20 14:46:29,961 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-09-20 14:46:29,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-20 14:46:29,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2018-09-20 14:46:29,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-20 14:46:29,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2018-09-20 14:46:29,975 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 59 [2018-09-20 14:46:29,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:46:29,976 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2018-09-20 14:46:29,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-20 14:46:29,976 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2018-09-20 14:46:29,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-20 14:46:29,980 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:46:29,980 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:46:29,980 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:46:29,981 INFO L82 PathProgramCache]: Analyzing trace with hash -870056175, now seen corresponding path program 1 times [2018-09-20 14:46:29,981 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:46:29,981 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 14:46:29,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:46:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:46:30,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:46:30,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-20 14:46:30,094 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:46:30,109 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:46:30,109 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-20 14:46:30,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-20 14:46:30,110 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-20 14:46:30,111 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-20 14:46:30,111 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand 3 states. [2018-09-20 14:46:30,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:46:30,193 INFO L93 Difference]: Finished difference Result 159 states and 187 transitions. [2018-09-20 14:46:30,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-20 14:46:30,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-09-20 14:46:30,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:46:30,195 INFO L225 Difference]: With dead ends: 159 [2018-09-20 14:46:30,196 INFO L226 Difference]: Without dead ends: 105 [2018-09-20 14:46:30,196 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-20 14:46:30,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-20 14:46:30,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-09-20 14:46:30,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-20 14:46:30,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2018-09-20 14:46:30,206 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 67 [2018-09-20 14:46:30,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:46:30,206 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2018-09-20 14:46:30,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-20 14:46:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2018-09-20 14:46:30,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-20 14:46:30,209 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:46:30,210 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:46:30,210 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:46:30,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1969320889, now seen corresponding path program 1 times [2018-09-20 14:46:30,211 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:46:30,212 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 14:46:30,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:46:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:46:30,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:46:30,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-20 14:46:30,477 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:46:30,489 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:46:30,489 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-20 14:46:30,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-20 14:46:30,490 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-20 14:46:30,490 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-20 14:46:30,490 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand 6 states. [2018-09-20 14:46:31,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:46:31,435 INFO L93 Difference]: Finished difference Result 167 states and 197 transitions. [2018-09-20 14:46:31,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-20 14:46:31,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-09-20 14:46:31,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:46:31,439 INFO L225 Difference]: With dead ends: 167 [2018-09-20 14:46:31,439 INFO L226 Difference]: Without dead ends: 109 [2018-09-20 14:46:31,439 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-20 14:46:31,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-20 14:46:31,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-09-20 14:46:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-20 14:46:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 123 transitions. [2018-09-20 14:46:31,450 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 123 transitions. Word has length 71 [2018-09-20 14:46:31,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:46:31,451 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 123 transitions. [2018-09-20 14:46:31,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-20 14:46:31,451 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 123 transitions. [2018-09-20 14:46:31,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-20 14:46:31,452 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:46:31,452 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:46:31,453 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:46:31,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1946688635, now seen corresponding path program 1 times [2018-09-20 14:46:31,453 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:46:31,455 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-09-20 14:46:31,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:46:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:46:31,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:46:31,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-20 14:46:31,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 14:46:31,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-20 14:46:31,716 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 14:46:31,716 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-09-20 14:46:31,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-20 14:46:31,717 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-20 14:46:31,717 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-20 14:46:31,717 INFO L87 Difference]: Start difference. First operand 107 states and 123 transitions. Second operand 6 states. [2018-09-20 14:46:31,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:46:31,818 INFO L93 Difference]: Finished difference Result 173 states and 205 transitions. [2018-09-20 14:46:31,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-20 14:46:31,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-09-20 14:46:31,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:46:31,822 INFO L225 Difference]: With dead ends: 173 [2018-09-20 14:46:31,822 INFO L226 Difference]: Without dead ends: 119 [2018-09-20 14:46:31,823 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-20 14:46:31,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-20 14:46:31,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-09-20 14:46:31,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-20 14:46:31,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 138 transitions. [2018-09-20 14:46:31,836 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 138 transitions. Word has length 71 [2018-09-20 14:46:31,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:46:31,836 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 138 transitions. [2018-09-20 14:46:31,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-20 14:46:31,836 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 138 transitions. [2018-09-20 14:46:31,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-20 14:46:31,839 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:46:31,839 INFO L376 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:46:31,839 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:46:31,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1688735885, now seen corresponding path program 1 times [2018-09-20 14:46:31,840 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:46:31,840 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) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-09-20 14:46:31,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:46:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:46:31,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:46:33,046 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-20 14:46:33,264 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-20 14:46:33,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 14:46:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-20 14:46:35,236 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 14:46:35,236 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-09-20 14:46:35,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-20 14:46:35,237 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-20 14:46:35,237 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2018-09-20 14:46:35,237 INFO L87 Difference]: Start difference. First operand 119 states and 138 transitions. Second operand 22 states. [2018-09-20 14:46:40,386 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-09-20 14:46:49,099 WARN L178 SmtUtils]: Spent 8.26 s on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2018-09-20 14:46:49,624 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-09-20 14:46:52,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:46:52,292 INFO L93 Difference]: Finished difference Result 200 states and 236 transitions. [2018-09-20 14:46:52,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-20 14:46:52,295 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 83 [2018-09-20 14:46:52,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:46:52,296 INFO L225 Difference]: With dead ends: 200 [2018-09-20 14:46:52,296 INFO L226 Difference]: Without dead ends: 131 [2018-09-20 14:46:52,298 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=235, Invalid=821, Unknown=0, NotChecked=0, Total=1056 [2018-09-20 14:46:52,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-20 14:46:52,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-20 14:46:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-20 14:46:52,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 150 transitions. [2018-09-20 14:46:52,313 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 150 transitions. Word has length 83 [2018-09-20 14:46:52,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:46:52,314 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 150 transitions. [2018-09-20 14:46:52,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-20 14:46:52,314 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 150 transitions. [2018-09-20 14:46:52,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-20 14:46:52,316 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:46:52,317 INFO L376 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:46:52,317 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:46:52,317 INFO L82 PathProgramCache]: Analyzing trace with hash 532615159, now seen corresponding path program 2 times [2018-09-20 14:46:52,318 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:46:52,318 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 14:46:52,330 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-09-20 14:46:52,425 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-09-20 14:46:52,426 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-20 14:46:52,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:46:52,506 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-09-20 14:46:52,507 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:46:52,525 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:46:52,525 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 14:46:52,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 14:46:52,525 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 14:46:52,526 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 14:46:52,526 INFO L87 Difference]: Start difference. First operand 131 states and 150 transitions. Second operand 4 states. [2018-09-20 14:46:52,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:46:52,698 INFO L93 Difference]: Finished difference Result 184 states and 213 transitions. [2018-09-20 14:46:52,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 14:46:52,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-09-20 14:46:52,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:46:52,702 INFO L225 Difference]: With dead ends: 184 [2018-09-20 14:46:52,702 INFO L226 Difference]: Without dead ends: 139 [2018-09-20 14:46:52,703 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-20 14:46:52,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-20 14:46:52,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 133. [2018-09-20 14:46:52,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-20 14:46:52,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 152 transitions. [2018-09-20 14:46:52,717 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 152 transitions. Word has length 83 [2018-09-20 14:46:52,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:46:52,718 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 152 transitions. [2018-09-20 14:46:52,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 14:46:52,718 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2018-09-20 14:46:52,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-20 14:46:52,720 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:46:52,720 INFO L376 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:46:52,721 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:46:52,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1660890545, now seen corresponding path program 1 times [2018-09-20 14:46:52,721 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:46:52,722 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 14:46:52,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-20 14:46:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:46:52,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:46:52,900 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-20 14:46:52,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 14:46:53,097 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-20 14:46:53,108 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 14:46:53,108 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-09-20 14:46:53,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-20 14:46:53,109 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-20 14:46:53,109 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-20 14:46:53,109 INFO L87 Difference]: Start difference. First operand 133 states and 152 transitions. Second operand 12 states. [2018-09-20 14:46:53,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:46:53,547 INFO L93 Difference]: Finished difference Result 213 states and 254 transitions. [2018-09-20 14:46:53,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-20 14:46:53,550 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2018-09-20 14:46:53,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:46:53,551 INFO L225 Difference]: With dead ends: 213 [2018-09-20 14:46:53,551 INFO L226 Difference]: Without dead ends: 157 [2018-09-20 14:46:53,553 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-20 14:46:53,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-09-20 14:46:53,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-09-20 14:46:53,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-20 14:46:53,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2018-09-20 14:46:53,566 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 87 [2018-09-20 14:46:53,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:46:53,566 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2018-09-20 14:46:53,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-20 14:46:53,568 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2018-09-20 14:46:53,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-20 14:46:53,570 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:46:53,570 INFO L376 BasicCegarLoop]: trace histogram [11, 10, 10, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:46:53,570 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:46:53,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1999607871, now seen corresponding path program 2 times [2018-09-20 14:46:53,571 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:46:53,573 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) [2018-09-20 14:46:53,583 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-09-20 14:46:53,689 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-09-20 14:46:53,689 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-20 14:46:53,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:46:53,778 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 14:46:53,779 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 14:46:53,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 27 treesize of output 35 [2018-09-20 14:46:53,790 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 14:46:53,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-20 14:46:53,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:46:53,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:46:53,856 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 14:46:53,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-09-20 14:46:54,036 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 42 treesize of output 33 [2018-09-20 14:46:54,043 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 14:46:54,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-09-20 14:46:54,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:46:54,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:46:54,118 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 14:46:54,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:37 [2018-09-20 14:46:56,196 WARN L178 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 32 [2018-09-20 14:46:56,214 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 26 treesize of output 20 [2018-09-20 14:46:56,222 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 14:46:56,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-09-20 14:46:56,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 14:46:56,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 14:46:56,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 14:46:56,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:23 [2018-09-20 14:46:56,604 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-09-20 14:46:56,604 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:46:56,615 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:46:56,615 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-20 14:46:56,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-20 14:46:56,616 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-20 14:46:56,616 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-20 14:46:56,616 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 11 states. [2018-09-20 14:46:59,433 WARN L178 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 36 [2018-09-20 14:47:03,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:47:03,783 INFO L93 Difference]: Finished difference Result 157 states and 182 transitions. [2018-09-20 14:47:03,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-20 14:47:03,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 111 [2018-09-20 14:47:03,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:47:03,787 INFO L225 Difference]: With dead ends: 157 [2018-09-20 14:47:03,787 INFO L226 Difference]: Without dead ends: 0 [2018-09-20 14:47:03,789 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-09-20 14:47:03,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-20 14:47:03,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-20 14:47:03,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-20 14:47:03,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-20 14:47:03,791 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 111 [2018-09-20 14:47:03,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:47:03,791 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-20 14:47:03,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-20 14:47:03,791 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-20 14:47:03,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-20 14:47:03,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-20 14:47:04,300 WARN L178 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-09-20 14:47:04,527 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-09-20 14:47:04,711 INFO L429 ceAbstractionStarter]: At program point __ieee754_sqrtENTRY(lines 19 127) the Hoare annotation is: true [2018-09-20 14:47:04,712 INFO L426 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-09-20 14:47:04,712 INFO L426 ceAbstractionStarter]: For program point __ieee754_sqrtFINAL(lines 19 127) no Hoare annotation was computed. [2018-09-20 14:47:04,712 INFO L426 ceAbstractionStarter]: For program point L85(lines 85 94) no Hoare annotation was computed. [2018-09-20 14:47:04,712 INFO L426 ceAbstractionStarter]: For program point L85-2(lines 85 94) no Hoare annotation was computed. [2018-09-20 14:47:04,712 INFO L426 ceAbstractionStarter]: For program point L44(lines 44 55) no Hoare annotation was computed. [2018-09-20 14:47:04,712 INFO L426 ceAbstractionStarter]: For program point L44-2(lines 44 55) no Hoare annotation was computed. [2018-09-20 14:47:04,713 INFO L426 ceAbstractionStarter]: For program point L102(lines 102 113) no Hoare annotation was computed. [2018-09-20 14:47:04,713 INFO L426 ceAbstractionStarter]: For program point L36(lines 36 41) no Hoare annotation was computed. [2018-09-20 14:47:04,713 INFO L426 ceAbstractionStarter]: For program point L69-1(lines 69 79) no Hoare annotation was computed. [2018-09-20 14:47:04,713 INFO L426 ceAbstractionStarter]: For program point L36-2(lines 36 41) no Hoare annotation was computed. [2018-09-20 14:47:04,713 INFO L422 ceAbstractionStarter]: At program point L69-3(lines 69 79) the Hoare annotation is: (let ((.cse0 (= __ieee754_sqrt_~x |__ieee754_sqrt_#in~x|))) (or (and .cse0 (= (bvadd __ieee754_sqrt_~sign~0 (_ bv2147483648 32)) (_ bv0 32)) (exists ((|v_q#valueAsBitvector_11| (_ BitVec 64))) (and (not (= (bvor (bvand ((_ extract 63 32) |v_q#valueAsBitvector_11|) (_ bv2147483647 32)) ((_ extract 31 0) |v_q#valueAsBitvector_11|)) (_ bv0 32))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_11|) ((_ extract 62 52) |v_q#valueAsBitvector_11|) ((_ extract 51 0) |v_q#valueAsBitvector_11|)) |__ieee754_sqrt_#in~x|)))) (and .cse0 (exists ((|v_q#valueAsBitvector_10| (_ BitVec 64))) (and (not (= (_ bv0 32) (bvashr ((_ extract 63 32) |v_q#valueAsBitvector_10|) (_ bv20 32)))) (= |__ieee754_sqrt_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_10|) ((_ extract 62 52) |v_q#valueAsBitvector_10|) ((_ extract 51 0) |v_q#valueAsBitvector_10|)))))) (and .cse0 (exists ((|v_q#valueAsBitvector_9| (_ BitVec 64))) (and (not (bvsle ((_ extract 63 32) |v_q#valueAsBitvector_9|) (_ bv0 32))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_9|) ((_ extract 62 52) |v_q#valueAsBitvector_9|) ((_ extract 51 0) |v_q#valueAsBitvector_9|)) |__ieee754_sqrt_#in~x|)))))) [2018-09-20 14:47:04,713 INFO L426 ceAbstractionStarter]: For program point L69-4(lines 69 79) no Hoare annotation was computed. [2018-09-20 14:47:04,713 INFO L426 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-09-20 14:47:04,713 INFO L426 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2018-09-20 14:47:04,714 INFO L426 ceAbstractionStarter]: For program point L28-2(line 28) no Hoare annotation was computed. [2018-09-20 14:47:04,714 INFO L426 ceAbstractionStarter]: For program point L45-1(lines 45 49) no Hoare annotation was computed. [2018-09-20 14:47:04,714 INFO L422 ceAbstractionStarter]: At program point L45-3(lines 45 49) the Hoare annotation is: (let ((.cse0 (= __ieee754_sqrt_~x |__ieee754_sqrt_#in~x|))) (or (and .cse0 (= (bvadd __ieee754_sqrt_~sign~0 (_ bv2147483648 32)) (_ bv0 32)) (exists ((|v_q#valueAsBitvector_11| (_ BitVec 64))) (and (not (= (bvor (bvand ((_ extract 63 32) |v_q#valueAsBitvector_11|) (_ bv2147483647 32)) ((_ extract 31 0) |v_q#valueAsBitvector_11|)) (_ bv0 32))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_11|) ((_ extract 62 52) |v_q#valueAsBitvector_11|) ((_ extract 51 0) |v_q#valueAsBitvector_11|)) |__ieee754_sqrt_#in~x|)))) (and .cse0 (exists ((|v_q#valueAsBitvector_9| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_q#valueAsBitvector_9|) __ieee754_sqrt_~ix0~0) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_9|) ((_ extract 62 52) |v_q#valueAsBitvector_9|) ((_ extract 51 0) |v_q#valueAsBitvector_9|)) |__ieee754_sqrt_#in~x|))) (exists ((|v_q#valueAsBitvector_9| (_ BitVec 64))) (and (not (bvsle ((_ extract 63 32) |v_q#valueAsBitvector_9|) (_ bv0 32))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_9|) ((_ extract 62 52) |v_q#valueAsBitvector_9|) ((_ extract 51 0) |v_q#valueAsBitvector_9|)) |__ieee754_sqrt_#in~x|)))))) [2018-09-20 14:47:04,714 INFO L426 ceAbstractionStarter]: For program point L45-4(lines 45 49) no Hoare annotation was computed. [2018-09-20 14:47:04,714 INFO L426 ceAbstractionStarter]: For program point L37(lines 37 40) no Hoare annotation was computed. [2018-09-20 14:47:04,714 INFO L426 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-09-20 14:47:04,714 INFO L426 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2018-09-20 14:47:04,714 INFO L426 ceAbstractionStarter]: For program point L29-2(line 29) no Hoare annotation was computed. [2018-09-20 14:47:04,714 INFO L426 ceAbstractionStarter]: For program point L29-3(line 29) no Hoare annotation was computed. [2018-09-20 14:47:04,715 INFO L426 ceAbstractionStarter]: For program point L87(lines 87 88) no Hoare annotation was computed. [2018-09-20 14:47:04,715 INFO L426 ceAbstractionStarter]: For program point L120-1(lines 120 125) no Hoare annotation was computed. [2018-09-20 14:47:04,715 INFO L426 ceAbstractionStarter]: For program point L87-2(lines 87 88) no Hoare annotation was computed. [2018-09-20 14:47:04,715 INFO L422 ceAbstractionStarter]: At program point L120-3(lines 120 125) the Hoare annotation is: (let ((.cse0 (= __ieee754_sqrt_~x |__ieee754_sqrt_#in~x|))) (or (and .cse0 (= (bvadd __ieee754_sqrt_~sign~0 (_ bv2147483648 32)) (_ bv0 32)) (exists ((|v_q#valueAsBitvector_11| (_ BitVec 64))) (and (not (= (bvor (bvand ((_ extract 63 32) |v_q#valueAsBitvector_11|) (_ bv2147483647 32)) ((_ extract 31 0) |v_q#valueAsBitvector_11|)) (_ bv0 32))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_11|) ((_ extract 62 52) |v_q#valueAsBitvector_11|) ((_ extract 51 0) |v_q#valueAsBitvector_11|)) |__ieee754_sqrt_#in~x|)))) (and .cse0 (exists ((|v_q#valueAsBitvector_9| (_ BitVec 64))) (and (not (bvsle ((_ extract 63 32) |v_q#valueAsBitvector_9|) (_ bv0 32))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_9|) ((_ extract 62 52) |v_q#valueAsBitvector_9|) ((_ extract 51 0) |v_q#valueAsBitvector_9|)) |__ieee754_sqrt_#in~x|)))) (and .cse0 (exists ((|v_q#valueAsBitvector_10| (_ BitVec 64))) (and (not (= (_ bv0 32) (bvashr ((_ extract 63 32) |v_q#valueAsBitvector_10|) (_ bv20 32)))) (= |__ieee754_sqrt_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_10|) ((_ extract 62 52) |v_q#valueAsBitvector_10|) ((_ extract 51 0) |v_q#valueAsBitvector_10|)))))))) [2018-09-20 14:47:04,715 INFO L426 ceAbstractionStarter]: For program point L120-4(lines 120 125) no Hoare annotation was computed. [2018-09-20 14:47:04,715 INFO L426 ceAbstractionStarter]: For program point L104(lines 104 112) no Hoare annotation was computed. [2018-09-20 14:47:04,715 INFO L426 ceAbstractionStarter]: For program point L71(lines 71 75) no Hoare annotation was computed. [2018-09-20 14:47:04,715 INFO L426 ceAbstractionStarter]: For program point L71-2(lines 71 75) no Hoare annotation was computed. [2018-09-20 14:47:04,717 INFO L426 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-09-20 14:47:04,717 INFO L426 ceAbstractionStarter]: For program point L121-1(line 121) no Hoare annotation was computed. [2018-09-20 14:47:04,717 INFO L426 ceAbstractionStarter]: For program point L121-2(line 121) no Hoare annotation was computed. [2018-09-20 14:47:04,717 INFO L426 ceAbstractionStarter]: For program point L121-3(line 121) no Hoare annotation was computed. [2018-09-20 14:47:04,717 INFO L426 ceAbstractionStarter]: For program point L39(lines 39 40) no Hoare annotation was computed. [2018-09-20 14:47:04,717 INFO L426 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2018-09-20 14:47:04,717 INFO L426 ceAbstractionStarter]: For program point __ieee754_sqrtEXIT(lines 19 127) no Hoare annotation was computed. [2018-09-20 14:47:04,717 INFO L426 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-09-20 14:47:04,717 INFO L426 ceAbstractionStarter]: For program point L90(lines 90 91) no Hoare annotation was computed. [2018-09-20 14:47:04,718 INFO L426 ceAbstractionStarter]: For program point L90-2(lines 90 91) no Hoare annotation was computed. [2018-09-20 14:47:04,718 INFO L426 ceAbstractionStarter]: For program point L82-1(lines 82 98) no Hoare annotation was computed. [2018-09-20 14:47:04,718 INFO L422 ceAbstractionStarter]: At program point L82-3(lines 82 98) the Hoare annotation is: (let ((.cse0 (= __ieee754_sqrt_~x |__ieee754_sqrt_#in~x|))) (or (and .cse0 (= (bvadd __ieee754_sqrt_~sign~0 (_ bv2147483648 32)) (_ bv0 32)) (exists ((|v_q#valueAsBitvector_11| (_ BitVec 64))) (and (not (= (bvor (bvand ((_ extract 63 32) |v_q#valueAsBitvector_11|) (_ bv2147483647 32)) ((_ extract 31 0) |v_q#valueAsBitvector_11|)) (_ bv0 32))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_11|) ((_ extract 62 52) |v_q#valueAsBitvector_11|) ((_ extract 51 0) |v_q#valueAsBitvector_11|)) |__ieee754_sqrt_#in~x|)))) (and .cse0 (exists ((|v_q#valueAsBitvector_9| (_ BitVec 64))) (and (not (bvsle ((_ extract 63 32) |v_q#valueAsBitvector_9|) (_ bv0 32))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_9|) ((_ extract 62 52) |v_q#valueAsBitvector_9|) ((_ extract 51 0) |v_q#valueAsBitvector_9|)) |__ieee754_sqrt_#in~x|)))) (and .cse0 (exists ((|v_q#valueAsBitvector_10| (_ BitVec 64))) (and (not (= (_ bv0 32) (bvashr ((_ extract 63 32) |v_q#valueAsBitvector_10|) (_ bv20 32)))) (= |__ieee754_sqrt_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_10|) ((_ extract 62 52) |v_q#valueAsBitvector_10|) ((_ extract 51 0) |v_q#valueAsBitvector_10|)))))))) [2018-09-20 14:47:04,718 INFO L426 ceAbstractionStarter]: For program point L82-4(lines 19 127) no Hoare annotation was computed. [2018-09-20 14:47:04,718 INFO L426 ceAbstractionStarter]: For program point L107(lines 107 112) no Hoare annotation was computed. [2018-09-20 14:47:04,718 INFO L426 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-09-20 14:47:04,718 INFO L426 ceAbstractionStarter]: For program point L124-1(line 124) no Hoare annotation was computed. [2018-09-20 14:47:04,718 INFO L426 ceAbstractionStarter]: For program point L58(lines 58 61) no Hoare annotation was computed. [2018-09-20 14:47:04,719 INFO L426 ceAbstractionStarter]: For program point L124-2(line 124) no Hoare annotation was computed. [2018-09-20 14:47:04,719 INFO L426 ceAbstractionStarter]: For program point L124-3(line 124) no Hoare annotation was computed. [2018-09-20 14:47:04,719 INFO L426 ceAbstractionStarter]: For program point L25-1(lines 25 30) no Hoare annotation was computed. [2018-09-20 14:47:04,719 INFO L426 ceAbstractionStarter]: For program point L58-2(lines 58 61) no Hoare annotation was computed. [2018-09-20 14:47:04,719 INFO L422 ceAbstractionStarter]: At program point L25-3(lines 25 30) the Hoare annotation is: (and (= __ieee754_sqrt_~x |__ieee754_sqrt_#in~x|) (= (bvadd __ieee754_sqrt_~sign~0 (_ bv2147483648 32)) (_ bv0 32))) [2018-09-20 14:47:04,719 INFO L426 ceAbstractionStarter]: For program point L25-4(lines 19 127) no Hoare annotation was computed. [2018-09-20 14:47:04,719 INFO L426 ceAbstractionStarter]: For program point L50-1(lines 50 51) no Hoare annotation was computed. [2018-09-20 14:47:04,719 INFO L426 ceAbstractionStarter]: For program point L50-3(lines 50 51) no Hoare annotation was computed. [2018-09-20 14:47:04,719 INFO L422 ceAbstractionStarter]: At program point L50-4(lines 50 51) the Hoare annotation is: (let ((.cse0 (= __ieee754_sqrt_~x |__ieee754_sqrt_#in~x|))) (or (and .cse0 (= (bvadd __ieee754_sqrt_~sign~0 (_ bv2147483648 32)) (_ bv0 32)) (exists ((|v_q#valueAsBitvector_11| (_ BitVec 64))) (and (not (= (bvor (bvand ((_ extract 63 32) |v_q#valueAsBitvector_11|) (_ bv2147483647 32)) ((_ extract 31 0) |v_q#valueAsBitvector_11|)) (_ bv0 32))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_11|) ((_ extract 62 52) |v_q#valueAsBitvector_11|) ((_ extract 51 0) |v_q#valueAsBitvector_11|)) |__ieee754_sqrt_#in~x|)))) (and .cse0 (exists ((|v_q#valueAsBitvector_9| (_ BitVec 64))) (and (not (bvsle ((_ extract 63 32) |v_q#valueAsBitvector_9|) (_ bv0 32))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_9|) ((_ extract 62 52) |v_q#valueAsBitvector_9|) ((_ extract 51 0) |v_q#valueAsBitvector_9|)) |__ieee754_sqrt_#in~x|)))))) [2018-09-20 14:47:04,720 INFO L426 ceAbstractionStarter]: For program point L50-5(lines 50 51) no Hoare annotation was computed. [2018-09-20 14:47:04,720 INFO L426 ceAbstractionStarter]: For program point L108(lines 108 109) no Hoare annotation was computed. [2018-09-20 14:47:04,720 INFO L426 ceAbstractionStarter]: For program point L108-2(lines 108 109) no Hoare annotation was computed. [2018-09-20 14:47:04,720 INFO L426 ceAbstractionStarter]: For program point L100(lines 100 114) no Hoare annotation was computed. [2018-09-20 14:47:04,720 INFO L426 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-09-20 14:47:04,720 INFO L426 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-09-20 14:47:04,720 INFO L426 ceAbstractionStarter]: For program point L26-2(line 26) no Hoare annotation was computed. [2018-09-20 14:47:04,720 INFO L426 ceAbstractionStarter]: For program point L26-3(line 26) no Hoare annotation was computed. [2018-09-20 14:47:04,720 INFO L426 ceAbstractionStarter]: For program point L117(lines 117 118) no Hoare annotation was computed. [2018-09-20 14:47:04,720 INFO L426 ceAbstractionStarter]: For program point L117-2(lines 117 118) no Hoare annotation was computed. [2018-09-20 14:47:04,720 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-20 14:47:04,720 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-09-20 14:47:04,721 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-20 14:47:04,721 INFO L422 ceAbstractionStarter]: At program point L132-3(lines 132 136) the Hoare annotation is: (= |__signbit_double_#in~x| __signbit_double_~x) [2018-09-20 14:47:04,721 INFO L426 ceAbstractionStarter]: For program point L132-4(lines 132 136) no Hoare annotation was computed. [2018-09-20 14:47:04,721 INFO L426 ceAbstractionStarter]: For program point __signbit_doubleFINAL(lines 129 139) no Hoare annotation was computed. [2018-09-20 14:47:04,721 INFO L426 ceAbstractionStarter]: For program point __signbit_doubleEXIT(lines 129 139) no Hoare annotation was computed. [2018-09-20 14:47:04,721 INFO L429 ceAbstractionStarter]: At program point __signbit_doubleENTRY(lines 129 139) the Hoare annotation is: true [2018-09-20 14:47:04,721 INFO L426 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-09-20 14:47:04,721 INFO L426 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2018-09-20 14:47:04,727 INFO L426 ceAbstractionStarter]: For program point L135-1(line 135) no Hoare annotation was computed. [2018-09-20 14:47:04,727 INFO L426 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-09-20 14:47:04,727 INFO L426 ceAbstractionStarter]: For program point L135-2(line 135) no Hoare annotation was computed. [2018-09-20 14:47:04,727 INFO L426 ceAbstractionStarter]: For program point L133-1(line 133) no Hoare annotation was computed. [2018-09-20 14:47:04,727 INFO L426 ceAbstractionStarter]: For program point L133-2(line 133) no Hoare annotation was computed. [2018-09-20 14:47:04,727 INFO L426 ceAbstractionStarter]: For program point L132-1(lines 132 136) no Hoare annotation was computed. [2018-09-20 14:47:04,727 INFO L426 ceAbstractionStarter]: For program point L133-3(line 133) no Hoare annotation was computed. [2018-09-20 14:47:04,727 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-20 14:47:04,727 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-20 14:47:04,728 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-20 14:47:04,728 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-20 14:47:04,728 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 141 159) the Hoare annotation is: true [2018-09-20 14:47:04,728 INFO L426 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-09-20 14:47:04,728 INFO L426 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-09-20 14:47:04,728 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 141 159) no Hoare annotation was computed. [2018-09-20 14:47:04,728 INFO L422 ceAbstractionStarter]: At program point L153-1(line 153) the Hoare annotation is: (and (= (_ +zero 11 53) main_~x~0) (= (_ +zero 11 53) main_~res~0) |main_#t~short11|) [2018-09-20 14:47:04,728 INFO L426 ceAbstractionStarter]: For program point L153-2(line 153) no Hoare annotation was computed. [2018-09-20 14:47:04,728 INFO L422 ceAbstractionStarter]: At program point L150(line 150) the Hoare annotation is: (= (_ +zero 11 53) main_~x~0) [2018-09-20 14:47:04,728 INFO L426 ceAbstractionStarter]: For program point L150-1(line 150) no Hoare annotation was computed. [2018-09-20 14:47:04,729 INFO L426 ceAbstractionStarter]: For program point L153-4(lines 153 156) no Hoare annotation was computed. [2018-09-20 14:47:04,729 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 154) no Hoare annotation was computed. [2018-09-20 14:47:04,729 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 141 159) no Hoare annotation was computed. [2018-09-20 14:47:04,742 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,744 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,744 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,745 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,745 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,745 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,745 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,745 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,745 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,746 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,746 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,746 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,746 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,756 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,756 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,756 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,756 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,757 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,758 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,758 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,758 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,758 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,758 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,759 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,759 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,759 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,761 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,762 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,762 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,762 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,762 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,762 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,763 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,763 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,763 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,763 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,763 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,763 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,764 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,769 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,769 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,770 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,770 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,770 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,770 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,770 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,770 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,771 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,771 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,771 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,771 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,771 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,776 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,777 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,777 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,777 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,778 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,778 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,778 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,778 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,778 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,779 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,779 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,779 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,779 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,780 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,784 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,785 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,785 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,785 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,785 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,785 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,786 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,786 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,786 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,786 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,790 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,790 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,791 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,792 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,792 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,792 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,792 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,795 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,795 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,795 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,796 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,796 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,797 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,797 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,797 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,801 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,801 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,801 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,801 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,801 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,802 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,802 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,802 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,802 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,802 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,805 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,806 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,806 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,807 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,807 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,809 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,810 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,810 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,810 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,810 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,810 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,812 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,813 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,814 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,814 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,814 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,814 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,814 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,814 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,815 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,815 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 02:47:04 BoogieIcfgContainer [2018-09-20 14:47:04,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 14:47:04,821 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 14:47:04,821 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 14:47:04,821 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 14:47:04,822 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:46:02" (3/4) ... [2018-09-20 14:47:04,829 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-09-20 14:47:04,837 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __ieee754_sqrt [2018-09-20 14:47:04,837 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-09-20 14:47:04,837 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __signbit_double [2018-09-20 14:47:04,838 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-09-20 14:47:04,845 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2018-09-20 14:47:04,846 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-09-20 14:47:04,846 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-09-20 14:47:04,876 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: x == \old(x) && ~bvadd64(sign, 2147483648bv32) == 0bv32 [2018-09-20 14:47:04,877 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-09-20 14:47:04,877 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((x == \old(x) && ~bvadd64(sign, 2147483648bv32) == 0bv32) && (\exists v_q#valueAsBitvector_11 : bv64 :: !(~bvor32(~bvand32(v_q#valueAsBitvector_11[63:32], 2147483647bv32), v_q#valueAsBitvector_11[31:0]) == 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_11[63:63], v_q#valueAsBitvector_11[62:52], v_q#valueAsBitvector_11[51:0]) == \old(x))) || ((x == \old(x) && (\exists v_q#valueAsBitvector_9 : bv64 :: v_q#valueAsBitvector_9[63:32] == ix0 && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == \old(x))) && (\exists v_q#valueAsBitvector_9 : bv64 :: !~bvsle32(v_q#valueAsBitvector_9[63:32], 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == \old(x))) [2018-09-20 14:47:04,877 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((x == \old(x) && ~bvadd64(sign, 2147483648bv32) == 0bv32) && (\exists v_q#valueAsBitvector_11 : bv64 :: !(~bvor32(~bvand32(v_q#valueAsBitvector_11[63:32], 2147483647bv32), v_q#valueAsBitvector_11[31:0]) == 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_11[63:63], v_q#valueAsBitvector_11[62:52], v_q#valueAsBitvector_11[51:0]) == \old(x))) || (x == \old(x) && (\exists v_q#valueAsBitvector_9 : bv64 :: !~bvsle32(v_q#valueAsBitvector_9[63:32], 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == \old(x))) [2018-09-20 14:47:04,878 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((x == \old(x) && ~bvadd64(sign, 2147483648bv32) == 0bv32) && (\exists v_q#valueAsBitvector_11 : bv64 :: !(~bvor32(~bvand32(v_q#valueAsBitvector_11[63:32], 2147483647bv32), v_q#valueAsBitvector_11[31:0]) == 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_11[63:63], v_q#valueAsBitvector_11[62:52], v_q#valueAsBitvector_11[51:0]) == \old(x))) || (x == \old(x) && (\exists v_q#valueAsBitvector_10 : bv64 :: !(0bv32 == ~bvashr32(v_q#valueAsBitvector_10[63:32], 20bv32)) && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_10[63:63], v_q#valueAsBitvector_10[62:52], v_q#valueAsBitvector_10[51:0])))) || (x == \old(x) && (\exists v_q#valueAsBitvector_9 : bv64 :: !~bvsle32(v_q#valueAsBitvector_9[63:32], 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == \old(x))) [2018-09-20 14:47:04,878 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((x == \old(x) && ~bvadd64(sign, 2147483648bv32) == 0bv32) && (\exists v_q#valueAsBitvector_11 : bv64 :: !(~bvor32(~bvand32(v_q#valueAsBitvector_11[63:32], 2147483647bv32), v_q#valueAsBitvector_11[31:0]) == 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_11[63:63], v_q#valueAsBitvector_11[62:52], v_q#valueAsBitvector_11[51:0]) == \old(x))) || (x == \old(x) && (\exists v_q#valueAsBitvector_9 : bv64 :: !~bvsle32(v_q#valueAsBitvector_9[63:32], 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == \old(x)))) || (x == \old(x) && (\exists v_q#valueAsBitvector_10 : bv64 :: !(0bv32 == ~bvashr32(v_q#valueAsBitvector_10[63:32], 20bv32)) && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_10[63:63], v_q#valueAsBitvector_10[62:52], v_q#valueAsBitvector_10[51:0]))) [2018-09-20 14:47:04,881 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((x == \old(x) && ~bvadd64(sign, 2147483648bv32) == 0bv32) && (\exists v_q#valueAsBitvector_11 : bv64 :: !(~bvor32(~bvand32(v_q#valueAsBitvector_11[63:32], 2147483647bv32), v_q#valueAsBitvector_11[31:0]) == 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_11[63:63], v_q#valueAsBitvector_11[62:52], v_q#valueAsBitvector_11[51:0]) == \old(x))) || (x == \old(x) && (\exists v_q#valueAsBitvector_9 : bv64 :: !~bvsle32(v_q#valueAsBitvector_9[63:32], 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == \old(x)))) || (x == \old(x) && (\exists v_q#valueAsBitvector_10 : bv64 :: !(0bv32 == ~bvashr32(v_q#valueAsBitvector_10[63:32], 20bv32)) && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_10[63:63], v_q#valueAsBitvector_10[62:52], v_q#valueAsBitvector_10[51:0]))) [2018-09-20 14:47:04,924 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-09-20 14:47:04,925 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 14:47:04,926 INFO L168 Benchmark]: Toolchain (without parser) took 67303.91 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.3 MB). Free memory was 950.5 MB in the beginning and 1.3 GB in the end (delta: -308.0 MB). Peak memory consumption was 306.9 kB. Max. memory is 11.5 GB. [2018-09-20 14:47:04,928 INFO L168 Benchmark]: CDTParser took 0.20 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 14:47:04,928 INFO L168 Benchmark]: CACSL2BoogieTranslator took 393.01 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 14:47:04,929 INFO L168 Benchmark]: Boogie Preprocessor took 59.94 ms. Allocated memory is still 1.0 GB. Free memory is still 934.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 14:47:04,929 INFO L168 Benchmark]: RCFGBuilder took 4369.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2018-09-20 14:47:04,930 INFO L168 Benchmark]: TraceAbstraction took 62370.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -151.4 MB). Peak memory consumption was 405.1 MB. Max. memory is 11.5 GB. [2018-09-20 14:47:04,930 INFO L168 Benchmark]: Witness Printer took 103.87 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2018-09-20 14:47:04,935 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.20 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 393.01 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 59.94 ms. Allocated memory is still 1.0 GB. Free memory is still 934.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 4369.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 62370.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -151.4 MB). Peak memory consumption was 405.1 MB. Max. memory is 11.5 GB. * Witness Printer took 103.87 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 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_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 154]: 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: 120]: Loop Invariant [2018-09-20 14:47:04,955 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,955 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,955 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,955 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,956 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,956 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,956 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,956 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,956 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,956 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,957 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,957 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,957 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,961 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,961 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,961 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,961 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,962 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,962 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,962 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,962 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,962 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,962 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,963 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,963 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,963 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] Derived loop invariant: (((x == \old(x) && ~bvadd64(sign, 2147483648bv32) == 0bv32) && (\exists v_q#valueAsBitvector_11 : bv64 :: !(~bvor32(~bvand32(v_q#valueAsBitvector_11[63:32], 2147483647bv32), v_q#valueAsBitvector_11[31:0]) == 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_11[63:63], v_q#valueAsBitvector_11[62:52], v_q#valueAsBitvector_11[51:0]) == \old(x))) || (x == \old(x) && (\exists v_q#valueAsBitvector_9 : bv64 :: !~bvsle32(v_q#valueAsBitvector_9[63:32], 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == \old(x)))) || (x == \old(x) && (\exists v_q#valueAsBitvector_10 : bv64 :: !(0bv32 == ~bvashr32(v_q#valueAsBitvector_10[63:32], 20bv32)) && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_10[63:63], v_q#valueAsBitvector_10[62:52], v_q#valueAsBitvector_10[51:0]))) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 45]: Loop Invariant [2018-09-20 14:47:04,964 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,964 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,964 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,964 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,965 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,965 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,965 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,965 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,965 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,968 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,969 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,969 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,969 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,970 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,970 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,970 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,970 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,975 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,975 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,975 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,975 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,975 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,975 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,976 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,976 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,976 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] Derived loop invariant: ((x == \old(x) && ~bvadd64(sign, 2147483648bv32) == 0bv32) && (\exists v_q#valueAsBitvector_11 : bv64 :: !(~bvor32(~bvand32(v_q#valueAsBitvector_11[63:32], 2147483647bv32), v_q#valueAsBitvector_11[31:0]) == 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_11[63:63], v_q#valueAsBitvector_11[62:52], v_q#valueAsBitvector_11[51:0]) == \old(x))) || ((x == \old(x) && (\exists v_q#valueAsBitvector_9 : bv64 :: v_q#valueAsBitvector_9[63:32] == ix0 && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == \old(x))) && (\exists v_q#valueAsBitvector_9 : bv64 :: !~bvsle32(v_q#valueAsBitvector_9[63:32], 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == \old(x))) - InvariantResult [Line: 82]: Loop Invariant [2018-09-20 14:47:04,977 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,977 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,977 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,977 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,979 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,980 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,980 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,980 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,980 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,980 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,981 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,981 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,981 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,985 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,986 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,986 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,986 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,986 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,986 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,986 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,987 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,987 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,987 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,987 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,987 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,987 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] Derived loop invariant: (((x == \old(x) && ~bvadd64(sign, 2147483648bv32) == 0bv32) && (\exists v_q#valueAsBitvector_11 : bv64 :: !(~bvor32(~bvand32(v_q#valueAsBitvector_11[63:32], 2147483647bv32), v_q#valueAsBitvector_11[31:0]) == 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_11[63:63], v_q#valueAsBitvector_11[62:52], v_q#valueAsBitvector_11[51:0]) == \old(x))) || (x == \old(x) && (\exists v_q#valueAsBitvector_9 : bv64 :: !~bvsle32(v_q#valueAsBitvector_9[63:32], 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == \old(x)))) || (x == \old(x) && (\exists v_q#valueAsBitvector_10 : bv64 :: !(0bv32 == ~bvashr32(v_q#valueAsBitvector_10[63:32], 20bv32)) && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_10[63:63], v_q#valueAsBitvector_10[62:52], v_q#valueAsBitvector_10[51:0]))) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: x == \old(x) && ~bvadd64(sign, 2147483648bv32) == 0bv32 - InvariantResult [Line: 69]: Loop Invariant [2018-09-20 14:47:04,990 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,991 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,991 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,991 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,991 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,991 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,991 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,992 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,992 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,992 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,992 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,992 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,994 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:04,995 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,995 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,996 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,996 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,996 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:04,996 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:04,996 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:05,000 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:05,000 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-20 14:47:05,000 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:05,000 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:05,000 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:05,000 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] Derived loop invariant: (((x == \old(x) && ~bvadd64(sign, 2147483648bv32) == 0bv32) && (\exists v_q#valueAsBitvector_11 : bv64 :: !(~bvor32(~bvand32(v_q#valueAsBitvector_11[63:32], 2147483647bv32), v_q#valueAsBitvector_11[31:0]) == 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_11[63:63], v_q#valueAsBitvector_11[62:52], v_q#valueAsBitvector_11[51:0]) == \old(x))) || (x == \old(x) && (\exists v_q#valueAsBitvector_10 : bv64 :: !(0bv32 == ~bvashr32(v_q#valueAsBitvector_10[63:32], 20bv32)) && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_10[63:63], v_q#valueAsBitvector_10[62:52], v_q#valueAsBitvector_10[51:0])))) || (x == \old(x) && (\exists v_q#valueAsBitvector_9 : bv64 :: !~bvsle32(v_q#valueAsBitvector_9[63:32], 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == \old(x))) - InvariantResult [Line: 50]: Loop Invariant [2018-09-20 14:47:05,001 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:05,001 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:05,005 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:05,005 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:05,005 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:05,005 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:05,005 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:05,005 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:05,005 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:05,006 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:05,006 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:05,006 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:05,007 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:05,007 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-20 14:47:05,007 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:05,007 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:05,007 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-20 14:47:05,007 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] Derived loop invariant: ((x == \old(x) && ~bvadd64(sign, 2147483648bv32) == 0bv32) && (\exists v_q#valueAsBitvector_11 : bv64 :: !(~bvor32(~bvand32(v_q#valueAsBitvector_11[63:32], 2147483647bv32), v_q#valueAsBitvector_11[31:0]) == 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_11[63:63], v_q#valueAsBitvector_11[62:52], v_q#valueAsBitvector_11[51:0]) == \old(x))) || (x == \old(x) && (\exists v_q#valueAsBitvector_9 : bv64 :: !~bvsle32(v_q#valueAsBitvector_9[63:32], 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == \old(x))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 100 locations, 1 error locations. SAFE Result, 62.1s OverallTime, 14 OverallIterations, 11 TraceHistogramMax, 47.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1407 SDtfs, 1147 SDslu, 5489 SDs, 0 SdLazy, 1817 SolverSat, 137 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 27.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1136 GetRequests, 979 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 25.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=13, 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.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 37 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 39 PreInvPairs, 73 NumberOfFragments, 365 HoareAnnotationTreeSize, 39 FomulaSimplifications, 2171 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 15 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 844 NumberOfCodeBlocks, 780 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1068 ConstructedInterpolants, 251 QuantifiedInterpolants, 531784 SizeOfPredicates, 78 NumberOfNonLiveVariables, 1572 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 308/392 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...