/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1251_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 40ef5092 Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1251_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 df3954142d6b55c98b13b60b9fbaf053d4d402ff ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1251_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 df3954142d6b55c98b13b60b9fbaf053d4d402ff ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-40ef509 [2018-09-20 15:31:46,689 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:31:46,691 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:31:46,709 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:31:46,710 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:31:46,711 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:31:46,713 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:31:46,718 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:31:46,720 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:31:46,722 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:31:46,723 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:31:46,725 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:31:46,726 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:31:46,727 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:31:46,733 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:31:46,734 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:31:46,734 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:31:46,736 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:31:46,742 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:31:46,749 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:31:46,750 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:31:46,755 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:31:46,757 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:31:46,760 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:31:46,760 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:31:46,761 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:31:46,765 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:31:46,765 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:31:46,766 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:31:46,769 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:31:46,770 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:31:46,770 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:31:46,771 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:31:46,771 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:31:46,774 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:31:46,775 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:31:46,775 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-20 15:31:46,803 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:31:46,804 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:31:46,805 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:31:46,805 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:31:46,806 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:31:46,806 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:31:46,806 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:31:46,807 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:31:46,807 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:31:46,807 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-20 15:31:46,807 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:31:46,810 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:31:46,810 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:31:46,810 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:31:46,810 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:31:46,810 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:31:46,811 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:31:46,811 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:31:46,811 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:31:46,811 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:31:46,811 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:31:46,812 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:31:46,812 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:31:46,812 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:31:46,812 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:31:46,812 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:31:46,815 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-20 15:31:46,815 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:31:46,815 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-20 15:31:46,816 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 -> df3954142d6b55c98b13b60b9fbaf053d4d402ff [2018-09-20 15:31:46,868 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:31:46,888 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:31:46,892 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:31:46,894 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:31:46,894 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:31:46,896 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1251_true-unreach-call.c [2018-09-20 15:31:47,260 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a93ac5a16/f43708d6b6c54b708e399afa1ed6fd28/FLAG9cd8fb662 [2018-09-20 15:31:47,415 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:31:47,416 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1251_true-unreach-call.c [2018-09-20 15:31:47,423 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a93ac5a16/f43708d6b6c54b708e399afa1ed6fd28/FLAG9cd8fb662 [2018-09-20 15:31:47,440 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a93ac5a16/f43708d6b6c54b708e399afa1ed6fd28 [2018-09-20 15:31:47,446 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:31:47,450 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:31:47,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:31:47,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:31:47,458 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:31:47,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:31:47" (1/1) ... [2018-09-20 15:31:47,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1df3bb67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:47, skipping insertion in model container [2018-09-20 15:31:47,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:31:47" (1/1) ... [2018-09-20 15:31:47,474 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:31:47,687 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:31:47,711 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:31:47,735 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:31:47,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:47 WrapperNode [2018-09-20 15:31:47,784 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:31:47,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:31:47,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:31:47,785 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:31:47,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:47" (1/1) ... [2018-09-20 15:31:47,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:47" (1/1) ... [2018-09-20 15:31:47,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:47" (1/1) ... [2018-09-20 15:31:47,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:47" (1/1) ... [2018-09-20 15:31:47,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:47" (1/1) ... [2018-09-20 15:31:47,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:47" (1/1) ... [2018-09-20 15:31:47,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:47" (1/1) ... [2018-09-20 15:31:47,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:31:47,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:31:47,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:31:47,865 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:31:47,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:31:47,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:31:47,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:31:47,944 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2018-09-20 15:31:47,944 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_float [2018-09-20 15:31:47,944 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2018-09-20 15:31:47,944 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:31:47,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:31:47,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-09-20 15:31:47,945 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2018-09-20 15:31:47,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:31:47,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-09-20 15:31:47,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-09-20 15:31:47,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:31:47,948 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_float [2018-09-20 15:31:47,948 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2018-09-20 15:31:47,948 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:31:47,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:31:47,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:31:47,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-09-20 15:31:47,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-09-20 15:31:47,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2018-09-20 15:31:47,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-09-20 15:31:48,689 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:31:48,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:31:48 BoogieIcfgContainer [2018-09-20 15:31:48,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:31:48,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:31:48,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:31:48,694 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:31:48,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:31:47" (1/3) ... [2018-09-20 15:31:48,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24bb72ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:31:48, skipping insertion in model container [2018-09-20 15:31:48,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:47" (2/3) ... [2018-09-20 15:31:48,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24bb72ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:31:48, skipping insertion in model container [2018-09-20 15:31:48,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:31:48" (3/3) ... [2018-09-20 15:31:48,697 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251_true-unreach-call.c [2018-09-20 15:31:48,707 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:31:48,721 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-09-20 15:31:48,768 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:31:48,769 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:31:48,769 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:31:48,769 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:31:48,769 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:31:48,770 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:31:48,770 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:31:48,770 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:31:48,770 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:31:48,791 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2018-09-20 15:31:48,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-20 15:31:48,801 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:48,802 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] [2018-09-20 15:31:48,805 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:48,812 INFO L82 PathProgramCache]: Analyzing trace with hash -807579100, now seen corresponding path program 1 times [2018-09-20 15:31:48,814 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:31:48,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:31:48,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:48,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:48,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:48,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-20 15:31:48,997 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:48,998 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:31:49,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:31:49,018 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:31:49,019 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:31:49,023 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 2 states. [2018-09-20 15:31:49,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:49,056 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2018-09-20 15:31:49,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:31:49,058 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 36 [2018-09-20 15:31:49,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:49,069 INFO L225 Difference]: With dead ends: 125 [2018-09-20 15:31:49,069 INFO L226 Difference]: Without dead ends: 69 [2018-09-20 15:31:49,074 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:31:49,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-20 15:31:49,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-20 15:31:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-20 15:31:49,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2018-09-20 15:31:49,129 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 36 [2018-09-20 15:31:49,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:49,132 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2018-09-20 15:31:49,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:31:49,132 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2018-09-20 15:31:49,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-20 15:31:49,136 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:49,136 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] [2018-09-20 15:31:49,136 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:49,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1672941198, now seen corresponding path program 1 times [2018-09-20 15:31:49,137 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:31:49,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:31:49,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:49,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:49,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:49,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-20 15:31:49,287 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:49,287 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:31:49,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:31:49,290 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:31:49,291 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:31:49,291 INFO L87 Difference]: Start difference. First operand 69 states and 88 transitions. Second operand 4 states. [2018-09-20 15:31:49,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:49,439 INFO L93 Difference]: Finished difference Result 128 states and 163 transitions. [2018-09-20 15:31:49,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-20 15:31:49,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-09-20 15:31:49,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:49,442 INFO L225 Difference]: With dead ends: 128 [2018-09-20 15:31:49,442 INFO L226 Difference]: Without dead ends: 78 [2018-09-20 15:31:49,444 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-20 15:31:49,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-20 15:31:49,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2018-09-20 15:31:49,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-20 15:31:49,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2018-09-20 15:31:49,459 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 45 [2018-09-20 15:31:49,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:49,459 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2018-09-20 15:31:49,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:31:49,460 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2018-09-20 15:31:49,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-20 15:31:49,462 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:49,462 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:31:49,463 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:49,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1017263635, now seen corresponding path program 1 times [2018-09-20 15:31:49,463 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:31:49,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:31:49,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:49,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:49,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:49,575 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-20 15:31:49,575 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:49,576 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:31:49,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:31:49,577 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:31:49,577 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:31:49,578 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand 4 states. [2018-09-20 15:31:49,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:49,654 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2018-09-20 15:31:49,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:31:49,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-09-20 15:31:49,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:49,662 INFO L225 Difference]: With dead ends: 97 [2018-09-20 15:31:49,664 INFO L226 Difference]: Without dead ends: 75 [2018-09-20 15:31:49,665 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:31:49,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-20 15:31:49,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-20 15:31:49,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-20 15:31:49,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2018-09-20 15:31:49,678 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 50 [2018-09-20 15:31:49,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:49,678 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2018-09-20 15:31:49,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:31:49,679 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2018-09-20 15:31:49,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-20 15:31:49,682 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:49,682 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:31:49,682 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:49,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1549238344, now seen corresponding path program 1 times [2018-09-20 15:31:49,683 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:31:49,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:31:49,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:49,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:49,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:49,805 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-20 15:31:49,805 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:49,806 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:31:49,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:31:49,808 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:31:49,809 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:31:49,810 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand 4 states. [2018-09-20 15:31:49,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:49,942 INFO L93 Difference]: Finished difference Result 101 states and 127 transitions. [2018-09-20 15:31:49,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:31:49,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-09-20 15:31:49,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:49,947 INFO L225 Difference]: With dead ends: 101 [2018-09-20 15:31:49,948 INFO L226 Difference]: Without dead ends: 79 [2018-09-20 15:31:49,949 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:31:49,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-20 15:31:49,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-09-20 15:31:49,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-20 15:31:49,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2018-09-20 15:31:49,974 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 53 [2018-09-20 15:31:49,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:49,975 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2018-09-20 15:31:49,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:31:49,975 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2018-09-20 15:31:49,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-20 15:31:49,981 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:49,982 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:31:49,982 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:49,982 INFO L82 PathProgramCache]: Analyzing trace with hash -2059772521, now seen corresponding path program 1 times [2018-09-20 15:31:49,982 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:31:49,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:31:49,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:49,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:49,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:50,108 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-20 15:31:50,108 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:50,108 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-20 15:31:50,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-20 15:31:50,109 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-20 15:31:50,109 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-20 15:31:50,110 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand 3 states. [2018-09-20 15:31:50,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:50,185 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2018-09-20 15:31:50,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-20 15:31:50,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-09-20 15:31:50,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:50,187 INFO L225 Difference]: With dead ends: 78 [2018-09-20 15:31:50,188 INFO L226 Difference]: Without dead ends: 76 [2018-09-20 15:31:50,188 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 15:31:50,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-20 15:31:50,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-09-20 15:31:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-20 15:31:50,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 96 transitions. [2018-09-20 15:31:50,206 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 96 transitions. Word has length 53 [2018-09-20 15:31:50,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:50,207 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 96 transitions. [2018-09-20 15:31:50,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-20 15:31:50,209 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2018-09-20 15:31:50,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-20 15:31:50,211 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:50,211 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:31:50,213 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:50,214 INFO L82 PathProgramCache]: Analyzing trace with hash -666412457, now seen corresponding path program 1 times [2018-09-20 15:31:50,214 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:31:50,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:31:50,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:50,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:50,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:31:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:31:50,334 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-20 15:31:50,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 03:31:50 BoogieIcfgContainer [2018-09-20 15:31:50,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 15:31:50,382 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 15:31:50,382 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 15:31:50,383 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 15:31:50,383 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:31:48" (3/4) ... [2018-09-20 15:31:50,387 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-09-20 15:31:50,387 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 15:31:50,388 INFO L168 Benchmark]: Toolchain (without parser) took 2941.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 950.5 MB in the beginning and 1.0 GB in the end (delta: -70.3 MB). Peak memory consumption was 62.8 MB. Max. memory is 11.5 GB. [2018-09-20 15:31:50,390 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:31:50,391 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.56 ms. Allocated memory is still 1.0 GB. Free memory was 950.5 MB in the beginning and 939.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-20 15:31:50,392 INFO L168 Benchmark]: Boogie Preprocessor took 79.43 ms. Allocated memory is still 1.0 GB. Free memory is still 939.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:31:50,392 INFO L168 Benchmark]: RCFGBuilder took 825.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -156.3 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:31:50,393 INFO L168 Benchmark]: TraceAbstraction took 1691.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.2 MB). Peak memory consumption was 75.2 MB. Max. memory is 11.5 GB. [2018-09-20 15:31:50,395 INFO L168 Benchmark]: Witness Printer took 5.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:31:50,399 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.19 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 333.56 ms. Allocated memory is still 1.0 GB. Free memory was 950.5 MB in the beginning and 939.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 79.43 ms. Allocated memory is still 1.0 GB. Free memory is still 939.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 825.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -156.3 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1691.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.2 MB). Peak memory consumption was 75.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 74]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 73. Possible FailurePath: [L64] float x = __VERIFIER_nondet_float(); [L65] float y = __VERIFIER_nondet_float(); [L67] CALL, EXPR isnan_float(x) VAL [\old(x)=4286578692] [L55] RET return x != x; VAL [\old(x)=4286578692, \result=1, x=4286578692] [L67] EXPR isnan_float(x) VAL [isnan_float(x)=1, x=4286578692, y=4286578691] [L67] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, x=4286578692, y=4286578691] [L67] COND TRUE, EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, x=4286578692, y=4286578691] [L67] CALL, EXPR isnan_float(y) VAL [\old(x)=4286578691] [L55] RET return x != x; VAL [\old(x)=4286578691, \result=0, x=4286578691] [L67] EXPR isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=4286578692, y=4286578691] [L67] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=4286578692, y=4286578691] [L67-L68] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) VAL [(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))=1, isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=4286578692, y=4286578691] [L67-L68] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) VAL [(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))=1, isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=4286578692, y=4286578691] [L67-L68] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L70] CALL, EXPR fmax_float(x, y) VAL [\old(x)=4286578692, \old(y)=4286578691] [L44] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=4286578692] [L21] __uint32_t w; VAL [\old(x)=4286578692, x=4286578692] [L24] FCALL ieee_float_shape_type gf_u; VAL [\old(x)=4286578692, gf_u={4286578695:0}, x=4286578692] [L25] FCALL gf_u.value = (x) VAL [\old(x)=4286578692, gf_u={4286578695:0}, x=4286578692] [L26] EXPR, FCALL gf_u.word VAL [\old(x)=4286578692, gf_u={4286578695:0}, gf_u.word=4286578689, x=4286578692] [L26] (w) = gf_u.word VAL [\old(x)=4286578692, gf_u={4286578695:0}, gf_u.word=4286578689, w=4286578689, x=4286578692] [L26] FCALL (w) = gf_u.word VAL [(w) = gf_u.word=4286578693, \old(x)=4286578692, gf_u={4286578695:0}, gf_u.word=4286578689, w=4286578689, x=4286578692] [L27] COND FALSE !(0) VAL [\old(x)=4286578692, w=4286578689, x=4286578692] [L29] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=4286578692, w=4286578689, x=4286578692] [L31-L32] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=4286578692, w=4286578689, x=4286578692] [L34-L35] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=4286578692, w=4286578689, x=4286578692] [L37] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L40] RET return 0; VAL [\old(x)=4286578692, \result=0, w=4286578689, x=4286578692] [L44] EXPR __fpclassify_float(x) VAL [\old(x)=4286578692, \old(y)=4286578691, __fpclassify_float(x)=0, x=4286578692, y=4286578691] [L44] COND TRUE __fpclassify_float(x) == 0 [L45] RET return y; VAL [\old(x)=4286578692, \old(y)=4286578691, \result=4286578691, x=4286578692, y=4286578691] [L70] EXPR fmax_float(x, y) VAL [fmax_float(x, y)=4286578691, x=4286578692, y=4286578691] [L70] float res = fmax_float(x, y); [L73] CALL, EXPR isnan_float(x) VAL [\old(x)=4286578692] [L55] RET return x != x; VAL [\old(x)=4286578692, \result=1, x=4286578692] [L73] EXPR isnan_float(x) VAL [isnan_float(x)=1, res=4286578691, x=4286578692, y=4286578691] [L73] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, res=4286578691, x=4286578692, y=4286578691] [L73] COND TRUE, EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, res=4286578691, x=4286578692, y=4286578691] [L73] CALL, EXPR isnan_float(y) VAL [\old(x)=4286578691] [L55] RET return x != x; VAL [\old(x)=4286578691, \result=0, x=4286578691] [L73] EXPR isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, res=4286578691, x=4286578692, y=4286578691] [L73] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, res=4286578691, x=4286578692, y=4286578691] [L73] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L74] __VERIFIER_error() VAL [res=4286578691, x=4286578692, y=4286578691] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 74 locations, 2 error locations. UNSAFE Result, 1.6s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 447 SDtfs, 16 SDslu, 579 SDs, 0 SdLazy, 40 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=5, 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, 5 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 295 NumberOfCodeBlocks, 295 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 232 ConstructedInterpolants, 0 QuantifiedInterpolants, 11918 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 33/33 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-40ef509 [2018-09-20 15:31:52,824 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:31:52,826 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:31:52,845 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:31:52,846 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:31:52,847 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:31:52,849 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:31:52,851 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:31:52,854 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:31:52,856 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:31:52,858 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:31:52,859 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:31:52,860 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:31:52,862 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:31:52,868 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:31:52,872 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:31:52,875 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:31:52,877 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:31:52,880 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:31:52,882 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:31:52,883 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:31:52,884 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:31:52,888 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:31:52,888 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:31:52,888 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:31:52,889 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:31:52,891 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:31:52,893 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:31:52,893 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:31:52,897 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:31:52,897 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:31:52,898 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:31:52,898 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:31:52,898 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:31:52,899 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:31:52,900 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:31:52,900 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-20 15:31:52,923 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:31:52,923 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:31:52,924 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:31:52,924 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:31:52,925 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:31:52,925 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:31:52,925 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:31:52,925 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:31:52,925 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:31:52,930 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:31:52,930 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:31:52,931 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:31:52,931 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:31:52,931 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:31:52,931 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-20 15:31:52,931 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-20 15:31:52,931 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:31:52,932 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:31:52,932 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:31:52,932 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:31:52,932 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:31:52,934 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:31:52,935 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:31:52,935 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:31:52,935 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:31:52,935 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:31:52,935 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:31:52,936 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-20 15:31:52,936 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:31:52,936 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-20 15:31:52,936 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-20 15:31:52,936 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 -> df3954142d6b55c98b13b60b9fbaf053d4d402ff [2018-09-20 15:31:52,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:31:53,012 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:31:53,018 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:31:53,024 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:31:53,024 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:31:53,025 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1251_true-unreach-call.c [2018-09-20 15:31:53,382 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9627f72b/f407d00deb4547ca97d573fb4026e5c2/FLAG18e929256 [2018-09-20 15:31:53,521 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:31:53,522 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1251_true-unreach-call.c [2018-09-20 15:31:53,529 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9627f72b/f407d00deb4547ca97d573fb4026e5c2/FLAG18e929256 [2018-09-20 15:31:53,545 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9627f72b/f407d00deb4547ca97d573fb4026e5c2 [2018-09-20 15:31:53,549 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:31:53,552 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:31:53,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:31:53,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:31:53,560 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:31:53,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:31:53" (1/1) ... [2018-09-20 15:31:53,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@682d7878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:53, skipping insertion in model container [2018-09-20 15:31:53,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:31:53" (1/1) ... [2018-09-20 15:31:53,577 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:31:53,805 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:31:53,823 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:31:53,849 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:31:53,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:53 WrapperNode [2018-09-20 15:31:53,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:31:53,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:31:53,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:31:53,892 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:31:53,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:53" (1/1) ... [2018-09-20 15:31:53,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:53" (1/1) ... [2018-09-20 15:31:53,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:53" (1/1) ... [2018-09-20 15:31:53,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:53" (1/1) ... [2018-09-20 15:31:53,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:53" (1/1) ... [2018-09-20 15:31:53,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:53" (1/1) ... [2018-09-20 15:31:53,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:53" (1/1) ... [2018-09-20 15:31:53,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:31:53,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:31:53,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:31:53,938 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:31:53,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:31:54,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:31:54,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:31:54,079 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2018-09-20 15:31:54,079 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_float [2018-09-20 15:31:54,080 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2018-09-20 15:31:54,080 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:31:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:31:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-09-20 15:31:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2018-09-20 15:31:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:31:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-09-20 15:31:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-20 15:31:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:31:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_float [2018-09-20 15:31:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2018-09-20 15:31:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:31:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:31:54,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:31:54,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4 [2018-09-20 15:31:54,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-20 15:31:54,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-20 15:31:54,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-09-20 15:31:54,567 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:31:54,580 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:31:54,674 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:31:54,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:31:54 BoogieIcfgContainer [2018-09-20 15:31:54,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:31:54,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:31:54,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:31:54,679 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:31:54,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:31:53" (1/3) ... [2018-09-20 15:31:54,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@367ac687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:31:54, skipping insertion in model container [2018-09-20 15:31:54,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:53" (2/3) ... [2018-09-20 15:31:54,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@367ac687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:31:54, skipping insertion in model container [2018-09-20 15:31:54,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:31:54" (3/3) ... [2018-09-20 15:31:54,683 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251_true-unreach-call.c [2018-09-20 15:31:54,694 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:31:54,704 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-09-20 15:31:54,757 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:31:54,757 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:31:54,758 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:31:54,758 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:31:54,758 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:31:54,758 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:31:54,758 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:31:54,758 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:31:54,759 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:31:54,782 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-09-20 15:31:54,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-20 15:31:54,794 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:54,795 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] [2018-09-20 15:31:54,798 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:54,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1620863984, now seen corresponding path program 1 times [2018-09-20 15:31:54,810 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:31:54,811 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) [2018-09-20 15:31:54,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-20 15:31:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:54,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:31:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:31:54,935 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:31:54,953 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:54,953 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:31:54,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:31:54,970 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:31:54,970 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:31:54,973 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 2 states. [2018-09-20 15:31:55,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:55,006 INFO L93 Difference]: Finished difference Result 121 states and 162 transitions. [2018-09-20 15:31:55,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:31:55,008 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 35 [2018-09-20 15:31:55,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:55,023 INFO L225 Difference]: With dead ends: 121 [2018-09-20 15:31:55,023 INFO L226 Difference]: Without dead ends: 67 [2018-09-20 15:31:55,028 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:31:55,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-20 15:31:55,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-20 15:31:55,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-20 15:31:55,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2018-09-20 15:31:55,080 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 35 [2018-09-20 15:31:55,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:55,082 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2018-09-20 15:31:55,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:31:55,083 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2018-09-20 15:31:55,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-20 15:31:55,086 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:55,087 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] [2018-09-20 15:31:55,087 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:55,088 INFO L82 PathProgramCache]: Analyzing trace with hash -120307456, now seen corresponding path program 1 times [2018-09-20 15:31:55,089 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:31:55,089 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-20 15:31:55,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:55,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:31:55,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:31:55,342 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:31:55,355 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:55,356 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:31:55,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:31:55,358 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:31:55,358 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:31:55,360 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand 4 states. [2018-09-20 15:31:55,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:55,627 INFO L93 Difference]: Finished difference Result 124 states and 159 transitions. [2018-09-20 15:31:55,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-20 15:31:55,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-09-20 15:31:55,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:55,636 INFO L225 Difference]: With dead ends: 124 [2018-09-20 15:31:55,636 INFO L226 Difference]: Without dead ends: 76 [2018-09-20 15:31:55,638 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-20 15:31:55,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-20 15:31:55,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2018-09-20 15:31:55,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-20 15:31:55,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2018-09-20 15:31:55,653 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 44 [2018-09-20 15:31:55,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:55,653 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2018-09-20 15:31:55,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:31:55,654 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2018-09-20 15:31:55,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-20 15:31:55,657 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:55,657 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:31:55,657 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:55,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1112572795, now seen corresponding path program 1 times [2018-09-20 15:31:55,658 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:31:55,658 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-20 15:31:55,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:55,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:31:55,819 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-20 15:31:55,819 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:31:55,832 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:55,832 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:31:55,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:31:55,833 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:31:55,833 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:31:55,834 INFO L87 Difference]: Start difference. First operand 69 states and 88 transitions. Second operand 4 states. [2018-09-20 15:31:55,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:55,870 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2018-09-20 15:31:55,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:31:55,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-09-20 15:31:55,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:55,875 INFO L225 Difference]: With dead ends: 94 [2018-09-20 15:31:55,876 INFO L226 Difference]: Without dead ends: 72 [2018-09-20 15:31:55,876 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:31:55,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-09-20 15:31:55,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-09-20 15:31:55,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-20 15:31:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2018-09-20 15:31:55,888 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 49 [2018-09-20 15:31:55,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:55,889 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2018-09-20 15:31:55,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:31:55,889 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2018-09-20 15:31:55,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-20 15:31:55,892 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:55,892 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:31:55,893 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:55,894 INFO L82 PathProgramCache]: Analyzing trace with hash 665725020, now seen corresponding path program 1 times [2018-09-20 15:31:55,894 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:31:55,894 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-20 15:31:55,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:55,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:31:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-20 15:31:56,050 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:31:56,064 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:56,064 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:31:56,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:31:56,065 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:31:56,065 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:31:56,065 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 4 states. [2018-09-20 15:31:56,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:56,109 INFO L93 Difference]: Finished difference Result 97 states and 123 transitions. [2018-09-20 15:31:56,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:31:56,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-09-20 15:31:56,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:56,112 INFO L225 Difference]: With dead ends: 97 [2018-09-20 15:31:56,112 INFO L226 Difference]: Without dead ends: 75 [2018-09-20 15:31:56,113 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:31:56,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-20 15:31:56,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-09-20 15:31:56,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-20 15:31:56,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2018-09-20 15:31:56,124 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 50 [2018-09-20 15:31:56,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:56,125 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2018-09-20 15:31:56,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:31:56,126 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2018-09-20 15:31:56,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-20 15:31:56,127 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:56,128 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:31:56,128 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:56,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1433585823, now seen corresponding path program 1 times [2018-09-20 15:31:56,129 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:31:56,130 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-20 15:31:56,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:56,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:31:56,342 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-20 15:31:56,343 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:31:56,357 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:56,357 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:31:56,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:31:56,358 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:31:56,358 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:31:56,359 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 4 states. [2018-09-20 15:31:56,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:56,417 INFO L93 Difference]: Finished difference Result 97 states and 123 transitions. [2018-09-20 15:31:56,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:31:56,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-09-20 15:31:56,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:56,421 INFO L225 Difference]: With dead ends: 97 [2018-09-20 15:31:56,421 INFO L226 Difference]: Without dead ends: 75 [2018-09-20 15:31:56,422 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:31:56,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-20 15:31:56,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-09-20 15:31:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-20 15:31:56,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2018-09-20 15:31:56,432 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 51 [2018-09-20 15:31:56,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:56,433 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2018-09-20 15:31:56,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:31:56,434 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2018-09-20 15:31:56,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-20 15:31:56,436 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:56,437 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:31:56,437 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:56,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1202706880, now seen corresponding path program 1 times [2018-09-20 15:31:56,438 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:31:56,438 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-20 15:31:56,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:56,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:31:56,517 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-20 15:31:56,518 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:31:56,533 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:56,534 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:31:56,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:31:56,536 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:31:56,536 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:31:56,538 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 4 states. [2018-09-20 15:31:56,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:56,622 INFO L93 Difference]: Finished difference Result 97 states and 123 transitions. [2018-09-20 15:31:56,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:31:56,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-09-20 15:31:56,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:56,629 INFO L225 Difference]: With dead ends: 97 [2018-09-20 15:31:56,630 INFO L226 Difference]: Without dead ends: 75 [2018-09-20 15:31:56,633 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:31:56,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-20 15:31:56,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-09-20 15:31:56,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-20 15:31:56,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2018-09-20 15:31:56,650 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 52 [2018-09-20 15:31:56,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:56,654 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2018-09-20 15:31:56,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:31:56,654 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2018-09-20 15:31:56,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-20 15:31:56,656 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:56,656 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:31:56,660 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:56,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1584708607, now seen corresponding path program 1 times [2018-09-20 15:31:56,663 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:31:56,663 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-20 15:31:56,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:56,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:31:56,983 WARN L178 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-20 15:31:57,373 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-20 15:31:57,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:31:57,844 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-20 15:31:57,859 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:31:57,859 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2018-09-20 15:31:57,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-20 15:31:57,860 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-20 15:31:57,860 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-09-20 15:31:57,860 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 13 states. [2018-09-20 15:31:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:58,766 INFO L93 Difference]: Finished difference Result 112 states and 142 transitions. [2018-09-20 15:31:58,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-20 15:31:58,768 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-09-20 15:31:58,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:58,770 INFO L225 Difference]: With dead ends: 112 [2018-09-20 15:31:58,770 INFO L226 Difference]: Without dead ends: 98 [2018-09-20 15:31:58,771 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-09-20 15:31:58,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-20 15:31:58,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2018-09-20 15:31:58,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-20 15:31:58,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 109 transitions. [2018-09-20 15:31:58,785 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 109 transitions. Word has length 52 [2018-09-20 15:31:58,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:58,785 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 109 transitions. [2018-09-20 15:31:58,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-20 15:31:58,786 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 109 transitions. [2018-09-20 15:31:58,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-20 15:31:58,788 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:58,789 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:31:58,789 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:58,790 INFO L82 PathProgramCache]: Analyzing trace with hash 469427552, now seen corresponding path program 1 times [2018-09-20 15:31:58,791 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:31:58,791 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-09-20 15:31:58,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:58,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:31:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-20 15:31:59,004 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:31:59,018 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:59,019 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-20 15:31:59,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-20 15:31:59,023 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-20 15:31:59,024 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-20 15:31:59,024 INFO L87 Difference]: Start difference. First operand 84 states and 109 transitions. Second operand 8 states. [2018-09-20 15:31:59,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:59,568 INFO L93 Difference]: Finished difference Result 149 states and 190 transitions. [2018-09-20 15:31:59,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-20 15:31:59,569 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-09-20 15:31:59,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:59,570 INFO L225 Difference]: With dead ends: 149 [2018-09-20 15:31:59,570 INFO L226 Difference]: Without dead ends: 97 [2018-09-20 15:31:59,572 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-09-20 15:31:59,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-20 15:31:59,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 84. [2018-09-20 15:31:59,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-20 15:31:59,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 108 transitions. [2018-09-20 15:31:59,585 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 108 transitions. Word has length 54 [2018-09-20 15:31:59,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:59,585 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 108 transitions. [2018-09-20 15:31:59,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-20 15:31:59,586 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 108 transitions. [2018-09-20 15:31:59,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-20 15:31:59,587 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:59,587 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:31:59,589 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:59,589 INFO L82 PathProgramCache]: Analyzing trace with hash -601784237, now seen corresponding path program 1 times [2018-09-20 15:31:59,590 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:31:59,590 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-09-20 15:31:59,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:59,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:31:59,684 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:31:59,684 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:31:59,695 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:59,695 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-20 15:31:59,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-20 15:31:59,696 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-20 15:31:59,696 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-20 15:31:59,697 INFO L87 Difference]: Start difference. First operand 84 states and 108 transitions. Second operand 3 states. [2018-09-20 15:31:59,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:59,723 INFO L93 Difference]: Finished difference Result 87 states and 111 transitions. [2018-09-20 15:31:59,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-20 15:31:59,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-09-20 15:31:59,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:59,725 INFO L225 Difference]: With dead ends: 87 [2018-09-20 15:31:59,725 INFO L226 Difference]: Without dead ends: 85 [2018-09-20 15:31:59,726 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 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 15:31:59,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-20 15:31:59,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-20 15:31:59,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-20 15:31:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 109 transitions. [2018-09-20 15:31:59,737 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 109 transitions. Word has length 59 [2018-09-20 15:31:59,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:59,738 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 109 transitions. [2018-09-20 15:31:59,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-20 15:31:59,738 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2018-09-20 15:31:59,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-20 15:31:59,740 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:59,740 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:31:59,740 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:59,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1339775315, now seen corresponding path program 1 times [2018-09-20 15:31:59,741 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:31:59,741 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-09-20 15:31:59,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:59,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-20 15:32:00,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:32:00,599 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-20 15:32:00,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-20 15:32:00,965 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:32:00,966 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-09-20 15:32:00,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-20 15:32:00,966 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-20 15:32:00,967 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-09-20 15:32:00,967 INFO L87 Difference]: Start difference. First operand 85 states and 109 transitions. Second operand 19 states. [2018-09-20 15:32:01,442 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-09-20 15:32:01,667 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 8 [2018-09-20 15:32:02,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:02,604 INFO L93 Difference]: Finished difference Result 124 states and 159 transitions. [2018-09-20 15:32:02,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-20 15:32:02,606 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2018-09-20 15:32:02,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:02,607 INFO L225 Difference]: With dead ends: 124 [2018-09-20 15:32:02,607 INFO L226 Difference]: Without dead ends: 122 [2018-09-20 15:32:02,608 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2018-09-20 15:32:02,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-20 15:32:02,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 95. [2018-09-20 15:32:02,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-20 15:32:02,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 124 transitions. [2018-09-20 15:32:02,623 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 124 transitions. Word has length 57 [2018-09-20 15:32:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:02,624 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 124 transitions. [2018-09-20 15:32:02,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-20 15:32:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 124 transitions. [2018-09-20 15:32:02,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-20 15:32:02,627 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:02,627 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:02,628 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:02,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1845408357, now seen corresponding path program 1 times [2018-09-20 15:32:02,629 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:02,629 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 15:32:02,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:02,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:02,811 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-20 15:32:02,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:32:03,122 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:32:03,132 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:32:03,132 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-09-20 15:32:03,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-20 15:32:03,133 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-20 15:32:03,133 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-09-20 15:32:03,133 INFO L87 Difference]: Start difference. First operand 95 states and 124 transitions. Second operand 12 states. [2018-09-20 15:32:03,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:03,716 INFO L93 Difference]: Finished difference Result 121 states and 154 transitions. [2018-09-20 15:32:03,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-20 15:32:03,718 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2018-09-20 15:32:03,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:03,719 INFO L225 Difference]: With dead ends: 121 [2018-09-20 15:32:03,720 INFO L226 Difference]: Without dead ends: 105 [2018-09-20 15:32:03,721 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-09-20 15:32:03,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-20 15:32:03,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 95. [2018-09-20 15:32:03,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-20 15:32:03,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2018-09-20 15:32:03,732 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 64 [2018-09-20 15:32:03,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:03,732 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2018-09-20 15:32:03,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-20 15:32:03,732 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2018-09-20 15:32:03,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-20 15:32:03,733 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:03,734 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:03,734 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:03,734 INFO L82 PathProgramCache]: Analyzing trace with hash -860151597, now seen corresponding path program 1 times [2018-09-20 15:32:03,737 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:03,737 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:03,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:03,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:03,961 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-20 15:32:03,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:32:04,397 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:32:04,409 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:32:04,410 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2018-09-20 15:32:04,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-20 15:32:04,410 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-20 15:32:04,411 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-09-20 15:32:04,411 INFO L87 Difference]: Start difference. First operand 95 states and 123 transitions. Second operand 14 states. [2018-09-20 15:32:05,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:05,243 INFO L93 Difference]: Finished difference Result 158 states and 198 transitions. [2018-09-20 15:32:05,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-20 15:32:05,244 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2018-09-20 15:32:05,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:05,247 INFO L225 Difference]: With dead ends: 158 [2018-09-20 15:32:05,247 INFO L226 Difference]: Without dead ends: 97 [2018-09-20 15:32:05,248 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-09-20 15:32:05,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-20 15:32:05,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2018-09-20 15:32:05,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-20 15:32:05,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 109 transitions. [2018-09-20 15:32:05,259 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 109 transitions. Word has length 64 [2018-09-20 15:32:05,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:05,259 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 109 transitions. [2018-09-20 15:32:05,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-20 15:32:05,260 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 109 transitions. [2018-09-20 15:32:05,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-20 15:32:05,261 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:05,261 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:05,261 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:05,263 INFO L82 PathProgramCache]: Analyzing trace with hash -942132985, now seen corresponding path program 1 times [2018-09-20 15:32:05,264 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:05,264 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:05,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:05,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:05,546 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:32:05,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:32:05,803 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:32:05,815 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:32:05,816 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-09-20 15:32:05,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-20 15:32:05,816 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-20 15:32:05,816 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-09-20 15:32:05,817 INFO L87 Difference]: Start difference. First operand 87 states and 109 transitions. Second operand 12 states. [2018-09-20 15:32:06,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:06,360 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2018-09-20 15:32:06,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-20 15:32:06,362 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-09-20 15:32:06,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:06,363 INFO L225 Difference]: With dead ends: 100 [2018-09-20 15:32:06,364 INFO L226 Difference]: Without dead ends: 97 [2018-09-20 15:32:06,364 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-09-20 15:32:06,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-20 15:32:06,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2018-09-20 15:32:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-20 15:32:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 114 transitions. [2018-09-20 15:32:06,374 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 114 transitions. Word has length 66 [2018-09-20 15:32:06,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:06,374 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 114 transitions. [2018-09-20 15:32:06,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-20 15:32:06,376 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 114 transitions. [2018-09-20 15:32:06,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-20 15:32:06,377 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:06,377 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:06,377 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:06,378 INFO L82 PathProgramCache]: Analyzing trace with hash 2047519735, now seen corresponding path program 1 times [2018-09-20 15:32:06,379 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:06,379 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:06,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:06,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:06,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:32:06,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:06,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:06,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:06,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:06,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:06,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:32:06,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:06,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:06,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:06,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:06,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:07,080 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 30 [2018-09-20 15:32:07,353 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-20 15:32:07,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:32:07,864 WARN L178 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2018-09-20 15:32:07,970 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-20 15:32:08,225 WARN L178 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-20 15:32:08,387 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-20 15:32:08,489 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-09-20 15:32:09,017 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2018-09-20 15:32:09,402 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 15:32:09,402 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 15:32:09,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:09,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:09,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:32:09,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:09,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:09,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:09,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:09,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:09,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:32:09,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:09,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:09,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:09,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:09,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:09,895 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 29 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-20 15:32:09,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:32:10,176 WARN L178 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2018-09-20 15:32:10,487 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-09-20 15:32:10,613 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-20 15:32:10,729 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-20 15:32:11,008 WARN L178 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-20 15:32:11,366 WARN L178 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2018-09-20 15:32:11,728 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:32:11,728 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 19 [2018-09-20 15:32:11,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-20 15:32:11,729 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-20 15:32:11,729 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-09-20 15:32:11,729 INFO L87 Difference]: Start difference. First operand 91 states and 114 transitions. Second operand 19 states. [2018-09-20 15:32:15,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:15,440 INFO L93 Difference]: Finished difference Result 139 states and 179 transitions. [2018-09-20 15:32:15,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-20 15:32:15,442 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 71 [2018-09-20 15:32:15,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:15,444 INFO L225 Difference]: With dead ends: 139 [2018-09-20 15:32:15,444 INFO L226 Difference]: Without dead ends: 108 [2018-09-20 15:32:15,445 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 170 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2018-09-20 15:32:15,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-09-20 15:32:15,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2018-09-20 15:32:15,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-20 15:32:15,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 122 transitions. [2018-09-20 15:32:15,456 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 122 transitions. Word has length 71 [2018-09-20 15:32:15,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:15,457 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 122 transitions. [2018-09-20 15:32:15,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-20 15:32:15,457 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 122 transitions. [2018-09-20 15:32:15,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-20 15:32:15,459 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:15,460 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:15,460 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:15,460 INFO L82 PathProgramCache]: Analyzing trace with hash -330821267, now seen corresponding path program 1 times [2018-09-20 15:32:15,462 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:15,462 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:15,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:15,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:15,646 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:32:15,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:32:16,002 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:32:16,011 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:32:16,011 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2018-09-20 15:32:16,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-20 15:32:16,012 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-20 15:32:16,012 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-09-20 15:32:16,013 INFO L87 Difference]: Start difference. First operand 97 states and 122 transitions. Second operand 13 states. [2018-09-20 15:32:16,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:16,553 INFO L93 Difference]: Finished difference Result 107 states and 131 transitions. [2018-09-20 15:32:16,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-20 15:32:16,555 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2018-09-20 15:32:16,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:16,556 INFO L225 Difference]: With dead ends: 107 [2018-09-20 15:32:16,557 INFO L226 Difference]: Without dead ends: 86 [2018-09-20 15:32:16,558 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-09-20 15:32:16,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-20 15:32:16,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-09-20 15:32:16,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-20 15:32:16,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2018-09-20 15:32:16,566 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 64 [2018-09-20 15:32:16,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:16,567 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2018-09-20 15:32:16,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-20 15:32:16,567 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2018-09-20 15:32:16,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-20 15:32:16,568 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:16,568 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:16,571 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:16,571 INFO L82 PathProgramCache]: Analyzing trace with hash 2091391259, now seen corresponding path program 1 times [2018-09-20 15:32:16,572 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:16,572 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:16,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:16,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:16,663 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:32:16,663 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:16,673 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:16,673 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:32:16,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:32:16,674 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:32:16,674 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:32:16,674 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand 4 states. [2018-09-20 15:32:16,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:16,701 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2018-09-20 15:32:16,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:32:16,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2018-09-20 15:32:16,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:16,703 INFO L225 Difference]: With dead ends: 118 [2018-09-20 15:32:16,703 INFO L226 Difference]: Without dead ends: 89 [2018-09-20 15:32:16,704 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:32:16,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-20 15:32:16,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-09-20 15:32:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-20 15:32:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2018-09-20 15:32:16,712 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 70 [2018-09-20 15:32:16,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:16,713 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2018-09-20 15:32:16,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:32:16,714 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2018-09-20 15:32:16,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-20 15:32:16,716 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:16,716 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:16,716 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:16,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1302802768, now seen corresponding path program 1 times [2018-09-20 15:32:16,717 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:16,717 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:16,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:16,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:32:16,812 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:16,822 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:16,822 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:32:16,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:32:16,823 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:32:16,823 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:32:16,823 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand 4 states. [2018-09-20 15:32:16,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:16,854 INFO L93 Difference]: Finished difference Result 122 states and 150 transitions. [2018-09-20 15:32:16,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:32:16,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2018-09-20 15:32:16,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:16,857 INFO L225 Difference]: With dead ends: 122 [2018-09-20 15:32:16,857 INFO L226 Difference]: Without dead ends: 93 [2018-09-20 15:32:16,858 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:32:16,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-20 15:32:16,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2018-09-20 15:32:16,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-20 15:32:16,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2018-09-20 15:32:16,866 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 71 [2018-09-20 15:32:16,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:16,866 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2018-09-20 15:32:16,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:32:16,866 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2018-09-20 15:32:16,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-20 15:32:16,870 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:16,870 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:16,870 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:16,870 INFO L82 PathProgramCache]: Analyzing trace with hash 481222112, now seen corresponding path program 1 times [2018-09-20 15:32:16,871 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:16,871 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:16,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:16,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:17,279 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:32:17,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:32:17,547 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 15:32:17,547 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 15:32:17,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:17,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:17,603 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:32:17,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:32:17,918 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:32:17,918 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-09-20 15:32:17,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-20 15:32:17,918 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-20 15:32:17,919 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-20 15:32:17,919 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand 8 states. [2018-09-20 15:32:18,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:18,711 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2018-09-20 15:32:18,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-20 15:32:18,712 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-09-20 15:32:18,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:18,713 INFO L225 Difference]: With dead ends: 104 [2018-09-20 15:32:18,714 INFO L226 Difference]: Without dead ends: 92 [2018-09-20 15:32:18,714 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-09-20 15:32:18,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-09-20 15:32:18,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-09-20 15:32:18,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-20 15:32:18,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 113 transitions. [2018-09-20 15:32:18,723 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 113 transitions. Word has length 72 [2018-09-20 15:32:18,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:18,723 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 113 transitions. [2018-09-20 15:32:18,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-20 15:32:18,723 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 113 transitions. [2018-09-20 15:32:18,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-20 15:32:18,724 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:18,724 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:18,725 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:18,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1512922594, now seen corresponding path program 1 times [2018-09-20 15:32:18,725 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:18,725 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:18,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:18,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:18,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:32:18,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:18,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:18,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:18,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:18,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:18,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:32:18,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:18,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:18,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:18,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:18,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:19,306 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-20 15:32:19,307 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:19,316 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:19,316 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-20 15:32:19,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-20 15:32:19,317 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-20 15:32:19,317 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-09-20 15:32:19,317 INFO L87 Difference]: Start difference. First operand 92 states and 113 transitions. Second operand 13 states. [2018-09-20 15:32:20,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:20,567 INFO L93 Difference]: Finished difference Result 129 states and 157 transitions. [2018-09-20 15:32:20,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-20 15:32:20,569 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-09-20 15:32:20,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:20,571 INFO L225 Difference]: With dead ends: 129 [2018-09-20 15:32:20,571 INFO L226 Difference]: Without dead ends: 115 [2018-09-20 15:32:20,572 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-09-20 15:32:20,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-20 15:32:20,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2018-09-20 15:32:20,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-20 15:32:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 119 transitions. [2018-09-20 15:32:20,583 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 119 transitions. Word has length 72 [2018-09-20 15:32:20,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:20,584 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 119 transitions. [2018-09-20 15:32:20,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-20 15:32:20,584 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2018-09-20 15:32:20,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-20 15:32:20,585 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:20,585 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:20,585 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:20,585 INFO L82 PathProgramCache]: Analyzing trace with hash -783932105, now seen corresponding path program 1 times [2018-09-20 15:32:20,586 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:20,586 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 15:32:20,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:20,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:20,679 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:32:20,680 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:20,692 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:20,692 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:32:20,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:32:20,693 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:32:20,693 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:32:20,693 INFO L87 Difference]: Start difference. First operand 96 states and 119 transitions. Second operand 4 states. [2018-09-20 15:32:20,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:20,734 INFO L93 Difference]: Finished difference Result 129 states and 159 transitions. [2018-09-20 15:32:20,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:32:20,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-09-20 15:32:20,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:20,737 INFO L225 Difference]: With dead ends: 129 [2018-09-20 15:32:20,737 INFO L226 Difference]: Without dead ends: 100 [2018-09-20 15:32:20,739 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:32:20,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-20 15:32:20,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2018-09-20 15:32:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-20 15:32:20,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 119 transitions. [2018-09-20 15:32:20,749 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 119 transitions. Word has length 72 [2018-09-20 15:32:20,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:20,749 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 119 transitions. [2018-09-20 15:32:20,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:32:20,750 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2018-09-20 15:32:20,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-20 15:32:20,753 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:20,754 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:20,754 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:20,754 INFO L82 PathProgramCache]: Analyzing trace with hash 841762419, now seen corresponding path program 1 times [2018-09-20 15:32:20,755 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:20,755 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:20,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:20,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:21,079 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-20 15:32:21,242 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-20 15:32:21,455 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-09-20 15:32:21,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:32:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-09-20 15:32:22,013 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:32:22,013 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-09-20 15:32:22,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-20 15:32:22,013 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-20 15:32:22,014 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2018-09-20 15:32:22,014 INFO L87 Difference]: Start difference. First operand 96 states and 119 transitions. Second operand 21 states. [2018-09-20 15:32:23,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:23,208 INFO L93 Difference]: Finished difference Result 113 states and 138 transitions. [2018-09-20 15:32:23,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-20 15:32:23,209 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 73 [2018-09-20 15:32:23,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:23,210 INFO L225 Difference]: With dead ends: 113 [2018-09-20 15:32:23,211 INFO L226 Difference]: Without dead ends: 99 [2018-09-20 15:32:23,212 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2018-09-20 15:32:23,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-20 15:32:23,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-09-20 15:32:23,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-20 15:32:23,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2018-09-20 15:32:23,220 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 73 [2018-09-20 15:32:23,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:23,220 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2018-09-20 15:32:23,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-20 15:32:23,221 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2018-09-20 15:32:23,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-20 15:32:23,221 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:23,221 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:23,222 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:23,222 INFO L82 PathProgramCache]: Analyzing trace with hash 780859660, now seen corresponding path program 1 times [2018-09-20 15:32:23,222 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:23,222 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 15:32:23,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:23,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:23,304 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:32:23,304 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:23,314 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:23,314 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:32:23,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:32:23,315 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:32:23,315 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:32:23,315 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand 4 states. [2018-09-20 15:32:23,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:23,336 INFO L93 Difference]: Finished difference Result 119 states and 142 transitions. [2018-09-20 15:32:23,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:32:23,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-09-20 15:32:23,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:23,340 INFO L225 Difference]: With dead ends: 119 [2018-09-20 15:32:23,341 INFO L226 Difference]: Without dead ends: 89 [2018-09-20 15:32:23,341 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:32:23,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-20 15:32:23,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-09-20 15:32:23,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-20 15:32:23,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2018-09-20 15:32:23,348 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 73 [2018-09-20 15:32:23,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:23,348 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2018-09-20 15:32:23,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:32:23,349 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2018-09-20 15:32:23,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-20 15:32:23,349 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:23,350 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:23,350 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:23,350 INFO L82 PathProgramCache]: Analyzing trace with hash 372035435, now seen corresponding path program 1 times [2018-09-20 15:32:23,350 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:23,350 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 15:32:23,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:23,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:23,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:32:23,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:23,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:23,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:23,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:23,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:23,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:32:23,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:23,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:23,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:23,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:23,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:24,043 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 30 [2018-09-20 15:32:24,325 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-20 15:32:24,325 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:24,340 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:24,340 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-20 15:32:24,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-20 15:32:24,341 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-20 15:32:24,341 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-09-20 15:32:24,341 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand 17 states. [2018-09-20 15:32:26,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:26,846 INFO L93 Difference]: Finished difference Result 115 states and 137 transitions. [2018-09-20 15:32:26,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-20 15:32:26,848 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2018-09-20 15:32:26,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:26,849 INFO L225 Difference]: With dead ends: 115 [2018-09-20 15:32:26,850 INFO L226 Difference]: Without dead ends: 76 [2018-09-20 15:32:26,852 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2018-09-20 15:32:26,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-20 15:32:26,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2018-09-20 15:32:26,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-20 15:32:26,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2018-09-20 15:32:26,860 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 73 [2018-09-20 15:32:26,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:26,861 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2018-09-20 15:32:26,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-20 15:32:26,861 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2018-09-20 15:32:26,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-20 15:32:26,861 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:26,862 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:26,862 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:26,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1543187328, now seen corresponding path program 1 times [2018-09-20 15:32:26,862 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:26,865 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:26,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:26,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:27,244 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-09-20 15:32:27,244 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:27,257 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:27,257 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-20 15:32:27,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-20 15:32:27,258 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-20 15:32:27,258 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-20 15:32:27,258 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 9 states. [2018-09-20 15:32:27,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:27,901 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2018-09-20 15:32:27,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-20 15:32:27,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2018-09-20 15:32:27,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:27,904 INFO L225 Difference]: With dead ends: 84 [2018-09-20 15:32:27,904 INFO L226 Difference]: Without dead ends: 65 [2018-09-20 15:32:27,905 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-09-20 15:32:27,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-20 15:32:27,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-09-20 15:32:27,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-20 15:32:27,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2018-09-20 15:32:27,911 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 86 [2018-09-20 15:32:27,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:27,911 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-09-20 15:32:27,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-20 15:32:27,912 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2018-09-20 15:32:27,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-20 15:32:27,912 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:27,915 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:27,915 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:27,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1402638718, now seen corresponding path program 1 times [2018-09-20 15:32:27,916 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:27,916 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:27,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:27,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:28,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:32:28,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:28,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:28,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:28,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:28,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:28,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:32:28,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:28,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:28,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:28,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:28,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-20 15:32:28,378 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:28,388 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:28,388 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-20 15:32:28,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-20 15:32:28,389 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-20 15:32:28,389 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-20 15:32:28,389 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 14 states. [2018-09-20 15:32:29,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:29,815 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2018-09-20 15:32:29,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-20 15:32:29,817 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 86 [2018-09-20 15:32:29,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:29,818 INFO L225 Difference]: With dead ends: 87 [2018-09-20 15:32:29,818 INFO L226 Difference]: Without dead ends: 66 [2018-09-20 15:32:29,819 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-09-20 15:32:29,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-20 15:32:29,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-09-20 15:32:29,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-20 15:32:29,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2018-09-20 15:32:29,826 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 86 [2018-09-20 15:32:29,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:29,826 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2018-09-20 15:32:29,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-20 15:32:29,826 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2018-09-20 15:32:29,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-20 15:32:29,827 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:29,827 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:29,827 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:29,827 INFO L82 PathProgramCache]: Analyzing trace with hash 315751793, now seen corresponding path program 1 times [2018-09-20 15:32:29,829 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:29,829 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:29,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:29,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:30,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:32:30,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:30,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:30,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:30,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:30,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:30,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:32:30,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:30,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:30,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:30,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:30,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-20 15:32:30,831 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:30,841 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:30,841 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-20 15:32:30,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-20 15:32:30,841 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-20 15:32:30,842 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-20 15:32:30,842 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 14 states. [2018-09-20 15:32:32,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:32,503 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2018-09-20 15:32:32,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-20 15:32:32,505 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 87 [2018-09-20 15:32:32,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:32,506 INFO L225 Difference]: With dead ends: 89 [2018-09-20 15:32:32,506 INFO L226 Difference]: Without dead ends: 68 [2018-09-20 15:32:32,507 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-09-20 15:32:32,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-09-20 15:32:32,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-09-20 15:32:32,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-20 15:32:32,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2018-09-20 15:32:32,512 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 87 [2018-09-20 15:32:32,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:32,513 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2018-09-20 15:32:32,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-20 15:32:32,513 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2018-09-20 15:32:32,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-20 15:32:32,513 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:32,514 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:32,514 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:32,514 INFO L82 PathProgramCache]: Analyzing trace with hash -255070855, now seen corresponding path program 1 times [2018-09-20 15:32:32,518 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:32,519 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 15:32:32,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:32,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:32,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:32:32,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:32,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:32,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:32,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:32,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:32,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:32:32,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:32,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:32,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:32,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:32,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:32,907 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-20 15:32:32,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:32:34,367 WARN L178 SmtUtils]: Spent 835.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-20 15:32:34,938 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-20 15:32:34,947 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:32:34,948 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-09-20 15:32:34,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-20 15:32:34,948 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-20 15:32:34,949 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-09-20 15:32:34,949 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 21 states. [2018-09-20 15:32:36,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:36,336 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2018-09-20 15:32:36,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-20 15:32:36,337 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2018-09-20 15:32:36,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:36,339 INFO L225 Difference]: With dead ends: 91 [2018-09-20 15:32:36,339 INFO L226 Difference]: Without dead ends: 76 [2018-09-20 15:32:36,339 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 153 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2018-09-20 15:32:36,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-20 15:32:36,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2018-09-20 15:32:36,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-20 15:32:36,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2018-09-20 15:32:36,344 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 87 [2018-09-20 15:32:36,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:36,344 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2018-09-20 15:32:36,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-20 15:32:36,345 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2018-09-20 15:32:36,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-20 15:32:36,346 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:36,346 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:36,347 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:36,347 INFO L82 PathProgramCache]: Analyzing trace with hash 523689574, now seen corresponding path program 1 times [2018-09-20 15:32:36,347 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:36,349 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 31 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:36,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:36,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:36,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:32:36,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:36,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:36,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:36,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:36,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:36,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:32:36,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:36,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:36,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:36,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:36,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:37,011 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-20 15:32:37,011 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:37,021 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:37,022 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-20 15:32:37,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-20 15:32:37,022 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-20 15:32:37,023 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-20 15:32:37,023 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand 14 states. [2018-09-20 15:32:38,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:38,960 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2018-09-20 15:32:38,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-20 15:32:38,962 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2018-09-20 15:32:38,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:38,963 INFO L225 Difference]: With dead ends: 93 [2018-09-20 15:32:38,963 INFO L226 Difference]: Without dead ends: 72 [2018-09-20 15:32:38,963 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-09-20 15:32:38,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-09-20 15:32:38,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-09-20 15:32:38,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-20 15:32:38,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2018-09-20 15:32:38,969 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 88 [2018-09-20 15:32:38,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:38,970 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2018-09-20 15:32:38,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-20 15:32:38,970 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2018-09-20 15:32:38,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-20 15:32:38,970 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:38,971 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:38,971 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:38,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1830337556, now seen corresponding path program 1 times [2018-09-20 15:32:38,971 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:38,971 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 15:32:38,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:39,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:39,398 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-09-20 15:32:39,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:32:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-09-20 15:32:39,917 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:32:39,917 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-09-20 15:32:39,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-20 15:32:39,918 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-20 15:32:39,918 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-09-20 15:32:39,918 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand 17 states. [2018-09-20 15:32:40,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:40,538 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2018-09-20 15:32:40,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-20 15:32:40,540 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2018-09-20 15:32:40,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:40,541 INFO L225 Difference]: With dead ends: 86 [2018-09-20 15:32:40,541 INFO L226 Difference]: Without dead ends: 71 [2018-09-20 15:32:40,542 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-09-20 15:32:40,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-20 15:32:40,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2018-09-20 15:32:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-20 15:32:40,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2018-09-20 15:32:40,549 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 88 [2018-09-20 15:32:40,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:40,549 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2018-09-20 15:32:40,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-20 15:32:40,549 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2018-09-20 15:32:40,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-20 15:32:40,553 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:40,553 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:40,553 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:40,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1152232981, now seen corresponding path program 1 times [2018-09-20 15:32:40,555 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:40,555 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 33 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:40,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:40,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:40,858 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-20 15:32:41,107 WARN L178 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-20 15:32:41,398 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-09-20 15:32:41,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:32:41,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:41,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:41,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:41,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:41,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:41,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:32:41,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:41,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:41,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:41,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:41,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:41,796 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-20 15:32:41,796 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:41,805 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:41,805 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-20 15:32:41,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-20 15:32:41,806 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-20 15:32:41,806 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-20 15:32:41,806 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand 14 states. [2018-09-20 15:32:42,479 WARN L178 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-20 15:32:43,190 WARN L178 SmtUtils]: Spent 427.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-20 15:32:44,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:44,408 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2018-09-20 15:32:44,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-20 15:32:44,409 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2018-09-20 15:32:44,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:44,410 INFO L225 Difference]: With dead ends: 86 [2018-09-20 15:32:44,410 INFO L226 Difference]: Without dead ends: 65 [2018-09-20 15:32:44,415 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-09-20 15:32:44,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-20 15:32:44,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-09-20 15:32:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-20 15:32:44,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-09-20 15:32:44,421 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 89 [2018-09-20 15:32:44,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:44,422 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-09-20 15:32:44,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-20 15:32:44,422 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-09-20 15:32:44,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-20 15:32:44,425 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:44,425 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:44,426 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:44,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1845334678, now seen corresponding path program 1 times [2018-09-20 15:32:44,427 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:44,427 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 34 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 15:32:44,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 34 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:44,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:44,616 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-09-20 15:32:44,616 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:44,626 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:44,626 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:32:44,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:32:44,626 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:32:44,627 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:32:44,627 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 4 states. [2018-09-20 15:32:44,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:44,638 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-09-20 15:32:44,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:32:44,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-09-20 15:32:44,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:44,640 INFO L225 Difference]: With dead ends: 66 [2018-09-20 15:32:44,640 INFO L226 Difference]: Without dead ends: 0 [2018-09-20 15:32:44,641 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:32:44,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-20 15:32:44,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-20 15:32:44,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-20 15:32:44,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-20 15:32:44,642 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2018-09-20 15:32:44,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:44,642 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-20 15:32:44,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:32:44,642 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-20 15:32:44,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-20 15:32:44,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-20 15:32:44,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-20 15:32:45,040 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-20 15:32:45,475 INFO L426 ceAbstractionStarter]: For program point isnan_floatFINAL(line 55) no Hoare annotation was computed. [2018-09-20 15:32:45,475 INFO L429 ceAbstractionStarter]: At program point isnan_floatENTRY(line 55) the Hoare annotation is: true [2018-09-20 15:32:45,475 INFO L426 ceAbstractionStarter]: For program point isnan_floatEXIT(line 55) no Hoare annotation was computed. [2018-09-20 15:32:45,475 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-20 15:32:45,475 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-09-20 15:32:45,476 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-20 15:32:45,476 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-20 15:32:45,476 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-20 15:32:45,476 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-20 15:32:45,476 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-20 15:32:45,476 INFO L422 ceAbstractionStarter]: At program point L68-3(line 68) the Hoare annotation is: (and (not |main_#t~short9|) (not |main_#t~short13|) (fp.eq main_~x~0 main_~x~0) (= (_ bv0 32) |main_#t~ret7|) (= |main_#t~ret10| (_ bv0 32)) |main_#t~short12|) [2018-09-20 15:32:45,476 INFO L426 ceAbstractionStarter]: For program point L68-4(line 68) no Hoare annotation was computed. [2018-09-20 15:32:45,476 INFO L426 ceAbstractionStarter]: For program point L68-6(line 68) no Hoare annotation was computed. [2018-09-20 15:32:45,476 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 57 86) no Hoare annotation was computed. [2018-09-20 15:32:45,477 INFO L422 ceAbstractionStarter]: At program point L73(line 73) the Hoare annotation is: (let ((.cse1 (fp.eq main_~y~0 main_~y~0)) (.cse0 (fp.eq main_~x~0 main_~x~0))) (or (and (= main_~x~0 main_~res~0) .cse0 (not .cse1)) (and (= main_~y~0 main_~res~0) .cse1 (not .cse0)))) [2018-09-20 15:32:45,477 INFO L426 ceAbstractionStarter]: For program point L73-1(line 73) no Hoare annotation was computed. [2018-09-20 15:32:45,477 INFO L426 ceAbstractionStarter]: For program point L73-2(line 73) no Hoare annotation was computed. [2018-09-20 15:32:45,477 INFO L422 ceAbstractionStarter]: At program point L73-3(line 73) the Hoare annotation is: (and (= main_~y~0 main_~res~0) |main_#t~short17| (fp.eq main_~y~0 main_~y~0) (not (fp.eq main_~x~0 main_~x~0))) [2018-09-20 15:32:45,477 INFO L426 ceAbstractionStarter]: For program point L73-4(line 73) no Hoare annotation was computed. [2018-09-20 15:32:45,477 INFO L426 ceAbstractionStarter]: For program point L73-6(lines 73 76) no Hoare annotation was computed. [2018-09-20 15:32:45,477 INFO L426 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2018-09-20 15:32:45,477 INFO L422 ceAbstractionStarter]: At program point L70(line 70) the Hoare annotation is: (let ((.cse1 (fp.eq main_~y~0 main_~y~0)) (.cse0 (fp.eq main_~x~0 main_~x~0))) (or (and .cse0 (not .cse1)) (and .cse1 (not .cse0)))) [2018-09-20 15:32:45,477 INFO L426 ceAbstractionStarter]: For program point L70-1(line 70) no Hoare annotation was computed. [2018-09-20 15:32:45,477 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 74) no Hoare annotation was computed. [2018-09-20 15:32:45,478 INFO L426 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-09-20 15:32:45,478 INFO L422 ceAbstractionStarter]: At program point L79(line 79) the Hoare annotation is: (or (and (= main_~x~0 main_~res~0) (not (fp.eq main_~y~0 main_~y~0))) (not (fp.eq main_~x~0 main_~x~0))) [2018-09-20 15:32:45,478 INFO L426 ceAbstractionStarter]: For program point L79-1(line 79) no Hoare annotation was computed. [2018-09-20 15:32:45,478 INFO L426 ceAbstractionStarter]: For program point L79-2(line 79) no Hoare annotation was computed. [2018-09-20 15:32:45,478 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 57 86) no Hoare annotation was computed. [2018-09-20 15:32:45,478 INFO L422 ceAbstractionStarter]: At program point L79-3(line 79) the Hoare annotation is: (and (= main_~x~0 main_~res~0) (fp.eq main_~x~0 main_~x~0) |main_#t~short20| (not (fp.eq main_~y~0 main_~y~0))) [2018-09-20 15:32:45,478 INFO L426 ceAbstractionStarter]: For program point L79-4(line 79) no Hoare annotation was computed. [2018-09-20 15:32:45,478 INFO L426 ceAbstractionStarter]: For program point L79-6(lines 79 82) no Hoare annotation was computed. [2018-09-20 15:32:45,478 INFO L429 ceAbstractionStarter]: At program point L67(line 67) the Hoare annotation is: true [2018-09-20 15:32:45,478 INFO L426 ceAbstractionStarter]: For program point L67-1(line 67) no Hoare annotation was computed. [2018-09-20 15:32:45,479 INFO L426 ceAbstractionStarter]: For program point L67-2(line 67) no Hoare annotation was computed. [2018-09-20 15:32:45,479 INFO L422 ceAbstractionStarter]: At program point L67-3(line 67) the Hoare annotation is: (and (= (_ bv1 32) |main_#t~ret7|) |main_#t~short9| (not (fp.eq main_~x~0 main_~x~0))) [2018-09-20 15:32:45,479 INFO L426 ceAbstractionStarter]: For program point L67-4(line 67) no Hoare annotation was computed. [2018-09-20 15:32:45,479 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 57 86) the Hoare annotation is: true [2018-09-20 15:32:45,479 INFO L426 ceAbstractionStarter]: For program point L67-6(line 67) no Hoare annotation was computed. [2018-09-20 15:32:45,479 INFO L426 ceAbstractionStarter]: For program point L67-7(lines 67 68) no Hoare annotation was computed. [2018-09-20 15:32:45,479 INFO L426 ceAbstractionStarter]: For program point L67-9(lines 67 83) no Hoare annotation was computed. [2018-09-20 15:32:45,479 INFO L426 ceAbstractionStarter]: For program point L67-11(lines 67 83) no Hoare annotation was computed. [2018-09-20 15:32:45,479 INFO L426 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-09-20 15:32:45,479 INFO L422 ceAbstractionStarter]: At program point L68(line 68) the Hoare annotation is: (let ((.cse2 (fp.eq main_~x~0 main_~x~0)) (.cse0 (not |main_#t~short9|)) (.cse1 (not |main_#t~short13|))) (or (and .cse0 .cse1 .cse2 (= (_ bv0 32) |main_#t~ret7|)) (and (and (= (_ bv1 32) |main_#t~ret7|) (not .cse2)) (= (bvadd |main_#t~ret8| (_ bv4294967295 32)) (_ bv0 32)) .cse0 .cse1 (not (fp.eq main_~y~0 main_~y~0))))) [2018-09-20 15:32:45,479 INFO L426 ceAbstractionStarter]: For program point L68-1(line 68) no Hoare annotation was computed. [2018-09-20 15:32:45,480 INFO L426 ceAbstractionStarter]: For program point L68-2(line 68) no Hoare annotation was computed. [2018-09-20 15:32:45,480 INFO L426 ceAbstractionStarter]: For program point fmax_floatEXIT(lines 43 52) no Hoare annotation was computed. [2018-09-20 15:32:45,480 INFO L429 ceAbstractionStarter]: At program point fmax_floatENTRY(lines 43 52) the Hoare annotation is: true [2018-09-20 15:32:45,480 INFO L426 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-09-20 15:32:45,480 INFO L426 ceAbstractionStarter]: For program point L51-2(line 51) no Hoare annotation was computed. [2018-09-20 15:32:45,480 INFO L422 ceAbstractionStarter]: At program point L48(line 48) the Hoare annotation is: (and (= |fmax_float_#in~y| fmax_float_~y) (= |fmax_float_#in~x| fmax_float_~x)) [2018-09-20 15:32:45,480 INFO L426 ceAbstractionStarter]: For program point L48-1(lines 48 50) no Hoare annotation was computed. [2018-09-20 15:32:45,480 INFO L422 ceAbstractionStarter]: At program point L44(line 44) the Hoare annotation is: (and (= |fmax_float_#in~y| fmax_float_~y) (= |fmax_float_#in~x| fmax_float_~x)) [2018-09-20 15:32:45,480 INFO L426 ceAbstractionStarter]: For program point L44-1(lines 44 46) no Hoare annotation was computed. [2018-09-20 15:32:45,481 INFO L426 ceAbstractionStarter]: For program point fmax_floatFINAL(lines 43 52) no Hoare annotation was computed. [2018-09-20 15:32:45,481 INFO L426 ceAbstractionStarter]: For program point L31(lines 31 40) no Hoare annotation was computed. [2018-09-20 15:32:45,481 INFO L426 ceAbstractionStarter]: For program point __fpclassify_floatFINAL(lines 20 41) no Hoare annotation was computed. [2018-09-20 15:32:45,481 INFO L426 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-09-20 15:32:45,481 INFO L426 ceAbstractionStarter]: For program point L23-1(lines 23 27) no Hoare annotation was computed. [2018-09-20 15:32:45,481 INFO L422 ceAbstractionStarter]: At program point L23-3(lines 23 27) the Hoare annotation is: (= __fpclassify_float_~x |__fpclassify_float_#in~x|) [2018-09-20 15:32:45,481 INFO L426 ceAbstractionStarter]: For program point L23-4(lines 20 41) no Hoare annotation was computed. [2018-09-20 15:32:45,481 INFO L426 ceAbstractionStarter]: For program point L34(lines 34 40) no Hoare annotation was computed. [2018-09-20 15:32:45,481 INFO L426 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-09-20 15:32:45,481 INFO L426 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-09-20 15:32:45,481 INFO L426 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-09-20 15:32:45,481 INFO L426 ceAbstractionStarter]: For program point L26-2(line 26) no Hoare annotation was computed. [2018-09-20 15:32:45,482 INFO L426 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. [2018-09-20 15:32:45,482 INFO L426 ceAbstractionStarter]: For program point L24-2(line 24) no Hoare annotation was computed. [2018-09-20 15:32:45,482 INFO L426 ceAbstractionStarter]: For program point L24-3(line 24) no Hoare annotation was computed. [2018-09-20 15:32:45,482 INFO L429 ceAbstractionStarter]: At program point __fpclassify_floatENTRY(lines 20 41) the Hoare annotation is: true [2018-09-20 15:32:45,482 INFO L426 ceAbstractionStarter]: For program point __fpclassify_floatEXIT(lines 20 41) no Hoare annotation was computed. [2018-09-20 15:32:45,482 INFO L426 ceAbstractionStarter]: For program point L37(lines 37 40) no Hoare annotation was computed. [2018-09-20 15:32:45,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 03:32:45 BoogieIcfgContainer [2018-09-20 15:32:45,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 15:32:45,496 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 15:32:45,496 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 15:32:45,496 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 15:32:45,497 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:31:54" (3/4) ... [2018-09-20 15:32:45,500 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-09-20 15:32:45,508 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_float [2018-09-20 15:32:45,508 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-09-20 15:32:45,508 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-09-20 15:32:45,509 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure fmax_float [2018-09-20 15:32:45,509 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_float [2018-09-20 15:32:45,518 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-09-20 15:32:45,520 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-09-20 15:32:45,520 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-09-20 15:32:45,549 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: x == \old(x) [2018-09-20 15:32:45,586 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-09-20 15:32:45,590 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 15:32:45,591 INFO L168 Benchmark]: Toolchain (without parser) took 52041.58 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 367.0 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -153.8 MB). Peak memory consumption was 213.2 MB. Max. memory is 11.5 GB. [2018-09-20 15:32:45,592 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:32:45,593 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.23 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-20 15:32:45,593 INFO L168 Benchmark]: Boogie Preprocessor took 45.74 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:32:45,593 INFO L168 Benchmark]: RCFGBuilder took 736.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-09-20 15:32:45,594 INFO L168 Benchmark]: TraceAbstraction took 50820.21 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 229.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -18.9 MB). Peak memory consumption was 210.7 MB. Max. memory is 11.5 GB. [2018-09-20 15:32:45,594 INFO L168 Benchmark]: Witness Printer took 94.21 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 11.5 GB. [2018-09-20 15:32:45,604 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 338.23 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.74 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 736.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 50820.21 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 229.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -18.9 MB). Peak memory consumption was 210.7 MB. Max. memory is 11.5 GB. * Witness Printer took 94.21 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 74]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: x == \old(x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 72 locations, 2 error locations. SAFE Result, 50.7s OverallTime, 31 OverallIterations, 6 TraceHistogramMax, 26.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 2305 SDtfs, 1081 SDslu, 12569 SDs, 0 SdLazy, 5392 SolverSat, 273 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3058 GetRequests, 2664 SyntacticMatches, 8 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 20.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 179 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 156 PreInvPairs, 180 NumberOfFragments, 160 HoareAnnotationTreeSize, 156 FomulaSimplifications, 677 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 19 FomulaSimplificationsInter, 107 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 20.3s InterpolantComputationTime, 2251 NumberOfCodeBlocks, 2251 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2824 ConstructedInterpolants, 35 QuantifiedInterpolants, 634253 SizeOfPredicates, 186 NumberOfNonLiveVariables, 4300 ConjunctsInSsa, 337 ConjunctsInUnsatCore, 42 InterpolantComputations, 20 PerfectInterpolantSequences, 1229/1365 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...