./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/id2_b5_o10_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_b5_o10_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 6f330f622534898bf170bbd5a7ac37bee3deb574 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:34,553 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:52:34,555 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:52:34,568 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:52:34,568 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:52:34,569 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:52:34,571 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:52:34,573 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:52:34,575 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:52:34,576 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:52:34,577 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:52:34,577 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:52:34,578 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:52:34,579 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:52:34,580 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:52:34,581 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:52:34,582 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:52:34,584 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:52:34,586 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:52:34,588 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:52:34,590 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:52:34,591 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:52:34,594 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:52:34,594 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:52:34,594 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:52:34,595 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:52:34,597 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:52:34,598 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:52:34,599 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:52:34,600 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:52:34,600 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:52:34,601 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:52:34,601 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:52:34,602 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:52:34,603 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:52:34,604 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:52:34,604 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:34,621 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:52:34,621 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:52:34,622 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:52:34,623 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:52:34,623 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:52:34,623 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:52:34,624 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:52:34,624 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:52:34,624 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:52:34,624 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:52:34,624 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:52:34,625 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:52:34,625 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:52:34,625 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:52:34,625 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:52:34,625 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:52:34,626 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:52:34,626 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:52:34,626 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:52:34,626 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:52:34,626 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:52:34,627 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:52:34,627 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:52:34,627 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:52:34,627 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:52:34,627 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:52:34,628 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:52:34,628 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:52:34,628 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:52:34,628 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:52:34,628 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 -> 6f330f622534898bf170bbd5a7ac37bee3deb574 [2018-11-28 18:52:34,685 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:52:34,705 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:52:34,709 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:52:34,710 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:52:34,711 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:52:34,712 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/id2_b5_o10_true-unreach-call_true-termination_true-no-overflow.c [2018-11-28 18:52:34,779 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1343bc2c/4e41fd087635483987116a0e1f869820/FLAG2a66c6b5a [2018-11-28 18:52:35,281 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:52:35,282 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/id2_b5_o10_true-unreach-call_true-termination_true-no-overflow.c [2018-11-28 18:52:35,290 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1343bc2c/4e41fd087635483987116a0e1f869820/FLAG2a66c6b5a [2018-11-28 18:52:35,616 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1343bc2c/4e41fd087635483987116a0e1f869820 [2018-11-28 18:52:35,620 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:52:35,622 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:52:35,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:52:35,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:52:35,629 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:52:35,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:52:35" (1/1) ... [2018-11-28 18:52:35,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b597f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:35, skipping insertion in model container [2018-11-28 18:52:35,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:52:35" (1/1) ... [2018-11-28 18:52:35,643 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:52:35,660 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:52:35,842 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:52:35,847 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:52:35,878 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:52:35,893 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:52:35,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:35 WrapperNode [2018-11-28 18:52:35,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:52:35,895 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:52:35,895 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:52:35,895 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:52:35,906 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:35" (1/1) ... [2018-11-28 18:52:35,912 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:35" (1/1) ... [2018-11-28 18:52:35,919 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:52:35,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:52:35,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:52:35,920 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:52:35,932 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:35" (1/1) ... [2018-11-28 18:52:35,932 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:35" (1/1) ... [2018-11-28 18:52:35,933 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:35" (1/1) ... [2018-11-28 18:52:35,933 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:35" (1/1) ... [2018-11-28 18:52:35,940 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:35" (1/1) ... [2018-11-28 18:52:35,943 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:35" (1/1) ... [2018-11-28 18:52:35,944 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:35" (1/1) ... [2018-11-28 18:52:35,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:52:35,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:52:35,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:52:35,948 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:52:35,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:35" (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:36,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:52:36,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:52:36,083 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2018-11-28 18:52:36,083 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2018-11-28 18:52:36,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:52:36,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:52:36,083 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:52:36,083 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:52:36,084 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-11-28 18:52:36,084 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-11-28 18:52:36,400 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:52:36,400 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 18:52:36,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:52:36 BoogieIcfgContainer [2018-11-28 18:52:36,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:52:36,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:52:36,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:52:36,409 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:52:36,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:52:35" (1/3) ... [2018-11-28 18:52:36,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20223088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:52:36, skipping insertion in model container [2018-11-28 18:52:36,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:35" (2/3) ... [2018-11-28 18:52:36,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20223088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:52:36, skipping insertion in model container [2018-11-28 18:52:36,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:52:36" (3/3) ... [2018-11-28 18:52:36,417 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_b5_o10_true-unreach-call_true-termination_true-no-overflow.c [2018-11-28 18:52:36,428 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:52:36,437 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:52:36,454 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:52:36,483 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:52:36,484 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:52:36,484 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:52:36,484 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:52:36,485 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:52:36,485 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:52:36,485 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:52:36,485 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:52:36,485 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:52:36,507 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-28 18:52:36,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 18:52:36,514 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:36,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:52:36,517 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:36,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:36,524 INFO L82 PathProgramCache]: Analyzing trace with hash 128923731, now seen corresponding path program 1 times [2018-11-28 18:52:36,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:36,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:36,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:36,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:36,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:36,878 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,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:52:36,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:52:36,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:52:36,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:52:36,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:52:36,902 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2018-11-28 18:52:36,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:36,965 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-28 18:52:36,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:52:36,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-28 18:52:36,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:36,977 INFO L225 Difference]: With dead ends: 40 [2018-11-28 18:52:36,977 INFO L226 Difference]: Without dead ends: 26 [2018-11-28 18:52:36,980 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,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-28 18:52:37,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-28 18:52:37,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 18:52:37,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-28 18:52:37,035 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2018-11-28 18:52:37,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:37,037 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-28 18:52:37,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:52:37,037 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-28 18:52:37,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 18:52:37,042 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:37,042 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:37,042 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:37,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:37,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1945633833, now seen corresponding path program 1 times [2018-11-28 18:52:37,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:37,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:37,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:37,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:37,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:37,419 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:37,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:52:37,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:52:37,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:52:37,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:52:37,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:52:37,427 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2018-11-28 18:52:37,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:37,539 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-28 18:52:37,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:52:37,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-28 18:52:37,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:37,541 INFO L225 Difference]: With dead ends: 44 [2018-11-28 18:52:37,541 INFO L226 Difference]: Without dead ends: 32 [2018-11-28 18:52:37,542 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:37,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-28 18:52:37,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-28 18:52:37,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 18:52:37,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-28 18:52:37,552 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2018-11-28 18:52:37,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:37,553 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-28 18:52:37,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:52:37,553 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-28 18:52:37,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 18:52:37,554 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:37,555 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:37,556 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:37,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:37,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1974262984, now seen corresponding path program 1 times [2018-11-28 18:52:37,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:37,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:37,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:37,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:37,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:37,928 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:37,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:52:37,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 18:52:37,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 18:52:37,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 18:52:37,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:52:37,930 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 8 states. [2018-11-28 18:52:38,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:38,019 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-28 18:52:38,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 18:52:38,022 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-28 18:52:38,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:38,023 INFO L225 Difference]: With dead ends: 36 [2018-11-28 18:52:38,024 INFO L226 Difference]: Without dead ends: 32 [2018-11-28 18:52:38,024 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:38,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-28 18:52:38,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-28 18:52:38,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 18:52:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-28 18:52:38,031 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2018-11-28 18:52:38,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:38,031 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-28 18:52:38,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 18:52:38,032 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-28 18:52:38,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 18:52:38,033 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:38,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:38,033 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:38,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:38,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1423155149, now seen corresponding path program 1 times [2018-11-28 18:52:38,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:38,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:38,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:38,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:38,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:38,299 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:38,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:52:38,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:52:38,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:52:38,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:52:38,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:52:38,302 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2018-11-28 18:52:38,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:38,338 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-28 18:52:38,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:52:38,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-28 18:52:38,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:38,342 INFO L225 Difference]: With dead ends: 48 [2018-11-28 18:52:38,342 INFO L226 Difference]: Without dead ends: 36 [2018-11-28 18:52:38,343 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:38,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-28 18:52:38,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-28 18:52:38,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 18:52:38,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-28 18:52:38,350 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-11-28 18:52:38,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:38,351 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-28 18:52:38,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:52:38,351 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-28 18:52:38,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 18:52:38,353 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:38,353 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:38,353 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:38,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:38,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1226641644, now seen corresponding path program 1 times [2018-11-28 18:52:38,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:38,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:38,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:38,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:38,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:38,509 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:38,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:52:38,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:52:38,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:52:38,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:52:38,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:52:38,513 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2018-11-28 18:52:38,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:38,536 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-28 18:52:38,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:52:38,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-28 18:52:38,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:38,539 INFO L225 Difference]: With dead ends: 40 [2018-11-28 18:52:38,539 INFO L226 Difference]: Without dead ends: 36 [2018-11-28 18:52:38,540 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:38,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-28 18:52:38,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-28 18:52:38,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 18:52:38,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-28 18:52:38,548 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-11-28 18:52:38,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:38,549 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-28 18:52:38,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:52:38,549 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-28 18:52:38,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 18:52:38,551 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:38,551 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:38,552 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:38,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:38,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1255270795, now seen corresponding path program 1 times [2018-11-28 18:52:38,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:38,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:38,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:38,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:38,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:39,327 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:39,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:52:39,328 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:39,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:39,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:52:39,463 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:39,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:52:39,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-28 18:52:39,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 18:52:39,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 18:52:39,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:52:39,486 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 12 states. [2018-11-28 18:52:39,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:39,741 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-28 18:52:39,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 18:52:39,742 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-28 18:52:39,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:39,743 INFO L225 Difference]: With dead ends: 56 [2018-11-28 18:52:39,743 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 18:52:39,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-11-28 18:52:39,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 18:52:39,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2018-11-28 18:52:39,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 18:52:39,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-28 18:52:39,751 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-11-28 18:52:39,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:39,752 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-28 18:52:39,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 18:52:39,752 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-28 18:52:39,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 18:52:39,753 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:39,754 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:39,754 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:39,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:39,754 INFO L82 PathProgramCache]: Analyzing trace with hash 906172561, now seen corresponding path program 1 times [2018-11-28 18:52:39,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:39,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:39,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:39,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:39,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:39,927 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:39,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:52:39,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:52:39,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:52:39,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:52:39,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:52:39,928 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2018-11-28 18:52:39,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:39,976 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-28 18:52:39,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:52:39,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-28 18:52:39,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:39,980 INFO L225 Difference]: With dead ends: 54 [2018-11-28 18:52:39,980 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 18:52:39,981 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:39,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 18:52:39,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-28 18:52:39,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 18:52:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-28 18:52:39,990 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 34 [2018-11-28 18:52:39,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:39,991 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-28 18:52:39,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:52:39,991 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-28 18:52:39,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 18:52:39,993 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:39,993 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:39,993 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:39,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:39,994 INFO L82 PathProgramCache]: Analyzing trace with hash 709659056, now seen corresponding path program 1 times [2018-11-28 18:52:39,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:39,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:39,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:39,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:39,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 18:52:40,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:52:40,353 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:40,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:40,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:52:40,564 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 18:52:40,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:52:40,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-28 18:52:40,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 18:52:40,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 18:52:40,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-11-28 18:52:40,585 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 15 states. [2018-11-28 18:52:41,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:41,189 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-11-28 18:52:41,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 18:52:41,193 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-11-28 18:52:41,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:41,194 INFO L225 Difference]: With dead ends: 72 [2018-11-28 18:52:41,194 INFO L226 Difference]: Without dead ends: 52 [2018-11-28 18:52:41,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-11-28 18:52:41,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-28 18:52:41,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2018-11-28 18:52:41,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 18:52:41,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-28 18:52:41,201 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 34 [2018-11-28 18:52:41,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:41,202 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-28 18:52:41,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 18:52:41,202 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-28 18:52:41,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 18:52:41,203 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:41,203 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:41,204 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:41,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:41,204 INFO L82 PathProgramCache]: Analyzing trace with hash -797786941, now seen corresponding path program 2 times [2018-11-28 18:52:41,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:41,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:41,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:41,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:41,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:41,771 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-11-28 18:52:41,775 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:41,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:52:41,776 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:41,793 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:52:41,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:52:41,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:52:41,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:52:41,976 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:41,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:52:41,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-28 18:52:41,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 18:52:41,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 18:52:41,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-11-28 18:52:41,997 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 18 states. [2018-11-28 18:52:42,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:42,362 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2018-11-28 18:52:42,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 18:52:42,363 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-11-28 18:52:42,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:42,365 INFO L225 Difference]: With dead ends: 80 [2018-11-28 18:52:42,365 INFO L226 Difference]: Without dead ends: 60 [2018-11-28 18:52:42,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-11-28 18:52:42,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-28 18:52:42,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 46. [2018-11-28 18:52:42,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 18:52:42,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-28 18:52:42,374 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 41 [2018-11-28 18:52:42,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:42,375 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-28 18:52:42,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 18:52:42,375 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-28 18:52:42,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 18:52:42,376 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:42,377 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:52:42,378 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:42,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:42,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1496626328, now seen corresponding path program 2 times [2018-11-28 18:52:42,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:42,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:42,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:42,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:52:42,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:42,794 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 18:52:42,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:52:42,795 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:52:42,812 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:52:42,826 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 18:52:42,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:52:42,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:52:43,027 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-28 18:52:43,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:52:43,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [20] total 23 [2018-11-28 18:52:43,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-28 18:52:43,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-28 18:52:43,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2018-11-28 18:52:43,047 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 23 states. [2018-11-28 18:52:43,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:43,380 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2018-11-28 18:52:43,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-28 18:52:43,381 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2018-11-28 18:52:43,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:43,382 INFO L225 Difference]: With dead ends: 88 [2018-11-28 18:52:43,382 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 18:52:43,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2018-11-28 18:52:43,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 18:52:43,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 18:52:43,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 18:52:43,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 18:52:43,386 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2018-11-28 18:52:43,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:43,387 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 18:52:43,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-28 18:52:43,388 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 18:52:43,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 18:52:43,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 18:52:43,413 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 18:52:43,414 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:52:43,414 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-28 18:52:43,414 INFO L451 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: true [2018-11-28 18:52:43,414 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-11-28 18:52:43,414 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2018-11-28 18:52:43,414 INFO L448 ceAbstractionStarter]: For program point id2EXIT(lines 14 19) no Hoare annotation was computed. [2018-11-28 18:52:43,414 INFO L451 ceAbstractionStarter]: At program point id2ENTRY(lines 14 19) the Hoare annotation is: true [2018-11-28 18:52:43,414 INFO L448 ceAbstractionStarter]: For program point id2FINAL(lines 14 19) no Hoare annotation was computed. [2018-11-28 18:52:43,414 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:52:43,414 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 18:52:43,415 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 18:52:43,415 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 18:52:43,415 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 21 27) the Hoare annotation is: true [2018-11-28 18:52:43,415 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-28 18:52:43,415 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 21 27) no Hoare annotation was computed. [2018-11-28 18:52:43,415 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-11-28 18:52:43,415 INFO L451 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: true [2018-11-28 18:52:43,415 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-11-28 18:52:43,415 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 21 27) no Hoare annotation was computed. [2018-11-28 18:52:43,415 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2018-11-28 18:52:43,415 INFO L448 ceAbstractionStarter]: For program point idFINAL(lines 7 12) no Hoare annotation was computed. [2018-11-28 18:52:43,415 INFO L448 ceAbstractionStarter]: For program point idEXIT(lines 7 12) no Hoare annotation was computed. [2018-11-28 18:52:43,415 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2018-11-28 18:52:43,419 INFO L451 ceAbstractionStarter]: At program point L9(line 9) the Hoare annotation is: true [2018-11-28 18:52:43,419 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2018-11-28 18:52:43,419 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2018-11-28 18:52:43,419 INFO L451 ceAbstractionStarter]: At program point idENTRY(lines 7 12) the Hoare annotation is: true [2018-11-28 18:52:43,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:52:43 BoogieIcfgContainer [2018-11-28 18:52:43,423 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:52:43,423 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:52:43,423 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:52:43,424 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:52:43,424 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:36" (3/4) ... [2018-11-28 18:52:43,428 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 18:52:43,434 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 18:52:43,434 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id2 [2018-11-28 18:52:43,435 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 18:52:43,435 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2018-11-28 18:52:43,440 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-28 18:52:43,440 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 18:52:43,440 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 18:52:43,488 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:52:43,488 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:52:43,489 INFO L168 Benchmark]: Toolchain (without parser) took 7868.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -130.7 MB). Peak memory consumption was 70.1 MB. Max. memory is 11.5 GB. [2018-11-28 18:52:43,491 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:52:43,491 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.76 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.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:43,491 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.78 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:52:43,492 INFO L168 Benchmark]: Boogie Preprocessor took 26.62 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:52:43,492 INFO L168 Benchmark]: RCFGBuilder took 456.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -176.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-28 18:52:43,494 INFO L168 Benchmark]: TraceAbstraction took 7017.52 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.4 MB). Peak memory consumption was 91.9 MB. Max. memory is 11.5 GB. [2018-11-28 18:52:43,495 INFO L168 Benchmark]: Witness Printer took 64.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:52:43,500 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 269.76 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.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 24.78 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.62 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 456.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -176.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7017.52 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.4 MB). Peak memory consumption was 91.9 MB. Max. memory is 11.5 GB. * Witness Printer took 64.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 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, 6.9s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 304 SDtfs, 38 SDslu, 2371 SDs, 0 SdLazy, 707 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 256 GetRequests, 154 SyntacticMatches, 6 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred 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.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 40 StatesRemovedByMinimization, 8 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, 4.1s InterpolantComputationTime, 441 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 427 ConstructedInterpolants, 0 QuantifiedInterpolants, 46409 SizeOfPredicates, 14 NumberOfNonLiveVariables, 270 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 105/165 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...