./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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 /storage/repos/svcomp/c/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i -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 305e9c546a6cc2591d6267bc612ab5ec3e8adaa4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 18:21:01,668 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:21:01,670 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:21:01,690 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:21:01,690 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:21:01,691 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:21:01,693 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:21:01,695 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:21:01,696 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:21:01,697 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:21:01,698 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:21:01,698 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:21:01,699 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:21:01,700 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:21:01,702 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:21:01,702 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:21:01,703 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:21:01,705 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:21:01,707 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:21:01,708 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:21:01,709 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:21:01,710 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:21:01,715 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:21:01,715 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:21:01,716 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:21:01,717 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:21:01,720 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:21:01,721 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:21:01,722 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:21:01,723 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:21:01,723 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:21:01,724 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:21:01,724 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:21:01,724 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:21:01,725 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:21:01,726 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:21:01,726 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:21:01,741 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:21:01,742 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:21:01,742 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:21:01,743 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:21:01,743 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:21:01,743 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:21:01,744 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:21:01,744 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:21:01,744 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:21:01,744 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:21:01,744 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:21:01,745 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:21:01,745 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:21:01,745 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:21:01,745 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:21:01,745 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:21:01,745 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:21:01,745 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:21:01,746 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:21:01,746 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:21:01,746 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:21:01,746 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:21:01,746 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:21:01,747 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:21:01,747 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:21:01,747 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:21:01,747 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:21:01,747 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:21:01,747 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:21:01,748 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:21:01,748 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 -> 305e9c546a6cc2591d6267bc612ab5ec3e8adaa4 [2018-11-28 18:21:01,799 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:21:01,816 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:21:01,825 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:21:01,827 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:21:01,828 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:21:01,828 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i [2018-11-28 18:21:01,901 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e38c7fb1e/87e5075a09da4272a641bca6bd772eae/FLAG40456ae50 [2018-11-28 18:21:02,345 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:21:02,347 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i [2018-11-28 18:21:02,354 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e38c7fb1e/87e5075a09da4272a641bca6bd772eae/FLAG40456ae50 [2018-11-28 18:21:02,685 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e38c7fb1e/87e5075a09da4272a641bca6bd772eae [2018-11-28 18:21:02,689 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:21:02,690 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:21:02,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:21:02,692 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:21:02,696 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:21:02,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:21:02" (1/1) ... [2018-11-28 18:21:02,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3068b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:02, skipping insertion in model container [2018-11-28 18:21:02,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:21:02" (1/1) ... [2018-11-28 18:21:02,710 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:21:02,729 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:21:02,915 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:21:02,921 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:21:02,943 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:21:02,957 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:21:02,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:02 WrapperNode [2018-11-28 18:21:02,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:21:02,958 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:21:02,958 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:21:02,958 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:21:02,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:02" (1/1) ... [2018-11-28 18:21:02,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:02" (1/1) ... [2018-11-28 18:21:02,981 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:21:02,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:21:02,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:21:02,982 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:21:02,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:02" (1/1) ... [2018-11-28 18:21:02,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:02" (1/1) ... [2018-11-28 18:21:02,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:02" (1/1) ... [2018-11-28 18:21:02,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:02" (1/1) ... [2018-11-28 18:21:03,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:02" (1/1) ... [2018-11-28 18:21:03,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:02" (1/1) ... [2018-11-28 18:21:03,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:02" (1/1) ... [2018-11-28 18:21:03,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:21:03,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:21:03,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:21:03,011 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:21:03,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:02" (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-11-28 18:21:03,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:21:03,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:21:03,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:21:03,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:21:03,150 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:21:03,150 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:21:03,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 18:21:03,151 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 18:21:03,565 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:21:03,566 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 18:21:03,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:21:03 BoogieIcfgContainer [2018-11-28 18:21:03,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:21:03,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:21:03,567 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:21:03,570 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:21:03,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:21:02" (1/3) ... [2018-11-28 18:21:03,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a493669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:21:03, skipping insertion in model container [2018-11-28 18:21:03,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:02" (2/3) ... [2018-11-28 18:21:03,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a493669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:21:03, skipping insertion in model container [2018-11-28 18:21:03,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:21:03" (3/3) ... [2018-11-28 18:21:03,574 INFO L112 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle_true-unreach-call_true-termination.i [2018-11-28 18:21:03,584 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:21:03,591 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:21:03,606 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:21:03,638 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:21:03,639 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:21:03,639 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:21:03,639 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:21:03,639 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:21:03,639 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:21:03,639 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:21:03,639 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:21:03,640 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:21:03,660 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-11-28 18:21:03,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 18:21:03,667 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:03,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:03,670 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:03,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:03,676 INFO L82 PathProgramCache]: Analyzing trace with hash -584482135, now seen corresponding path program 1 times [2018-11-28 18:21:03,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:03,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:03,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:03,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:03,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:03,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:21:03,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:21:03,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 18:21:03,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 18:21:03,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 18:21:03,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 18:21:03,824 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2018-11-28 18:21:03,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:03,850 INFO L93 Difference]: Finished difference Result 61 states and 92 transitions. [2018-11-28 18:21:03,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 18:21:03,852 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-28 18:21:03,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:03,862 INFO L225 Difference]: With dead ends: 61 [2018-11-28 18:21:03,862 INFO L226 Difference]: Without dead ends: 29 [2018-11-28 18:21:03,867 INFO L631 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-11-28 18:21:03,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-28 18:21:03,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-28 18:21:03,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 18:21:03,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-11-28 18:21:03,919 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 14 [2018-11-28 18:21:03,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:03,920 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-11-28 18:21:03,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 18:21:03,920 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-11-28 18:21:03,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 18:21:03,922 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:03,923 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:03,923 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:03,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:03,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1528524609, now seen corresponding path program 1 times [2018-11-28 18:21:03,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:03,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:03,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:03,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:03,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:04,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:21:04,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:21:04,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:21:04,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:21:04,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:21:04,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:21:04,100 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 5 states. [2018-11-28 18:21:04,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:04,327 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-28 18:21:04,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:21:04,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-28 18:21:04,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:04,329 INFO L225 Difference]: With dead ends: 35 [2018-11-28 18:21:04,329 INFO L226 Difference]: Without dead ends: 33 [2018-11-28 18:21:04,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:21:04,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-28 18:21:04,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-28 18:21:04,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 18:21:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-11-28 18:21:04,347 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 15 [2018-11-28 18:21:04,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:04,347 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-28 18:21:04,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:21:04,349 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-28 18:21:04,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 18:21:04,350 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:04,350 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:04,350 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:04,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:04,351 INFO L82 PathProgramCache]: Analyzing trace with hash -552299140, now seen corresponding path program 1 times [2018-11-28 18:21:04,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:04,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:04,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:04,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:04,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:21:04,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:21:04,705 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:21:04,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:04,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:21:04,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:21:04,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:21:04,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2018-11-28 18:21:04,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 18:21:04,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 18:21:04,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:21:04,916 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 11 states. [2018-11-28 18:21:05,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:05,759 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2018-11-28 18:21:05,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 18:21:05,761 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-11-28 18:21:05,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:05,763 INFO L225 Difference]: With dead ends: 52 [2018-11-28 18:21:05,763 INFO L226 Difference]: Without dead ends: 50 [2018-11-28 18:21:05,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-11-28 18:21:05,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-28 18:21:05,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-11-28 18:21:05,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-28 18:21:05,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2018-11-28 18:21:05,783 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 20 [2018-11-28 18:21:05,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:05,783 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2018-11-28 18:21:05,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 18:21:05,783 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2018-11-28 18:21:05,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 18:21:05,788 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:05,788 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:05,788 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:05,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:05,790 INFO L82 PathProgramCache]: Analyzing trace with hash -641752059, now seen corresponding path program 1 times [2018-11-28 18:21:05,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:05,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:05,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:05,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:05,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:05,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:21:05,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:21:05,982 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:21:05,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:06,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:21:06,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 18:21:06,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:21:06,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2018-11-28 18:21:06,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 18:21:06,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 18:21:06,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:21:06,120 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 10 states. [2018-11-28 18:21:06,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:06,552 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-11-28 18:21:06,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 18:21:06,552 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-11-28 18:21:06,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:06,554 INFO L225 Difference]: With dead ends: 59 [2018-11-28 18:21:06,554 INFO L226 Difference]: Without dead ends: 57 [2018-11-28 18:21:06,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-28 18:21:06,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-28 18:21:06,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2018-11-28 18:21:06,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-28 18:21:06,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-11-28 18:21:06,567 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 28 [2018-11-28 18:21:06,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:06,567 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-11-28 18:21:06,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 18:21:06,568 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-11-28 18:21:06,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 18:21:06,569 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:06,569 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:06,570 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:06,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:06,570 INFO L82 PathProgramCache]: Analyzing trace with hash 7477945, now seen corresponding path program 1 times [2018-11-28 18:21:06,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:06,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:06,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:06,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:06,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:06,751 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 18:21:06,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:21:06,751 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:21:06,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:06,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:21:06,895 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 18:21:06,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:21:06,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2018-11-28 18:21:06,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 18:21:06,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 18:21:06,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-28 18:21:06,916 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 13 states. [2018-11-28 18:21:07,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:07,666 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2018-11-28 18:21:07,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:21:07,668 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-11-28 18:21:07,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:07,670 INFO L225 Difference]: With dead ends: 74 [2018-11-28 18:21:07,670 INFO L226 Difference]: Without dead ends: 67 [2018-11-28 18:21:07,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-11-28 18:21:07,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-28 18:21:07,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-11-28 18:21:07,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-28 18:21:07,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2018-11-28 18:21:07,698 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 31 [2018-11-28 18:21:07,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:07,698 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2018-11-28 18:21:07,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 18:21:07,699 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2018-11-28 18:21:07,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 18:21:07,700 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:07,701 INFO L402 BasicCegarLoop]: trace histogram [4, 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] [2018-11-28 18:21:07,701 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:07,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:07,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1583771254, now seen corresponding path program 1 times [2018-11-28 18:21:07,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:07,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:07,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:07,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:07,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:07,889 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 18:21:07,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:21:07,890 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:21:07,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:07,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:21:08,119 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 18:21:08,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:21:08,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 14 [2018-11-28 18:21:08,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 18:21:08,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 18:21:08,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-28 18:21:08,140 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 14 states. [2018-11-28 18:21:08,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:08,572 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2018-11-28 18:21:08,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:21:08,573 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-28 18:21:08,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:08,574 INFO L225 Difference]: With dead ends: 76 [2018-11-28 18:21:08,575 INFO L226 Difference]: Without dead ends: 74 [2018-11-28 18:21:08,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-11-28 18:21:08,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-28 18:21:08,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2018-11-28 18:21:08,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-28 18:21:08,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2018-11-28 18:21:08,588 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 33 [2018-11-28 18:21:08,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:08,588 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2018-11-28 18:21:08,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 18:21:08,588 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2018-11-28 18:21:08,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 18:21:08,590 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:08,591 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 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-11-28 18:21:08,591 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:08,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:08,591 INFO L82 PathProgramCache]: Analyzing trace with hash 199583202, now seen corresponding path program 1 times [2018-11-28 18:21:08,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:08,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:08,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:08,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:08,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:08,820 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 24 proven. 22 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-28 18:21:08,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:21:08,820 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:21:08,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:08,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:21:09,254 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-28 18:21:09,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:21:09,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-11-28 18:21:09,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 18:21:09,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 18:21:09,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-11-28 18:21:09,286 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand 18 states. [2018-11-28 18:21:10,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:10,389 INFO L93 Difference]: Finished difference Result 107 states and 135 transitions. [2018-11-28 18:21:10,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 18:21:10,391 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2018-11-28 18:21:10,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:10,395 INFO L225 Difference]: With dead ends: 107 [2018-11-28 18:21:10,395 INFO L226 Difference]: Without dead ends: 95 [2018-11-28 18:21:10,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2018-11-28 18:21:10,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-28 18:21:10,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-11-28 18:21:10,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-28 18:21:10,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 113 transitions. [2018-11-28 18:21:10,422 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 113 transitions. Word has length 56 [2018-11-28 18:21:10,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:10,422 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 113 transitions. [2018-11-28 18:21:10,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 18:21:10,423 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 113 transitions. [2018-11-28 18:21:10,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 18:21:10,424 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:10,425 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:10,425 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:10,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:10,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1513329503, now seen corresponding path program 1 times [2018-11-28 18:21:10,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:10,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:10,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:10,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:10,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:10,617 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 13 proven. 28 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-28 18:21:10,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:21:10,617 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:21:10,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:10,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:21:10,795 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-28 18:21:10,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:21:10,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-11-28 18:21:10,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 18:21:10,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 18:21:10,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-11-28 18:21:10,816 INFO L87 Difference]: Start difference. First operand 95 states and 113 transitions. Second operand 16 states. [2018-11-28 18:21:11,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:11,382 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2018-11-28 18:21:11,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 18:21:11,384 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-11-28 18:21:11,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:11,385 INFO L225 Difference]: With dead ends: 101 [2018-11-28 18:21:11,385 INFO L226 Difference]: Without dead ends: 99 [2018-11-28 18:21:11,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2018-11-28 18:21:11,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-28 18:21:11,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-11-28 18:21:11,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-28 18:21:11,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 116 transitions. [2018-11-28 18:21:11,409 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 116 transitions. Word has length 58 [2018-11-28 18:21:11,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:11,410 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 116 transitions. [2018-11-28 18:21:11,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 18:21:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 116 transitions. [2018-11-28 18:21:11,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 18:21:11,412 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:11,412 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:11,412 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:11,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:11,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1920756074, now seen corresponding path program 2 times [2018-11-28 18:21:11,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:11,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:11,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:11,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:11,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 44 proven. 48 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-11-28 18:21:11,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:21:11,597 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:21:11,607 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:21:11,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:21:11,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:21:11,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:21:12,254 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 68 proven. 35 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-11-28 18:21:12,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:21:12,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2018-11-28 18:21:12,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 18:21:12,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 18:21:12,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2018-11-28 18:21:12,274 INFO L87 Difference]: Start difference. First operand 99 states and 116 transitions. Second operand 20 states. [2018-11-28 18:21:13,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:13,525 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2018-11-28 18:21:13,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-28 18:21:13,526 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 83 [2018-11-28 18:21:13,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:13,528 INFO L225 Difference]: With dead ends: 110 [2018-11-28 18:21:13,528 INFO L226 Difference]: Without dead ends: 108 [2018-11-28 18:21:13,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=242, Invalid=1018, Unknown=0, NotChecked=0, Total=1260 [2018-11-28 18:21:13,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-28 18:21:13,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2018-11-28 18:21:13,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-28 18:21:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2018-11-28 18:21:13,541 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 83 [2018-11-28 18:21:13,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:13,542 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2018-11-28 18:21:13,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 18:21:13,542 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2018-11-28 18:21:13,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-28 18:21:13,544 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:13,544 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:13,545 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:13,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:13,545 INFO L82 PathProgramCache]: Analyzing trace with hash -357754430, now seen corresponding path program 2 times [2018-11-28 18:21:13,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:13,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:13,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:13,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:21:13,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:13,803 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 64 proven. 75 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2018-11-28 18:21:13,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:21:13,804 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:21:13,818 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:21:13,869 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:21:13,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:21:13,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:21:14,264 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 115 proven. 26 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-11-28 18:21:14,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:21:14,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2018-11-28 18:21:14,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 18:21:14,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 18:21:14,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-11-28 18:21:14,287 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand 20 states. [2018-11-28 18:21:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:15,126 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2018-11-28 18:21:15,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 18:21:15,130 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 106 [2018-11-28 18:21:15,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:15,131 INFO L225 Difference]: With dead ends: 103 [2018-11-28 18:21:15,131 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 18:21:15,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 98 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2018-11-28 18:21:15,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 18:21:15,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 18:21:15,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 18:21:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 18:21:15,135 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2018-11-28 18:21:15,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:15,135 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 18:21:15,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 18:21:15,135 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 18:21:15,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 18:21:15,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 18:21:15,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:21:15,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:21:16,178 WARN L180 SmtUtils]: Spent 896.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2018-11-28 18:21:16,409 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2018-11-28 18:21:16,608 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2018-11-28 18:21:16,969 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2018-11-28 18:21:17,251 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 30 [2018-11-28 18:21:17,384 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 30 [2018-11-28 18:21:17,387 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 18:21:17,387 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:21:17,387 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:21:17,387 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 18:21:17,388 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 18:21:17,388 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 18:21:17,388 INFO L444 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse5 (+ main_~buflim~0 2))) (let ((.cse2 (<= 1 main_~in~0)) (.cse4 (<= .cse5 main_~bufferlen~0)) (.cse1 (<= main_~bufferlen~0 .cse5)) (.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse3 (<= (+ main_~buf~0 3) main_~bufferlen~0))) (or (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse1 (<= 3 main_~buf~0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4 (<= main_~in~0 1) .cse1 (<= 1 main_~buf~0)) (and .cse0 .cse2 .cse3 .cse4 (<= main_~in~0 2) .cse1 (<= 2 main_~buf~0)) (and .cse0 (<= 0 main_~in~0) (<= main_~in~0 0) .cse3 (= main_~bufferlen~0 .cse5) (= main_~buf~0 0))))) [2018-11-28 18:21:17,388 INFO L444 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse5 (+ main_~buflim~0 2))) (let ((.cse2 (<= 1 main_~in~0)) (.cse4 (<= .cse5 main_~bufferlen~0)) (.cse1 (<= main_~bufferlen~0 .cse5)) (.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse3 (<= (+ main_~buf~0 3) main_~bufferlen~0))) (or (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse1 (<= 3 main_~buf~0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4 (<= main_~in~0 1) .cse1 (<= 1 main_~buf~0)) (and .cse0 .cse2 .cse3 .cse4 (<= main_~in~0 2) .cse1 (<= 2 main_~buf~0)) (and .cse0 (<= 0 main_~in~0) (<= main_~in~0 0) .cse3 (= main_~bufferlen~0 .cse5) (= main_~buf~0 0))))) [2018-11-28 18:21:17,388 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 42) no Hoare annotation was computed. [2018-11-28 18:21:17,389 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2018-11-28 18:21:17,389 INFO L444 ceAbstractionStarter]: At program point L23-3(lines 23 34) the Hoare annotation is: (let ((.cse2 (<= 1 main_~in~0)) (.cse0 (<= 0 main_~buf~0)) (.cse3 (<= (+ main_~buf~0 2) main_~bufferlen~0))) (or (and (<= main_~buf~0 0) (<= 0 main_~in~0) .cse0 (<= 2 main_~bufferlen~0)) (let ((.cse1 (+ main_~buflim~0 2))) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse1) .cse2 .cse0 (<= .cse1 main_~bufferlen~0) .cse3)) (and (<= main_~buf~0 2) .cse2 .cse0 (<= 3 main_~inlen~0) .cse3))) [2018-11-28 18:21:17,389 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-28 18:21:17,389 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-11-28 18:21:17,389 INFO L444 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse5 (+ main_~buflim~0 2))) (let ((.cse4 (<= (+ main_~buf~0 2) main_~bufferlen~0)) (.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse2 (<= 1 main_~in~0)) (.cse3 (<= .cse5 main_~bufferlen~0)) (.cse1 (<= main_~bufferlen~0 .cse5))) (or (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse1 (<= 3 main_~buf~0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 (<= main_~in~0 2) .cse1 .cse4 (<= 2 main_~buf~0)) (and .cse0 .cse2 .cse3 (<= main_~in~0 1) .cse1 (<= 1 main_~buf~0) (< main_~buf~0 (+ main_~buflim~0 1)))))) [2018-11-28 18:21:17,389 INFO L444 ceAbstractionStarter]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse5 (+ main_~buflim~0 2))) (let ((.cse4 (<= (+ main_~buf~0 2) main_~bufferlen~0)) (.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse2 (<= 1 main_~in~0)) (.cse3 (<= .cse5 main_~bufferlen~0)) (.cse1 (<= main_~bufferlen~0 .cse5))) (or (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse1 (<= 3 main_~buf~0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 (<= main_~in~0 2) .cse1 .cse4 (<= 2 main_~buf~0)) (and .cse0 .cse2 .cse3 (<= main_~in~0 1) .cse1 (<= 1 main_~buf~0) (< main_~buf~0 (+ main_~buflim~0 1)))))) [2018-11-28 18:21:17,390 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-28 18:21:17,390 INFO L451 ceAbstractionStarter]: At program point L41(lines 11 42) the Hoare annotation is: true [2018-11-28 18:21:17,390 INFO L444 ceAbstractionStarter]: At program point L33(lines 23 34) the Hoare annotation is: (let ((.cse5 (+ main_~buflim~0 2))) (let ((.cse4 (<= (+ main_~buf~0 2) main_~bufferlen~0)) (.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse1 (<= 1 main_~in~0)) (.cse2 (<= .cse5 main_~bufferlen~0)) (.cse3 (<= main_~bufferlen~0 .cse5))) (or (and .cse0 .cse1 .cse2 (<= main_~in~0 2) .cse3 .cse4 (<= 2 main_~buf~0)) (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse3 (<= 3 main_~buf~0) .cse1 .cse2 .cse4) (and .cse0 .cse3 (<= 0 main_~in~0) .cse2 (<= main_~in~0 0) (= main_~buf~0 0) (<= 2 main_~bufferlen~0)) (and .cse0 .cse1 .cse2 (<= main_~in~0 1) .cse3 (<= 1 main_~buf~0) (< main_~buf~0 (+ main_~buflim~0 1)))))) [2018-11-28 18:21:17,390 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2018-11-28 18:21:17,390 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-28 18:21:17,390 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 11 42) no Hoare annotation was computed. [2018-11-28 18:21:17,390 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 42) no Hoare annotation was computed. [2018-11-28 18:21:17,391 INFO L444 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse0 (and (<= 0 main_~in~0) (<= 0 main_~buf~0)))) (or (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (and (<= 3 main_~inlen~0) .cse0) (< 1 main_~bufferlen~0)) (and (<= main_~buf~0 1) .cse0 (<= 2 main_~bufferlen~0)))) [2018-11-28 18:21:17,391 INFO L444 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse0 (and (<= 0 main_~in~0) (<= 0 main_~buf~0)))) (or (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (and (<= 3 main_~inlen~0) .cse0) (< 1 main_~bufferlen~0)) (and (<= main_~buf~0 1) .cse0 (<= 2 main_~bufferlen~0)))) [2018-11-28 18:21:17,391 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-11-28 18:21:17,391 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 42) the Hoare annotation is: true [2018-11-28 18:21:17,391 INFO L448 ceAbstractionStarter]: For program point L18(lines 11 42) no Hoare annotation was computed. [2018-11-28 18:21:17,391 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-28 18:21:17,391 INFO L444 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (let ((.cse2 (<= 1 main_~in~0)) (.cse0 (<= 0 main_~buf~0)) (.cse3 (<= (+ main_~buf~0 2) main_~bufferlen~0))) (or (and (<= main_~buf~0 0) (<= 0 main_~in~0) .cse0 (<= 2 main_~bufferlen~0)) (let ((.cse1 (+ main_~buflim~0 2))) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse1) .cse2 .cse0 (<= .cse1 main_~bufferlen~0) .cse3)) (and (<= main_~buf~0 2) .cse2 .cse0 (<= 3 main_~inlen~0) .cse3))) [2018-11-28 18:21:17,392 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-28 18:21:17,392 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-28 18:21:17,392 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-28 18:21:17,392 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-28 18:21:17,392 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-28 18:21:17,392 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-28 18:21:17,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:21:17 BoogieIcfgContainer [2018-11-28 18:21:17,411 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:21:17,412 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:21:17,412 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:21:17,412 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:21:17,413 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:21:03" (3/4) ... [2018-11-28 18:21:17,416 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 18:21:17,422 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 18:21:17,423 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 18:21:17,423 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-28 18:21:17,428 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-11-28 18:21:17,428 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-28 18:21:17,428 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 18:21:17,494 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:21:17,494 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:21:17,498 INFO L168 Benchmark]: Toolchain (without parser) took 14808.98 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 281.0 MB). Free memory was 952.7 MB in the beginning and 876.7 MB in the end (delta: 76.0 MB). Peak memory consumption was 357.0 MB. Max. memory is 11.5 GB. [2018-11-28 18:21:17,499 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:21:17,500 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.34 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-11-28 18:21:17,500 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.01 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:21:17,501 INFO L168 Benchmark]: Boogie Preprocessor took 28.62 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:21:17,501 INFO L168 Benchmark]: RCFGBuilder took 555.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-11-28 18:21:17,503 INFO L168 Benchmark]: TraceAbstraction took 13844.40 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 137.9 MB). Free memory was 1.1 GB in the beginning and 885.5 MB in the end (delta: 234.4 MB). Peak memory consumption was 372.2 MB. Max. memory is 11.5 GB. [2018-11-28 18:21:17,509 INFO L168 Benchmark]: Witness Printer took 82.31 ms. Allocated memory is still 1.3 GB. Free memory was 885.5 MB in the beginning and 876.7 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2018-11-28 18:21:17,514 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.55 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 266.34 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.01 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.62 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 555.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13844.40 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 137.9 MB). Free memory was 1.1 GB in the beginning and 885.5 MB in the end (delta: 234.4 MB). Peak memory consumption was 372.2 MB. Max. memory is 11.5 GB. * Witness Printer took 82.31 ms. Allocated memory is still 1.3 GB. Free memory was 885.5 MB in the beginning and 876.7 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((((((bufferlen + 1 <= inlen && 1 <= in) && buflim + 2 <= bufferlen) && in <= 2) && bufferlen <= buflim + 2) && buf + 2 <= bufferlen) && 2 <= buf) || ((((((bufferlen + 1 <= inlen && in + bufferlen + 1 <= buf + inlen) && bufferlen <= buflim + 2) && 3 <= buf) && 1 <= in) && buflim + 2 <= bufferlen) && buf + 2 <= bufferlen)) || ((((((bufferlen + 1 <= inlen && bufferlen <= buflim + 2) && 0 <= in) && buflim + 2 <= bufferlen) && in <= 0) && buf == 0) && 2 <= bufferlen)) || ((((((bufferlen + 1 <= inlen && 1 <= in) && buflim + 2 <= bufferlen) && in <= 1) && bufferlen <= buflim + 2) && 1 <= buf) && buf < buflim + 1) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 35 locations, 1 error locations. SAFE Result, 13.7s OverallTime, 10 OverallIterations, 16 TraceHistogramMax, 6.5s AutomataDifference, 0.0s DeadEndRemovalTime, 2.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 291 SDtfs, 418 SDslu, 1595 SDs, 0 SdLazy, 2192 SolverSat, 514 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 569 GetRequests, 388 SyntacticMatches, 14 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=9, 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, 10 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 58 PreInvPairs, 100 NumberOfFragments, 768 HoareAnnotationTreeSize, 58 FomulaSimplifications, 839 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 15 FomulaSimplificationsInter, 902 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 859 NumberOfCodeBlocks, 859 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 841 ConstructedInterpolants, 0 QuantifiedInterpolants, 230778 SizeOfPredicates, 27 NumberOfNonLiveVariables, 839 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 1727/2010 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...