./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/id2_b2_o3_true-unreach-call_true-termination_true-no-overflow.c --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/recursive-simple/id2_b2_o3_true-unreach-call_true-termination_true-no-overflow.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 f345f307410a5ddbdd0513896d69ca703c67be23 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:52:32,627 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:52:32,630 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:52:32,645 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:52:32,645 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:52:32,646 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:52:32,647 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:52:32,650 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:52:32,652 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:52:32,653 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:52:32,654 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:52:32,654 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:52:32,655 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:52:32,657 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:52:32,658 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:52:32,659 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:52:32,660 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:52:32,663 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:52:32,665 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:52:32,668 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:52:32,669 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:52:32,670 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:52:32,673 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:52:32,674 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:52:32,674 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:52:32,675 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:52:32,676 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:52:32,678 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:52:32,682 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:52:32,683 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:52:32,683 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:52:32,684 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:52:32,684 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:52:32,685 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:52:32,687 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:52:32,691 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:52:32,694 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:52:32,728 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:52:32,728 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:52:32,729 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:52:32,729 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:52:32,731 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:52:32,731 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:52:32,731 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:52:32,731 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:52:32,732 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:52:32,733 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:52:32,734 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:52:32,734 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:52:32,734 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:52:32,734 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:52:32,735 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:52:32,735 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:52:32,735 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:52:32,735 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:52:32,736 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:52:32,736 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:52:32,736 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:52:32,736 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:52:32,736 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:52:32,737 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:52:32,737 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:52:32,737 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:52:32,737 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:52:32,737 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:52:32,737 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:52:32,738 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:52:32,738 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 -> f345f307410a5ddbdd0513896d69ca703c67be23 [2018-11-28 18:52:32,796 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:52:32,814 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:52:32,819 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:52:32,822 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:52:32,822 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:52:32,823 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/id2_b2_o3_true-unreach-call_true-termination_true-no-overflow.c [2018-11-28 18:52:32,903 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c44ddc6c/b63116e983954afaa87002355aae120d/FLAGb6dbd3c62 [2018-11-28 18:52:33,442 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:52:33,443 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/id2_b2_o3_true-unreach-call_true-termination_true-no-overflow.c [2018-11-28 18:52:33,450 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c44ddc6c/b63116e983954afaa87002355aae120d/FLAGb6dbd3c62 [2018-11-28 18:52:33,734 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c44ddc6c/b63116e983954afaa87002355aae120d [2018-11-28 18:52:33,739 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:52:33,741 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:52:33,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:52:33,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:52:33,748 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:52:33,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:52:33" (1/1) ... [2018-11-28 18:52:33,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10019331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:33, skipping insertion in model container [2018-11-28 18:52:33,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:52:33" (1/1) ... [2018-11-28 18:52:33,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:52:33,784 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:52:34,041 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:52:34,050 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:52:34,080 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:52:34,105 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:52:34,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:34 WrapperNode [2018-11-28 18:52:34,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:52:34,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:52:34,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:52:34,108 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:52:34,120 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:52:34" (1/1) ... [2018-11-28 18:52:34,127 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:52:34" (1/1) ... [2018-11-28 18:52:34,137 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:52:34,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:52:34,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:52:34,138 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:52:34,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:34" (1/1) ... [2018-11-28 18:52:34,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:34" (1/1) ... [2018-11-28 18:52:34,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:34" (1/1) ... [2018-11-28 18:52:34,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:34" (1/1) ... [2018-11-28 18:52:34,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:34" (1/1) ... [2018-11-28 18:52:34,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:34" (1/1) ... [2018-11-28 18:52:34,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:34" (1/1) ... [2018-11-28 18:52:34,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:52:34,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:52:34,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:52:34,175 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:52:34,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:34" (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:52:34,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:52:34,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:52:34,317 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2018-11-28 18:52:34,317 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2018-11-28 18:52:34,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:52:34,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:52:34,317 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:52:34,317 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:52:34,317 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-11-28 18:52:34,319 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-11-28 18:52:34,795 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:52:34,796 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 18:52:34,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:52:34 BoogieIcfgContainer [2018-11-28 18:52:34,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:52:34,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:52:34,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:52:34,804 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:52:34,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:52:33" (1/3) ... [2018-11-28 18:52:34,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0ae35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:52:34, skipping insertion in model container [2018-11-28 18:52:34,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:34" (2/3) ... [2018-11-28 18:52:34,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0ae35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:52:34, skipping insertion in model container [2018-11-28 18:52:34,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:52:34" (3/3) ... [2018-11-28 18:52:34,810 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_b2_o3_true-unreach-call_true-termination_true-no-overflow.c [2018-11-28 18:52:34,823 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:52:34,831 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:52:34,851 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:52:34,895 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:52:34,896 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:52:34,896 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:52:34,896 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:52:34,897 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:52:34,898 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:52:34,898 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:52:34,898 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:52:34,898 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:52:34,925 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-28 18:52:34,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 18:52:34,933 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:34,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:52:34,937 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:34,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:34,945 INFO L82 PathProgramCache]: Analyzing trace with hash 128923731, now seen corresponding path program 1 times [2018-11-28 18:52:34,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:34,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:35,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:35,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:35,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:35,418 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:52:35,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:52:35,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:52:35,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:52:35,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:52:35,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:52:35,445 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2018-11-28 18:52:35,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:35,560 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-28 18:52:35,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:52:35,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-28 18:52:35,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:35,578 INFO L225 Difference]: With dead ends: 40 [2018-11-28 18:52:35,578 INFO L226 Difference]: Without dead ends: 26 [2018-11-28 18:52:35,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:52:35,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-28 18:52:35,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-28 18:52:35,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 18:52:35,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-28 18:52:35,648 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2018-11-28 18:52:35,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:35,650 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-28 18:52:35,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:52:35,650 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-28 18:52:35,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 18:52:35,654 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:35,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:52:35,655 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:35,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:35,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1945633833, now seen corresponding path program 1 times [2018-11-28 18:52:35,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:35,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:35,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:35,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:35,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:36,103 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:52:36,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:52:36,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:52:36,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:52:36,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:52:36,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:52:36,114 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2018-11-28 18:52:36,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:36,209 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-28 18:52:36,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:52:36,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-28 18:52:36,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:36,211 INFO L225 Difference]: With dead ends: 44 [2018-11-28 18:52:36,211 INFO L226 Difference]: Without dead ends: 32 [2018-11-28 18:52:36,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:52:36,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-28 18:52:36,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-28 18:52:36,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 18:52:36,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-28 18:52:36,222 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2018-11-28 18:52:36,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:36,222 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-28 18:52:36,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:52:36,223 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-28 18:52:36,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 18:52:36,224 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:36,224 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:52:36,224 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:36,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:36,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1974262984, now seen corresponding path program 1 times [2018-11-28 18:52:36,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:36,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:36,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:36,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:36,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:36,618 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:52:36,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:52:36,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 18:52:36,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 18:52:36,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 18:52:36,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:52:36,619 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 8 states. [2018-11-28 18:52:36,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:36,712 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-28 18:52:36,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 18:52:36,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-28 18:52:36,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:36,715 INFO L225 Difference]: With dead ends: 36 [2018-11-28 18:52:36,715 INFO L226 Difference]: Without dead ends: 32 [2018-11-28 18:52:36,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:52:36,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-28 18:52:36,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-28 18:52:36,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 18:52:36,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-28 18:52:36,723 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2018-11-28 18:52:36,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:36,723 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-28 18:52:36,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 18:52:36,723 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-28 18:52:36,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 18:52:36,724 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:36,725 INFO L402 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] [2018-11-28 18:52:36,725 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:36,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:36,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1423155149, now seen corresponding path program 1 times [2018-11-28 18:52:36,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:36,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:36,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:36,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:36,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 18:52:36,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:52:36,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:52:36,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:52:36,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:52:36,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:52:36,986 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2018-11-28 18:52:37,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:37,018 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-28 18:52:37,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:52:37,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-28 18:52:37,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:37,021 INFO L225 Difference]: With dead ends: 48 [2018-11-28 18:52:37,021 INFO L226 Difference]: Without dead ends: 36 [2018-11-28 18:52:37,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:52:37,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-28 18:52:37,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-28 18:52:37,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 18:52:37,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-28 18:52:37,031 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-11-28 18:52:37,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:37,031 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-28 18:52:37,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:52:37,031 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-28 18:52:37,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 18:52:37,032 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:37,033 INFO L402 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] [2018-11-28 18:52:37,034 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:37,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:37,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1226641644, now seen corresponding path program 1 times [2018-11-28 18:52:37,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:37,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:37,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:37,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:37,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:37,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 18:52:37,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:52:37,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:52:37,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:52:37,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:52:37,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:52:37,182 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2018-11-28 18:52:37,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:37,225 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-28 18:52:37,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:52:37,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-28 18:52:37,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:37,228 INFO L225 Difference]: With dead ends: 40 [2018-11-28 18:52:37,228 INFO L226 Difference]: Without dead ends: 36 [2018-11-28 18:52:37,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:52:37,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-28 18:52:37,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-28 18:52:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 18:52:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-28 18:52:37,238 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-11-28 18:52:37,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:37,239 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-28 18:52:37,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:52:37,239 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-28 18:52:37,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 18:52:37,240 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:37,240 INFO L402 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] [2018-11-28 18:52:37,242 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:37,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:37,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1255270795, now seen corresponding path program 1 times [2018-11-28 18:52:37,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:37,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:37,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:37,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:37,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:37,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 18:52:37,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:52:37,879 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:52:37,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:37,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:52:38,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 18:52:38,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:52:38,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-28 18:52:38,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 18:52:38,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 18:52:38,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:52:38,075 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 12 states. [2018-11-28 18:52:38,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:38,339 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-11-28 18:52:38,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 18:52:38,340 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-28 18:52:38,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:38,342 INFO L225 Difference]: With dead ends: 58 [2018-11-28 18:52:38,342 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 18:52:38,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-11-28 18:52:38,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 18:52:38,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2018-11-28 18:52:38,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 18:52:38,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-28 18:52:38,351 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-11-28 18:52:38,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:38,353 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-28 18:52:38,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 18:52:38,354 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-28 18:52:38,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 18:52:38,355 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:38,355 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-28 18:52:38,356 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:38,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:38,356 INFO L82 PathProgramCache]: Analyzing trace with hash 906172561, now seen corresponding path program 1 times [2018-11-28 18:52:38,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:38,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:38,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:38,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:38,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:38,620 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 18:52:38,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:52:38,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:52:38,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:52:38,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:52:38,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:52:38,622 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2018-11-28 18:52:38,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:38,669 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-28 18:52:38,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:52:38,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-28 18:52:38,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:38,676 INFO L225 Difference]: With dead ends: 54 [2018-11-28 18:52:38,676 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 18:52:38,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:52:38,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 18:52:38,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-28 18:52:38,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 18:52:38,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-28 18:52:38,685 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 34 [2018-11-28 18:52:38,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:38,686 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-28 18:52:38,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:52:38,686 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-28 18:52:38,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 18:52:38,688 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:38,688 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-28 18:52:38,688 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:38,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:38,689 INFO L82 PathProgramCache]: Analyzing trace with hash 709659056, now seen corresponding path program 1 times [2018-11-28 18:52:38,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:38,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:38,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:38,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:38,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:38,965 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 18:52:38,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:52:38,966 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:52:38,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:39,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:52:39,203 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 18:52:39,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:52:39,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-28 18:52:39,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 18:52:39,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 18:52:39,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:52:39,227 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 12 states. [2018-11-28 18:52:39,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:39,412 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2018-11-28 18:52:39,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 18:52:39,417 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-11-28 18:52:39,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:39,418 INFO L225 Difference]: With dead ends: 70 [2018-11-28 18:52:39,419 INFO L226 Difference]: Without dead ends: 52 [2018-11-28 18:52:39,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-11-28 18:52:39,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-28 18:52:39,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2018-11-28 18:52:39,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 18:52:39,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-28 18:52:39,428 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 34 [2018-11-28 18:52:39,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:39,429 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-28 18:52:39,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 18:52:39,429 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-28 18:52:39,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 18:52:39,431 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:39,432 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:52:39,432 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:39,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:39,433 INFO L82 PathProgramCache]: Analyzing trace with hash -797786941, now seen corresponding path program 2 times [2018-11-28 18:52:39,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:39,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:39,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:39,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:39,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 18:52:39,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:52:39,873 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:52:39,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:52:39,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:52:39,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:52:39,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:52:39,943 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 18:52:39,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:52:39,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 17 [2018-11-28 18:52:39,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 18:52:39,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 18:52:39,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-11-28 18:52:39,965 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 17 states. [2018-11-28 18:52:40,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:40,537 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-11-28 18:52:40,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 18:52:40,538 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-11-28 18:52:40,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:40,539 INFO L225 Difference]: With dead ends: 58 [2018-11-28 18:52:40,539 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 18:52:40,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-11-28 18:52:40,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 18:52:40,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 18:52:40,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 18:52:40,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 18:52:40,543 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2018-11-28 18:52:40,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:40,543 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 18:52:40,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 18:52:40,543 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 18:52:40,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 18:52:40,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 18:52:40,603 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 18:52:40,603 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:52:40,603 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-28 18:52:40,603 INFO L451 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: true [2018-11-28 18:52:40,603 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-11-28 18:52:40,603 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2018-11-28 18:52:40,604 INFO L448 ceAbstractionStarter]: For program point id2EXIT(lines 14 19) no Hoare annotation was computed. [2018-11-28 18:52:40,604 INFO L451 ceAbstractionStarter]: At program point id2ENTRY(lines 14 19) the Hoare annotation is: true [2018-11-28 18:52:40,604 INFO L448 ceAbstractionStarter]: For program point id2FINAL(lines 14 19) no Hoare annotation was computed. [2018-11-28 18:52:40,604 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:52:40,604 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 18:52:40,604 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 18:52:40,604 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 18:52:40,604 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 21 27) the Hoare annotation is: true [2018-11-28 18:52:40,604 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-28 18:52:40,605 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 21 27) no Hoare annotation was computed. [2018-11-28 18:52:40,605 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-11-28 18:52:40,605 INFO L451 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: true [2018-11-28 18:52:40,605 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-11-28 18:52:40,605 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 21 27) no Hoare annotation was computed. [2018-11-28 18:52:40,605 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2018-11-28 18:52:40,605 INFO L448 ceAbstractionStarter]: For program point idFINAL(lines 7 12) no Hoare annotation was computed. [2018-11-28 18:52:40,606 INFO L448 ceAbstractionStarter]: For program point idEXIT(lines 7 12) no Hoare annotation was computed. [2018-11-28 18:52:40,606 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2018-11-28 18:52:40,606 INFO L451 ceAbstractionStarter]: At program point L9(line 9) the Hoare annotation is: true [2018-11-28 18:52:40,606 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2018-11-28 18:52:40,606 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2018-11-28 18:52:40,606 INFO L451 ceAbstractionStarter]: At program point idENTRY(lines 7 12) the Hoare annotation is: true [2018-11-28 18:52:40,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:52:40 BoogieIcfgContainer [2018-11-28 18:52:40,610 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:52:40,611 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:52:40,611 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:52:40,611 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:52:40,612 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:52:34" (3/4) ... [2018-11-28 18:52:40,617 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 18:52:40,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 18:52:40,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id2 [2018-11-28 18:52:40,626 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 18:52:40,626 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2018-11-28 18:52:40,632 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-28 18:52:40,632 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 18:52:40,632 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 18:52:40,691 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:52:40,691 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:52:40,694 INFO L168 Benchmark]: Toolchain (without parser) took 6953.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 951.4 MB in the beginning and 808.2 MB in the end (delta: 143.1 MB). Peak memory consumption was 234.9 MB. Max. memory is 11.5 GB. [2018-11-28 18:52:40,696 INFO L168 Benchmark]: CDTParser took 0.22 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:52:40,699 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.71 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:52:40,699 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.30 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:52:40,700 INFO L168 Benchmark]: Boogie Preprocessor took 35.13 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:52:40,700 INFO L168 Benchmark]: RCFGBuilder took 624.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -127.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-28 18:52:40,701 INFO L168 Benchmark]: TraceAbstraction took 5811.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 815.0 MB in the end (delta: 252.7 MB). Peak memory consumption was 252.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:52:40,705 INFO L168 Benchmark]: Witness Printer took 80.47 ms. Allocated memory is still 1.1 GB. Free memory was 815.0 MB in the beginning and 808.2 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-28 18:52:40,712 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.22 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 363.71 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.30 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 35.13 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 624.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -127.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5811.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 815.0 MB in the end (delta: 252.7 MB). Peak memory consumption was 252.7 MB. Max. memory is 11.5 GB. * Witness Printer took 80.47 ms. Allocated memory is still 1.1 GB. Free memory was 815.0 MB in the beginning and 808.2 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. SAFE Result, 5.7s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 262 SDtfs, 28 SDslu, 1482 SDs, 0 SdLazy, 323 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 109 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=8, 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, 9 MinimizatonAttempts, 24 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 11 PreInvPairs, 11 NumberOfFragments, 9 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 333 ConstructedInterpolants, 0 QuantifiedInterpolants, 31593 SizeOfPredicates, 10 NumberOfNonLiveVariables, 225 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 61/93 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...