./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.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/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.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 fc492c809d432e4c3053fa8c39191c1c15ea4eea ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 16:10:29,509 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 16:10:29,511 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 16:10:29,523 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 16:10:29,524 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 16:10:29,525 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 16:10:29,527 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 16:10:29,529 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 16:10:29,531 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 16:10:29,532 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 16:10:29,533 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 16:10:29,534 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 16:10:29,535 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 16:10:29,536 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 16:10:29,538 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 16:10:29,539 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 16:10:29,539 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 16:10:29,542 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 16:10:29,544 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 16:10:29,546 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 16:10:29,548 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 16:10:29,549 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 16:10:29,552 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 16:10:29,553 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 16:10:29,553 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 16:10:29,554 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 16:10:29,555 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 16:10:29,556 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 16:10:29,557 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 16:10:29,559 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 16:10:29,559 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 16:10:29,560 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 16:10:29,560 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 16:10:29,561 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 16:10:29,562 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 16:10:29,563 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 16:10:29,564 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 16:10:29,583 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 16:10:29,583 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 16:10:29,584 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 16:10:29,585 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 16:10:29,585 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 16:10:29,585 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 16:10:29,586 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 16:10:29,588 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 16:10:29,588 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 16:10:29,589 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 16:10:29,589 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 16:10:29,589 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 16:10:29,589 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 16:10:29,589 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 16:10:29,590 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 16:10:29,593 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 16:10:29,593 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 16:10:29,593 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 16:10:29,593 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 16:10:29,594 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 16:10:29,594 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 16:10:29,594 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 16:10:29,594 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 16:10:29,594 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 16:10:29,594 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 16:10:29,596 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 16:10:29,596 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 16:10:29,596 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 16:10:29,596 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 16:10:29,596 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 16:10:29,597 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 -> fc492c809d432e4c3053fa8c39191c1c15ea4eea [2018-11-28 16:10:29,636 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 16:10:29,650 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 16:10:29,654 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 16:10:29,656 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 16:10:29,656 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 16:10:29,658 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 16:10:29,717 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c228f9309/a76f0cb741564396a99323ce649db19b/FLAG43364458c [2018-11-28 16:10:30,266 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 16:10:30,267 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 16:10:30,275 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c228f9309/a76f0cb741564396a99323ce649db19b/FLAG43364458c [2018-11-28 16:10:30,604 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c228f9309/a76f0cb741564396a99323ce649db19b [2018-11-28 16:10:30,608 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 16:10:30,612 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 16:10:30,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 16:10:30,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 16:10:30,618 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 16:10:30,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:10:30" (1/1) ... [2018-11-28 16:10:30,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75f345ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:30, skipping insertion in model container [2018-11-28 16:10:30,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:10:30" (1/1) ... [2018-11-28 16:10:30,630 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 16:10:30,657 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 16:10:30,883 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:10:30,889 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 16:10:30,923 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:10:30,942 INFO L195 MainTranslator]: Completed translation [2018-11-28 16:10:30,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:30 WrapperNode [2018-11-28 16:10:30,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 16:10:30,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 16:10:30,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 16:10:30,944 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 16:10:30,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:30" (1/1) ... [2018-11-28 16:10:30,963 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:30" (1/1) ... [2018-11-28 16:10:30,972 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 16:10:30,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 16:10:30,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 16:10:30,973 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 16:10:30,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:30" (1/1) ... [2018-11-28 16:10:30,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:30" (1/1) ... [2018-11-28 16:10:30,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:30" (1/1) ... [2018-11-28 16:10:30,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:30" (1/1) ... [2018-11-28 16:10:30,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:30" (1/1) ... [2018-11-28 16:10:31,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:30" (1/1) ... [2018-11-28 16:10:31,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:30" (1/1) ... [2018-11-28 16:10:31,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 16:10:31,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 16:10:31,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 16:10:31,021 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 16:10:31,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:30" (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 16:10:31,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 16:10:31,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 16:10:31,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 16:10:31,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 16:10:31,173 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 16:10:31,173 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 16:10:31,681 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 16:10:31,681 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 16:10:31,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:10:31 BoogieIcfgContainer [2018-11-28 16:10:31,682 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 16:10:31,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 16:10:31,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 16:10:31,688 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 16:10:31,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:10:30" (1/3) ... [2018-11-28 16:10:31,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f65a943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:10:31, skipping insertion in model container [2018-11-28 16:10:31,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:30" (2/3) ... [2018-11-28 16:10:31,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f65a943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:10:31, skipping insertion in model container [2018-11-28 16:10:31,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:10:31" (3/3) ... [2018-11-28 16:10:31,697 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 16:10:31,706 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 16:10:31,714 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 16:10:31,728 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 16:10:31,759 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 16:10:31,760 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 16:10:31,760 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 16:10:31,761 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 16:10:31,762 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 16:10:31,762 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 16:10:31,762 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 16:10:31,762 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 16:10:31,762 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 16:10:31,782 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-28 16:10:31,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 16:10:31,794 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:31,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:31,798 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:31,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:31,804 INFO L82 PathProgramCache]: Analyzing trace with hash 429652513, now seen corresponding path program 1 times [2018-11-28 16:10:31,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:31,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:31,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:31,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:31,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:32,029 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 16:10:32,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:32,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:32,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:32,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:32,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:32,052 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-11-28 16:10:32,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:32,134 INFO L93 Difference]: Finished difference Result 63 states and 102 transitions. [2018-11-28 16:10:32,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:32,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-28 16:10:32,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:32,146 INFO L225 Difference]: With dead ends: 63 [2018-11-28 16:10:32,146 INFO L226 Difference]: Without dead ends: 48 [2018-11-28 16:10:32,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:32,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-28 16:10:32,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2018-11-28 16:10:32,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 16:10:32,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-11-28 16:10:32,188 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 16 [2018-11-28 16:10:32,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:32,189 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-11-28 16:10:32,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:32,189 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-11-28 16:10:32,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 16:10:32,191 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:32,191 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:32,191 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:32,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:32,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1109710883, now seen corresponding path program 1 times [2018-11-28 16:10:32,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:32,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:32,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:32,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:32,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:32,261 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 16:10:32,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:32,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:32,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:32,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:32,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:32,267 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-11-28 16:10:32,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:32,341 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2018-11-28 16:10:32,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:32,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-28 16:10:32,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:32,343 INFO L225 Difference]: With dead ends: 77 [2018-11-28 16:10:32,343 INFO L226 Difference]: Without dead ends: 48 [2018-11-28 16:10:32,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:32,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-28 16:10:32,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-28 16:10:32,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 16:10:32,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2018-11-28 16:10:32,356 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 16 [2018-11-28 16:10:32,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:32,356 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2018-11-28 16:10:32,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:32,357 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2018-11-28 16:10:32,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 16:10:32,357 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:32,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:32,358 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:32,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:32,359 INFO L82 PathProgramCache]: Analyzing trace with hash 434540691, now seen corresponding path program 1 times [2018-11-28 16:10:32,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:32,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:32,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:32,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:32,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:32,427 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 16:10:32,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:32,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:32,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:32,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:32,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:32,428 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand 3 states. [2018-11-28 16:10:32,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:32,488 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2018-11-28 16:10:32,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:32,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-28 16:10:32,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:32,490 INFO L225 Difference]: With dead ends: 72 [2018-11-28 16:10:32,490 INFO L226 Difference]: Without dead ends: 51 [2018-11-28 16:10:32,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:32,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-28 16:10:32,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-11-28 16:10:32,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 16:10:32,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2018-11-28 16:10:32,499 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 17 [2018-11-28 16:10:32,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:32,500 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 79 transitions. [2018-11-28 16:10:32,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:32,500 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2018-11-28 16:10:32,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 16:10:32,501 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:32,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:32,501 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:32,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:32,502 INFO L82 PathProgramCache]: Analyzing trace with hash 41513681, now seen corresponding path program 1 times [2018-11-28 16:10:32,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:32,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:32,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:32,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:32,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:32,549 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 16:10:32,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:32,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:32,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:32,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:32,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:32,551 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. Second operand 3 states. [2018-11-28 16:10:32,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:32,605 INFO L93 Difference]: Finished difference Result 88 states and 144 transitions. [2018-11-28 16:10:32,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:32,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-28 16:10:32,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:32,607 INFO L225 Difference]: With dead ends: 88 [2018-11-28 16:10:32,608 INFO L226 Difference]: Without dead ends: 86 [2018-11-28 16:10:32,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:32,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-28 16:10:32,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2018-11-28 16:10:32,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-28 16:10:32,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2018-11-28 16:10:32,619 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 17 [2018-11-28 16:10:32,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:32,619 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2018-11-28 16:10:32,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:32,620 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2018-11-28 16:10:32,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 16:10:32,621 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:32,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:32,621 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:32,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:32,622 INFO L82 PathProgramCache]: Analyzing trace with hash 721572051, now seen corresponding path program 1 times [2018-11-28 16:10:32,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:32,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:32,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:32,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:32,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:32,689 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 16:10:32,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:32,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:32,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:32,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:32,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:32,690 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 3 states. [2018-11-28 16:10:32,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:32,761 INFO L93 Difference]: Finished difference Result 144 states and 238 transitions. [2018-11-28 16:10:32,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:32,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-28 16:10:32,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:32,763 INFO L225 Difference]: With dead ends: 144 [2018-11-28 16:10:32,763 INFO L226 Difference]: Without dead ends: 88 [2018-11-28 16:10:32,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:32,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-28 16:10:32,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-11-28 16:10:32,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-28 16:10:32,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2018-11-28 16:10:32,774 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 138 transitions. Word has length 17 [2018-11-28 16:10:32,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:32,774 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 138 transitions. [2018-11-28 16:10:32,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:32,774 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2018-11-28 16:10:32,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 16:10:32,775 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:32,776 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:32,776 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:32,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:32,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1287139128, now seen corresponding path program 1 times [2018-11-28 16:10:32,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:32,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:32,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:32,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:32,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:32,848 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 16:10:32,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:32,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:32,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:32,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:32,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:32,849 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. Second operand 3 states. [2018-11-28 16:10:32,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:32,885 INFO L93 Difference]: Finished difference Result 129 states and 205 transitions. [2018-11-28 16:10:32,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:32,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-28 16:10:32,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:32,887 INFO L225 Difference]: With dead ends: 129 [2018-11-28 16:10:32,887 INFO L226 Difference]: Without dead ends: 90 [2018-11-28 16:10:32,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:32,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-28 16:10:32,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-11-28 16:10:32,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-28 16:10:32,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2018-11-28 16:10:32,900 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 18 [2018-11-28 16:10:32,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:32,900 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2018-11-28 16:10:32,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:32,900 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2018-11-28 16:10:32,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 16:10:32,901 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:32,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:32,902 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:32,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:32,902 INFO L82 PathProgramCache]: Analyzing trace with hash 894112118, now seen corresponding path program 1 times [2018-11-28 16:10:32,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:32,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:32,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:32,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:32,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:32,941 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 16:10:32,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:32,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:32,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:32,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:32,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:32,943 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand 3 states. [2018-11-28 16:10:33,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:33,015 INFO L93 Difference]: Finished difference Result 156 states and 248 transitions. [2018-11-28 16:10:33,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:33,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-28 16:10:33,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:33,017 INFO L225 Difference]: With dead ends: 156 [2018-11-28 16:10:33,017 INFO L226 Difference]: Without dead ends: 154 [2018-11-28 16:10:33,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:33,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-28 16:10:33,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2018-11-28 16:10:33,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-28 16:10:33,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2018-11-28 16:10:33,031 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 18 [2018-11-28 16:10:33,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:33,031 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2018-11-28 16:10:33,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:33,031 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2018-11-28 16:10:33,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 16:10:33,033 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:33,033 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:33,033 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:33,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:33,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1574170488, now seen corresponding path program 1 times [2018-11-28 16:10:33,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:33,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:33,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:33,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:33,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:33,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 16:10:33,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:33,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:33,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:33,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:33,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:33,105 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand 3 states. [2018-11-28 16:10:33,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:33,208 INFO L93 Difference]: Finished difference Result 272 states and 424 transitions. [2018-11-28 16:10:33,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:33,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-28 16:10:33,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:33,210 INFO L225 Difference]: With dead ends: 272 [2018-11-28 16:10:33,210 INFO L226 Difference]: Without dead ends: 162 [2018-11-28 16:10:33,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:33,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-28 16:10:33,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-11-28 16:10:33,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-28 16:10:33,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 242 transitions. [2018-11-28 16:10:33,226 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 242 transitions. Word has length 18 [2018-11-28 16:10:33,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:33,226 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 242 transitions. [2018-11-28 16:10:33,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:33,227 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 242 transitions. [2018-11-28 16:10:33,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 16:10:33,228 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:33,228 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:33,229 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:33,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:33,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1947887240, now seen corresponding path program 1 times [2018-11-28 16:10:33,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:33,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:33,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:33,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:33,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:33,259 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 16:10:33,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:33,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:33,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:33,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:33,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:33,261 INFO L87 Difference]: Start difference. First operand 160 states and 242 transitions. Second operand 3 states. [2018-11-28 16:10:33,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:33,310 INFO L93 Difference]: Finished difference Result 240 states and 360 transitions. [2018-11-28 16:10:33,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:33,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-28 16:10:33,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:33,315 INFO L225 Difference]: With dead ends: 240 [2018-11-28 16:10:33,315 INFO L226 Difference]: Without dead ends: 166 [2018-11-28 16:10:33,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:33,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-28 16:10:33,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2018-11-28 16:10:33,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-28 16:10:33,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 242 transitions. [2018-11-28 16:10:33,328 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 242 transitions. Word has length 19 [2018-11-28 16:10:33,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:33,328 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 242 transitions. [2018-11-28 16:10:33,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:33,329 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2018-11-28 16:10:33,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 16:10:33,330 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:33,330 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:33,331 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:33,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:33,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1554860230, now seen corresponding path program 1 times [2018-11-28 16:10:33,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:33,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:33,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:33,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:33,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:33,374 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 16:10:33,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:33,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:33,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:33,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:33,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:33,375 INFO L87 Difference]: Start difference. First operand 164 states and 242 transitions. Second operand 3 states. [2018-11-28 16:10:33,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:33,412 INFO L93 Difference]: Finished difference Result 284 states and 424 transitions. [2018-11-28 16:10:33,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:33,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-28 16:10:33,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:33,416 INFO L225 Difference]: With dead ends: 284 [2018-11-28 16:10:33,416 INFO L226 Difference]: Without dead ends: 282 [2018-11-28 16:10:33,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:33,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-28 16:10:33,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2018-11-28 16:10:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-28 16:10:33,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 334 transitions. [2018-11-28 16:10:33,433 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 334 transitions. Word has length 19 [2018-11-28 16:10:33,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:33,434 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 334 transitions. [2018-11-28 16:10:33,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:33,434 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 334 transitions. [2018-11-28 16:10:33,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 16:10:33,437 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:33,437 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:33,438 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:33,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:33,438 INFO L82 PathProgramCache]: Analyzing trace with hash -2060048696, now seen corresponding path program 1 times [2018-11-28 16:10:33,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:33,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:33,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:33,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:33,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:33,493 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 16:10:33,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:33,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:33,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:33,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:33,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:33,495 INFO L87 Difference]: Start difference. First operand 232 states and 334 transitions. Second operand 3 states. [2018-11-28 16:10:33,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:33,543 INFO L93 Difference]: Finished difference Result 524 states and 752 transitions. [2018-11-28 16:10:33,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:33,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-28 16:10:33,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:33,546 INFO L225 Difference]: With dead ends: 524 [2018-11-28 16:10:33,546 INFO L226 Difference]: Without dead ends: 306 [2018-11-28 16:10:33,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:33,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-11-28 16:10:33,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2018-11-28 16:10:33,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-11-28 16:10:33,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2018-11-28 16:10:33,565 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 19 [2018-11-28 16:10:33,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:33,565 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2018-11-28 16:10:33,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:33,566 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2018-11-28 16:10:33,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 16:10:33,568 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:33,568 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 16:10:33,569 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:33,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:33,569 INFO L82 PathProgramCache]: Analyzing trace with hash 956242573, now seen corresponding path program 1 times [2018-11-28 16:10:33,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:33,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:33,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:33,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:33,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:33,626 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 16:10:33,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:33,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:33,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:33,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:33,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:33,629 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand 3 states. [2018-11-28 16:10:33,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:33,680 INFO L93 Difference]: Finished difference Result 456 states and 628 transitions. [2018-11-28 16:10:33,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:33,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 16:10:33,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:33,683 INFO L225 Difference]: With dead ends: 456 [2018-11-28 16:10:33,683 INFO L226 Difference]: Without dead ends: 314 [2018-11-28 16:10:33,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:33,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-11-28 16:10:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2018-11-28 16:10:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-11-28 16:10:33,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 422 transitions. [2018-11-28 16:10:33,699 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 422 transitions. Word has length 20 [2018-11-28 16:10:33,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:33,699 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 422 transitions. [2018-11-28 16:10:33,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:33,700 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 422 transitions. [2018-11-28 16:10:33,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 16:10:33,701 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:33,702 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 16:10:33,702 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:33,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:33,702 INFO L82 PathProgramCache]: Analyzing trace with hash 563215563, now seen corresponding path program 1 times [2018-11-28 16:10:33,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:33,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:33,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:33,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:33,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:33,770 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 16:10:33,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:33,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:33,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:33,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:33,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:33,772 INFO L87 Difference]: Start difference. First operand 312 states and 422 transitions. Second operand 3 states. [2018-11-28 16:10:33,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:33,870 INFO L93 Difference]: Finished difference Result 524 states and 712 transitions. [2018-11-28 16:10:33,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:33,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 16:10:33,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:33,873 INFO L225 Difference]: With dead ends: 524 [2018-11-28 16:10:33,873 INFO L226 Difference]: Without dead ends: 522 [2018-11-28 16:10:33,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:33,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-11-28 16:10:33,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 456. [2018-11-28 16:10:33,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-11-28 16:10:33,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2018-11-28 16:10:33,894 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 20 [2018-11-28 16:10:33,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:33,894 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2018-11-28 16:10:33,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:33,894 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2018-11-28 16:10:33,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 16:10:33,896 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:33,896 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 16:10:33,896 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:33,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:33,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1243273933, now seen corresponding path program 1 times [2018-11-28 16:10:33,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:33,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:33,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:33,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:33,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:33,932 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 16:10:33,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:33,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:33,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:33,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:33,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:33,933 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 3 states. [2018-11-28 16:10:34,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:34,011 INFO L93 Difference]: Finished difference Result 1020 states and 1320 transitions. [2018-11-28 16:10:34,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:34,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 16:10:34,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:34,015 INFO L225 Difference]: With dead ends: 1020 [2018-11-28 16:10:34,015 INFO L226 Difference]: Without dead ends: 586 [2018-11-28 16:10:34,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:34,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2018-11-28 16:10:34,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2018-11-28 16:10:34,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-11-28 16:10:34,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 726 transitions. [2018-11-28 16:10:34,045 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 726 transitions. Word has length 20 [2018-11-28 16:10:34,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:34,046 INFO L480 AbstractCegarLoop]: Abstraction has 584 states and 726 transitions. [2018-11-28 16:10:34,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:34,046 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 726 transitions. [2018-11-28 16:10:34,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 16:10:34,048 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:34,048 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, 1] [2018-11-28 16:10:34,048 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:34,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:34,048 INFO L82 PathProgramCache]: Analyzing trace with hash 280029309, now seen corresponding path program 1 times [2018-11-28 16:10:34,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:34,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:34,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:34,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:34,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:34,112 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 16:10:34,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:34,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:34,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:34,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:34,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:34,114 INFO L87 Difference]: Start difference. First operand 584 states and 726 transitions. Second operand 3 states. [2018-11-28 16:10:34,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:34,188 INFO L93 Difference]: Finished difference Result 876 states and 1080 transitions. [2018-11-28 16:10:34,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:34,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 16:10:34,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:34,192 INFO L225 Difference]: With dead ends: 876 [2018-11-28 16:10:34,192 INFO L226 Difference]: Without dead ends: 602 [2018-11-28 16:10:34,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:34,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-11-28 16:10:34,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2018-11-28 16:10:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-11-28 16:10:34,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 726 transitions. [2018-11-28 16:10:34,226 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 726 transitions. Word has length 21 [2018-11-28 16:10:34,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:34,227 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 726 transitions. [2018-11-28 16:10:34,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:34,227 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 726 transitions. [2018-11-28 16:10:34,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 16:10:34,228 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:34,229 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, 1] [2018-11-28 16:10:34,229 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:34,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:34,229 INFO L82 PathProgramCache]: Analyzing trace with hash -112997701, now seen corresponding path program 1 times [2018-11-28 16:10:34,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:34,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:34,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:34,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:34,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:34,317 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 16:10:34,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:34,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:34,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:34,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:34,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:34,322 INFO L87 Difference]: Start difference. First operand 600 states and 726 transitions. Second operand 3 states. [2018-11-28 16:10:34,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:34,439 INFO L93 Difference]: Finished difference Result 970 states and 1159 transitions. [2018-11-28 16:10:34,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:34,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 16:10:34,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:34,445 INFO L225 Difference]: With dead ends: 970 [2018-11-28 16:10:34,445 INFO L226 Difference]: Without dead ends: 968 [2018-11-28 16:10:34,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:34,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2018-11-28 16:10:34,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 904. [2018-11-28 16:10:34,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-11-28 16:10:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1062 transitions. [2018-11-28 16:10:34,486 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1062 transitions. Word has length 21 [2018-11-28 16:10:34,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:34,486 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1062 transitions. [2018-11-28 16:10:34,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:34,486 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1062 transitions. [2018-11-28 16:10:34,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 16:10:34,488 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:34,489 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, 1] [2018-11-28 16:10:34,489 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:34,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:34,489 INFO L82 PathProgramCache]: Analyzing trace with hash 567060669, now seen corresponding path program 1 times [2018-11-28 16:10:34,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:34,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:34,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:34,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:34,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:34,559 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 16:10:34,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:34,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:34,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:34,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:34,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:34,561 INFO L87 Difference]: Start difference. First operand 904 states and 1062 transitions. Second operand 3 states. [2018-11-28 16:10:34,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:34,700 INFO L93 Difference]: Finished difference Result 1992 states and 2278 transitions. [2018-11-28 16:10:34,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:34,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 16:10:34,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:34,701 INFO L225 Difference]: With dead ends: 1992 [2018-11-28 16:10:34,701 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 16:10:34,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:34,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 16:10:34,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 16:10:34,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 16:10:34,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 16:10:34,706 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-28 16:10:34,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:34,706 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 16:10:34,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:34,706 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 16:10:34,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 16:10:34,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 16:10:34,835 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 16:10:34,835 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:10:34,835 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:10:34,836 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 16:10:34,836 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 16:10:34,836 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 16:10:34,836 INFO L448 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-11-28 16:10:34,836 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 107) no Hoare annotation was computed. [2018-11-28 16:10:34,836 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2018-11-28 16:10:34,836 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-11-28 16:10:34,836 INFO L451 ceAbstractionStarter]: At program point L103(lines 5 107) the Hoare annotation is: true [2018-11-28 16:10:34,837 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2018-11-28 16:10:34,837 INFO L448 ceAbstractionStarter]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2018-11-28 16:10:34,837 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2018-11-28 16:10:34,837 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2018-11-28 16:10:34,837 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-11-28 16:10:34,837 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 107) no Hoare annotation was computed. [2018-11-28 16:10:34,837 INFO L448 ceAbstractionStarter]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2018-11-28 16:10:34,837 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2018-11-28 16:10:34,838 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-28 16:10:34,838 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2018-11-28 16:10:34,838 INFO L451 ceAbstractionStarter]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2018-11-28 16:10:34,838 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-28 16:10:34,838 INFO L448 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2018-11-28 16:10:34,838 INFO L444 ceAbstractionStarter]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2018-11-28 16:10:34,838 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2018-11-28 16:10:34,838 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2018-11-28 16:10:34,839 INFO L448 ceAbstractionStarter]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2018-11-28 16:10:34,839 INFO L448 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2018-11-28 16:10:34,839 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2018-11-28 16:10:34,839 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2018-11-28 16:10:34,839 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2018-11-28 16:10:34,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:10:34 BoogieIcfgContainer [2018-11-28 16:10:34,850 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 16:10:34,850 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 16:10:34,850 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 16:10:34,851 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 16:10:34,851 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:10:31" (3/4) ... [2018-11-28 16:10:34,856 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 16:10:34,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 16:10:34,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 16:10:34,879 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 16:10:34,879 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 16:10:34,880 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 16:10:34,956 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 16:10:34,956 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 16:10:34,957 INFO L168 Benchmark]: Toolchain (without parser) took 4348.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 951.3 MB in the beginning and 855.9 MB in the end (delta: 95.4 MB). Peak memory consumption was 188.7 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:34,959 INFO L168 Benchmark]: CDTParser took 0.20 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 16:10:34,959 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.72 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 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 16:10:34,960 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.11 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 16:10:34,960 INFO L168 Benchmark]: Boogie Preprocessor took 48.35 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 16:10:34,960 INFO L168 Benchmark]: RCFGBuilder took 661.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -123.0 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:34,961 INFO L168 Benchmark]: TraceAbstraction took 3166.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 862.8 MB in the end (delta: 200.7 MB). Peak memory consumption was 200.7 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:34,962 INFO L168 Benchmark]: Witness Printer took 105.63 ms. Allocated memory is still 1.1 GB. Free memory was 862.8 MB in the beginning and 855.9 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:34,965 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.72 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 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 28.11 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 48.35 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 661.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -123.0 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3166.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 862.8 MB in the end (delta: 200.7 MB). Peak memory consumption was 200.7 MB. Max. memory is 11.5 GB. * Witness Printer took 105.63 ms. Allocated memory is still 1.1 GB. Free memory was 862.8 MB in the beginning and 855.9 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. SAFE Result, 3.0s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 923 SDtfs, 417 SDslu, 612 SDs, 0 SdLazy, 91 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=16, 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.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 270 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 74 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 9690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...