./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/locks/test_locks_10_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_10_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 0f7b0b589689413087c164ce10eb80c902ee4046 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:14,527 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 16:10:14,531 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 16:10:14,548 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 16:10:14,550 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 16:10:14,552 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 16:10:14,555 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 16:10:14,559 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 16:10:14,562 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 16:10:14,564 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 16:10:14,566 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 16:10:14,567 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 16:10:14,568 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 16:10:14,571 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 16:10:14,578 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 16:10:14,580 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 16:10:14,582 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 16:10:14,585 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 16:10:14,588 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 16:10:14,592 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 16:10:14,593 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 16:10:14,597 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 16:10:14,600 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 16:10:14,601 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 16:10:14,601 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 16:10:14,602 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 16:10:14,604 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 16:10:14,607 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 16:10:14,609 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 16:10:14,610 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 16:10:14,611 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 16:10:14,612 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 16:10:14,612 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 16:10:14,612 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 16:10:14,615 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 16:10:14,617 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 16:10:14,618 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:14,649 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 16:10:14,650 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 16:10:14,650 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 16:10:14,651 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 16:10:14,651 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 16:10:14,651 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 16:10:14,651 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 16:10:14,656 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 16:10:14,656 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 16:10:14,656 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 16:10:14,656 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 16:10:14,657 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 16:10:14,657 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 16:10:14,657 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 16:10:14,657 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 16:10:14,658 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 16:10:14,658 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 16:10:14,659 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 16:10:14,659 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 16:10:14,659 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 16:10:14,659 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 16:10:14,659 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 16:10:14,659 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 16:10:14,660 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 16:10:14,662 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 16:10:14,662 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 16:10:14,662 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 16:10:14,662 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 16:10:14,663 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 16:10:14,663 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 16:10:14,663 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 -> 0f7b0b589689413087c164ce10eb80c902ee4046 [2018-11-28 16:10:14,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 16:10:14,738 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 16:10:14,741 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 16:10:14,743 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 16:10:14,743 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 16:10:14,744 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 16:10:14,803 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bb844941/f26db204ae424c31901b0a90c5cb98c1/FLAG3117c8d0a [2018-11-28 16:10:15,263 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 16:10:15,264 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 16:10:15,272 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bb844941/f26db204ae424c31901b0a90c5cb98c1/FLAG3117c8d0a [2018-11-28 16:10:15,591 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bb844941/f26db204ae424c31901b0a90c5cb98c1 [2018-11-28 16:10:15,596 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 16:10:15,598 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 16:10:15,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 16:10:15,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 16:10:15,604 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 16:10:15,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:10:15" (1/1) ... [2018-11-28 16:10:15,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5af40c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:15, skipping insertion in model container [2018-11-28 16:10:15,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:10:15" (1/1) ... [2018-11-28 16:10:15,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 16:10:15,649 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 16:10:15,899 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:10:15,905 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 16:10:15,945 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:10:15,963 INFO L195 MainTranslator]: Completed translation [2018-11-28 16:10:15,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:15 WrapperNode [2018-11-28 16:10:15,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 16:10:15,964 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 16:10:15,965 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 16:10:15,965 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 16:10:15,974 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:15" (1/1) ... [2018-11-28 16:10:15,981 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:15" (1/1) ... [2018-11-28 16:10:15,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 16:10:15,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 16:10:15,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 16:10:15,990 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 16:10:16,001 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:15" (1/1) ... [2018-11-28 16:10:16,001 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:15" (1/1) ... [2018-11-28 16:10:16,002 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:15" (1/1) ... [2018-11-28 16:10:16,003 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:15" (1/1) ... [2018-11-28 16:10:16,013 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:15" (1/1) ... [2018-11-28 16:10:16,026 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:15" (1/1) ... [2018-11-28 16:10:16,027 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:15" (1/1) ... [2018-11-28 16:10:16,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 16:10:16,039 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 16:10:16,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 16:10:16,039 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 16:10:16,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:15" (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:16,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 16:10:16,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 16:10:16,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 16:10:16,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 16:10:16,202 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 16:10:16,202 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 16:10:16,754 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 16:10:16,754 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 16:10:16,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:10:16 BoogieIcfgContainer [2018-11-28 16:10:16,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 16:10:16,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 16:10:16,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 16:10:16,760 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 16:10:16,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:10:15" (1/3) ... [2018-11-28 16:10:16,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71896456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:10:16, skipping insertion in model container [2018-11-28 16:10:16,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:15" (2/3) ... [2018-11-28 16:10:16,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71896456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:10:16, skipping insertion in model container [2018-11-28 16:10:16,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:10:16" (3/3) ... [2018-11-28 16:10:16,765 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 16:10:16,776 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 16:10:16,785 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 16:10:16,805 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 16:10:16,839 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 16:10:16,840 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 16:10:16,841 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 16:10:16,841 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 16:10:16,841 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 16:10:16,842 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 16:10:16,842 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 16:10:16,842 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 16:10:16,842 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 16:10:16,864 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-28 16:10:16,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 16:10:16,872 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:16,873 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:16,876 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:16,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:16,883 INFO L82 PathProgramCache]: Analyzing trace with hash -917347053, now seen corresponding path program 1 times [2018-11-28 16:10:16,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:16,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:16,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:16,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:16,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:17,094 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:17,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:17,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:17,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:17,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:17,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:17,123 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2018-11-28 16:10:17,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:17,219 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2018-11-28 16:10:17,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:17,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 16:10:17,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:17,236 INFO L225 Difference]: With dead ends: 87 [2018-11-28 16:10:17,236 INFO L226 Difference]: Without dead ends: 72 [2018-11-28 16:10:17,241 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:17,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-28 16:10:17,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2018-11-28 16:10:17,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-28 16:10:17,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 89 transitions. [2018-11-28 16:10:17,290 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 89 transitions. Word has length 20 [2018-11-28 16:10:17,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:17,291 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 89 transitions. [2018-11-28 16:10:17,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:17,291 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 89 transitions. [2018-11-28 16:10:17,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 16:10:17,292 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:17,293 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:17,293 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:17,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:17,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1504153067, now seen corresponding path program 1 times [2018-11-28 16:10:17,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:17,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:17,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:17,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:17,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:17,365 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:17,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:17,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:17,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:17,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:17,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:17,368 INFO L87 Difference]: Start difference. First operand 50 states and 89 transitions. Second operand 3 states. [2018-11-28 16:10:17,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:17,434 INFO L93 Difference]: Finished difference Result 117 states and 212 transitions. [2018-11-28 16:10:17,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:17,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 16:10:17,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:17,438 INFO L225 Difference]: With dead ends: 117 [2018-11-28 16:10:17,438 INFO L226 Difference]: Without dead ends: 72 [2018-11-28 16:10:17,441 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:17,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-28 16:10:17,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-11-28 16:10:17,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-28 16:10:17,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 125 transitions. [2018-11-28 16:10:17,454 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 125 transitions. Word has length 20 [2018-11-28 16:10:17,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:17,454 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 125 transitions. [2018-11-28 16:10:17,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:17,455 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 125 transitions. [2018-11-28 16:10:17,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 16:10:17,456 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:17,456 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:17,456 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:17,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:17,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225809, now seen corresponding path program 1 times [2018-11-28 16:10:17,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:17,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:17,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:17,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:17,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:17,550 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:17,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:17,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:17,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:17,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:17,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:17,553 INFO L87 Difference]: Start difference. First operand 70 states and 125 transitions. Second operand 3 states. [2018-11-28 16:10:17,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:17,636 INFO L93 Difference]: Finished difference Result 108 states and 189 transitions. [2018-11-28 16:10:17,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:17,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 16:10:17,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:17,639 INFO L225 Difference]: With dead ends: 108 [2018-11-28 16:10:17,639 INFO L226 Difference]: Without dead ends: 75 [2018-11-28 16:10:17,640 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:17,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-28 16:10:17,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-11-28 16:10:17,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-28 16:10:17,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2018-11-28 16:10:17,649 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2018-11-28 16:10:17,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:17,650 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2018-11-28 16:10:17,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:17,650 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2018-11-28 16:10:17,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 16:10:17,654 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:17,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:17,654 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:17,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:17,655 INFO L82 PathProgramCache]: Analyzing trace with hash 616108559, now seen corresponding path program 1 times [2018-11-28 16:10:17,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:17,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:17,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:17,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:17,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:17,736 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:17,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:17,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:17,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:17,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:17,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:17,739 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 3 states. [2018-11-28 16:10:17,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:17,827 INFO L93 Difference]: Finished difference Result 136 states and 240 transitions. [2018-11-28 16:10:17,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:17,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 16:10:17,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:17,829 INFO L225 Difference]: With dead ends: 136 [2018-11-28 16:10:17,830 INFO L226 Difference]: Without dead ends: 134 [2018-11-28 16:10:17,830 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:17,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-28 16:10:17,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2018-11-28 16:10:17,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 16:10:17,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 168 transitions. [2018-11-28 16:10:17,849 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 168 transitions. Word has length 21 [2018-11-28 16:10:17,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:17,851 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 168 transitions. [2018-11-28 16:10:17,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:17,851 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2018-11-28 16:10:17,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 16:10:17,853 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:17,854 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:17,854 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:17,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:17,854 INFO L82 PathProgramCache]: Analyzing trace with hash 29302545, now seen corresponding path program 1 times [2018-11-28 16:10:17,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:17,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:17,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:17,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:17,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:17,897 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:17,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:17,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:17,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:17,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:17,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:17,899 INFO L87 Difference]: Start difference. First operand 96 states and 168 transitions. Second operand 3 states. [2018-11-28 16:10:17,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:17,996 INFO L93 Difference]: Finished difference Result 224 states and 398 transitions. [2018-11-28 16:10:17,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:17,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 16:10:17,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:17,998 INFO L225 Difference]: With dead ends: 224 [2018-11-28 16:10:17,999 INFO L226 Difference]: Without dead ends: 136 [2018-11-28 16:10:18,000 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:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-28 16:10:18,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-11-28 16:10:18,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-28 16:10:18,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 234 transitions. [2018-11-28 16:10:18,019 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 234 transitions. Word has length 21 [2018-11-28 16:10:18,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:18,020 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 234 transitions. [2018-11-28 16:10:18,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:18,020 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 234 transitions. [2018-11-28 16:10:18,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 16:10:18,024 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:18,024 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, 1] [2018-11-28 16:10:18,025 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:18,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:18,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1919709866, now seen corresponding path program 1 times [2018-11-28 16:10:18,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:18,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:18,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:18,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:18,128 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:18,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:18,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:18,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:18,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:18,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:18,130 INFO L87 Difference]: Start difference. First operand 134 states and 234 transitions. Second operand 3 states. [2018-11-28 16:10:18,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:18,155 INFO L93 Difference]: Finished difference Result 201 states and 349 transitions. [2018-11-28 16:10:18,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:18,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 16:10:18,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:18,157 INFO L225 Difference]: With dead ends: 201 [2018-11-28 16:10:18,157 INFO L226 Difference]: Without dead ends: 138 [2018-11-28 16:10:18,158 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:18,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-28 16:10:18,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-11-28 16:10:18,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-28 16:10:18,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 234 transitions. [2018-11-28 16:10:18,182 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 234 transitions. Word has length 22 [2018-11-28 16:10:18,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:18,183 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 234 transitions. [2018-11-28 16:10:18,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2018-11-28 16:10:18,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 16:10:18,185 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:18,186 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, 1] [2018-11-28 16:10:18,186 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:18,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:18,186 INFO L82 PathProgramCache]: Analyzing trace with hash 908592616, now seen corresponding path program 1 times [2018-11-28 16:10:18,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:18,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:18,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:18,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:18,239 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:18,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:18,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:18,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:18,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:18,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:18,241 INFO L87 Difference]: Start difference. First operand 136 states and 234 transitions. Second operand 3 states. [2018-11-28 16:10:18,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:18,296 INFO L93 Difference]: Finished difference Result 252 states and 440 transitions. [2018-11-28 16:10:18,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:18,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 16:10:18,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:18,300 INFO L225 Difference]: With dead ends: 252 [2018-11-28 16:10:18,300 INFO L226 Difference]: Without dead ends: 250 [2018-11-28 16:10:18,302 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:18,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-28 16:10:18,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2018-11-28 16:10:18,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-28 16:10:18,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 314 transitions. [2018-11-28 16:10:18,327 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 314 transitions. Word has length 22 [2018-11-28 16:10:18,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:18,328 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 314 transitions. [2018-11-28 16:10:18,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:18,328 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 314 transitions. [2018-11-28 16:10:18,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 16:10:18,331 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:18,331 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, 1] [2018-11-28 16:10:18,331 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:18,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:18,332 INFO L82 PathProgramCache]: Analyzing trace with hash 321786602, now seen corresponding path program 1 times [2018-11-28 16:10:18,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:18,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:18,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:18,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:18,408 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:18,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:18,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:18,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:18,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:18,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:18,410 INFO L87 Difference]: Start difference. First operand 184 states and 314 transitions. Second operand 3 states. [2018-11-28 16:10:18,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:18,517 INFO L93 Difference]: Finished difference Result 432 states and 744 transitions. [2018-11-28 16:10:18,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:18,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 16:10:18,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:18,520 INFO L225 Difference]: With dead ends: 432 [2018-11-28 16:10:18,520 INFO L226 Difference]: Without dead ends: 258 [2018-11-28 16:10:18,522 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:18,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-28 16:10:18,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-11-28 16:10:18,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-28 16:10:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 434 transitions. [2018-11-28 16:10:18,537 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 434 transitions. Word has length 22 [2018-11-28 16:10:18,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:18,537 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 434 transitions. [2018-11-28 16:10:18,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:18,539 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 434 transitions. [2018-11-28 16:10:18,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 16:10:18,541 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:18,541 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, 1, 1] [2018-11-28 16:10:18,542 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:18,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:18,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1898185914, now seen corresponding path program 1 times [2018-11-28 16:10:18,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:18,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:18,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:18,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:18,602 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:18,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:18,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:18,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:18,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:18,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:18,604 INFO L87 Difference]: Start difference. First operand 256 states and 434 transitions. Second operand 3 states. [2018-11-28 16:10:18,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:18,681 INFO L93 Difference]: Finished difference Result 384 states and 648 transitions. [2018-11-28 16:10:18,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:18,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 16:10:18,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:18,684 INFO L225 Difference]: With dead ends: 384 [2018-11-28 16:10:18,684 INFO L226 Difference]: Without dead ends: 262 [2018-11-28 16:10:18,685 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:18,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-11-28 16:10:18,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-11-28 16:10:18,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-28 16:10:18,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2018-11-28 16:10:18,697 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 23 [2018-11-28 16:10:18,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:18,697 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2018-11-28 16:10:18,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:18,698 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2018-11-28 16:10:18,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 16:10:18,699 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:18,699 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, 1, 1] [2018-11-28 16:10:18,699 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:18,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:18,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1385664132, now seen corresponding path program 1 times [2018-11-28 16:10:18,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:18,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:18,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:18,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:18,752 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:18,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:18,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:18,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:18,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:18,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:18,754 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand 3 states. [2018-11-28 16:10:18,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:18,791 INFO L93 Difference]: Finished difference Result 476 states and 808 transitions. [2018-11-28 16:10:18,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:18,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 16:10:18,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:18,798 INFO L225 Difference]: With dead ends: 476 [2018-11-28 16:10:18,798 INFO L226 Difference]: Without dead ends: 474 [2018-11-28 16:10:18,801 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:18,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-11-28 16:10:18,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 360. [2018-11-28 16:10:18,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-11-28 16:10:18,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 590 transitions. [2018-11-28 16:10:18,815 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 590 transitions. Word has length 23 [2018-11-28 16:10:18,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:18,816 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 590 transitions. [2018-11-28 16:10:18,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:18,816 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 590 transitions. [2018-11-28 16:10:18,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 16:10:18,818 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:18,818 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, 1, 1] [2018-11-28 16:10:18,818 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:18,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:18,819 INFO L82 PathProgramCache]: Analyzing trace with hash 798858118, now seen corresponding path program 1 times [2018-11-28 16:10:18,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:18,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:18,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:18,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:18,902 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:18,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:18,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:18,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:18,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:18,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:18,906 INFO L87 Difference]: Start difference. First operand 360 states and 590 transitions. Second operand 3 states. [2018-11-28 16:10:18,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:18,986 INFO L93 Difference]: Finished difference Result 844 states and 1392 transitions. [2018-11-28 16:10:18,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:18,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 16:10:18,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:18,993 INFO L225 Difference]: With dead ends: 844 [2018-11-28 16:10:18,994 INFO L226 Difference]: Without dead ends: 498 [2018-11-28 16:10:18,995 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:18,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-11-28 16:10:19,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2018-11-28 16:10:19,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-11-28 16:10:19,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 806 transitions. [2018-11-28 16:10:19,024 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 806 transitions. Word has length 23 [2018-11-28 16:10:19,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:19,024 INFO L480 AbstractCegarLoop]: Abstraction has 496 states and 806 transitions. [2018-11-28 16:10:19,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:19,025 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 806 transitions. [2018-11-28 16:10:19,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 16:10:19,031 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:19,031 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, 1, 1, 1] [2018-11-28 16:10:19,031 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:19,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:19,033 INFO L82 PathProgramCache]: Analyzing trace with hash 6129535, now seen corresponding path program 1 times [2018-11-28 16:10:19,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:19,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:19,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:19,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:19,116 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:19,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:19,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:19,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:19,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:19,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:19,121 INFO L87 Difference]: Start difference. First operand 496 states and 806 transitions. Second operand 3 states. [2018-11-28 16:10:19,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:19,231 INFO L93 Difference]: Finished difference Result 744 states and 1204 transitions. [2018-11-28 16:10:19,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:19,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 16:10:19,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:19,237 INFO L225 Difference]: With dead ends: 744 [2018-11-28 16:10:19,237 INFO L226 Difference]: Without dead ends: 506 [2018-11-28 16:10:19,238 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:19,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-11-28 16:10:19,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2018-11-28 16:10:19,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-11-28 16:10:19,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 806 transitions. [2018-11-28 16:10:19,263 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 806 transitions. Word has length 24 [2018-11-28 16:10:19,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:19,263 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 806 transitions. [2018-11-28 16:10:19,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:19,265 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 806 transitions. [2018-11-28 16:10:19,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 16:10:19,266 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:19,267 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, 1, 1, 1] [2018-11-28 16:10:19,268 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:19,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:19,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1004987715, now seen corresponding path program 1 times [2018-11-28 16:10:19,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:19,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:19,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:19,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:19,359 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:19,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:19,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:19,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:19,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:19,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:19,362 INFO L87 Difference]: Start difference. First operand 504 states and 806 transitions. Second operand 3 states. [2018-11-28 16:10:19,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:19,481 INFO L93 Difference]: Finished difference Result 908 states and 1480 transitions. [2018-11-28 16:10:19,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:19,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 16:10:19,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:19,489 INFO L225 Difference]: With dead ends: 908 [2018-11-28 16:10:19,489 INFO L226 Difference]: Without dead ends: 906 [2018-11-28 16:10:19,490 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:19,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2018-11-28 16:10:19,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 712. [2018-11-28 16:10:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2018-11-28 16:10:19,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1110 transitions. [2018-11-28 16:10:19,524 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1110 transitions. Word has length 24 [2018-11-28 16:10:19,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:19,525 INFO L480 AbstractCegarLoop]: Abstraction has 712 states and 1110 transitions. [2018-11-28 16:10:19,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:19,525 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1110 transitions. [2018-11-28 16:10:19,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 16:10:19,527 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:19,527 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, 1, 1, 1] [2018-11-28 16:10:19,527 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:19,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:19,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1591793729, now seen corresponding path program 1 times [2018-11-28 16:10:19,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:19,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:19,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:19,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:19,611 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:19,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:19,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:19,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:19,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:19,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:19,613 INFO L87 Difference]: Start difference. First operand 712 states and 1110 transitions. Second operand 3 states. [2018-11-28 16:10:19,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:19,743 INFO L93 Difference]: Finished difference Result 1660 states and 2600 transitions. [2018-11-28 16:10:19,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:19,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 16:10:19,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:19,753 INFO L225 Difference]: With dead ends: 1660 [2018-11-28 16:10:19,755 INFO L226 Difference]: Without dead ends: 970 [2018-11-28 16:10:19,758 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:19,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2018-11-28 16:10:19,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2018-11-28 16:10:19,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2018-11-28 16:10:19,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1494 transitions. [2018-11-28 16:10:19,801 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1494 transitions. Word has length 24 [2018-11-28 16:10:19,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:19,801 INFO L480 AbstractCegarLoop]: Abstraction has 968 states and 1494 transitions. [2018-11-28 16:10:19,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:19,801 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1494 transitions. [2018-11-28 16:10:19,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 16:10:19,804 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:19,805 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, 1, 1, 1, 1] [2018-11-28 16:10:19,805 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:19,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:19,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1089633349, now seen corresponding path program 1 times [2018-11-28 16:10:19,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:19,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:19,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:19,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:19,880 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:19,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:19,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:19,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:19,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:19,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:19,882 INFO L87 Difference]: Start difference. First operand 968 states and 1494 transitions. Second operand 3 states. [2018-11-28 16:10:20,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:20,002 INFO L93 Difference]: Finished difference Result 1452 states and 2232 transitions. [2018-11-28 16:10:20,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:20,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 16:10:20,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:20,010 INFO L225 Difference]: With dead ends: 1452 [2018-11-28 16:10:20,011 INFO L226 Difference]: Without dead ends: 986 [2018-11-28 16:10:20,013 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:20,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2018-11-28 16:10:20,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2018-11-28 16:10:20,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2018-11-28 16:10:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1494 transitions. [2018-11-28 16:10:20,057 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1494 transitions. Word has length 25 [2018-11-28 16:10:20,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:20,058 INFO L480 AbstractCegarLoop]: Abstraction has 984 states and 1494 transitions. [2018-11-28 16:10:20,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:20,058 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1494 transitions. [2018-11-28 16:10:20,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 16:10:20,062 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:20,062 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, 1, 1, 1, 1] [2018-11-28 16:10:20,063 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:20,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:20,064 INFO L82 PathProgramCache]: Analyzing trace with hash -2100750599, now seen corresponding path program 1 times [2018-11-28 16:10:20,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:20,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:20,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:20,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:20,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:20,148 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:20,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:20,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:20,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:20,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:20,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:20,150 INFO L87 Difference]: Start difference. First operand 984 states and 1494 transitions. Second operand 3 states. [2018-11-28 16:10:20,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:20,284 INFO L93 Difference]: Finished difference Result 1740 states and 2696 transitions. [2018-11-28 16:10:20,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:20,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 16:10:20,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:20,296 INFO L225 Difference]: With dead ends: 1740 [2018-11-28 16:10:20,296 INFO L226 Difference]: Without dead ends: 1738 [2018-11-28 16:10:20,297 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:20,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-11-28 16:10:20,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1416. [2018-11-28 16:10:20,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2018-11-28 16:10:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2086 transitions. [2018-11-28 16:10:20,362 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2086 transitions. Word has length 25 [2018-11-28 16:10:20,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:20,363 INFO L480 AbstractCegarLoop]: Abstraction has 1416 states and 2086 transitions. [2018-11-28 16:10:20,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:20,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2086 transitions. [2018-11-28 16:10:20,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 16:10:20,369 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:20,369 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, 1, 1, 1, 1] [2018-11-28 16:10:20,370 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:20,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:20,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1607410683, now seen corresponding path program 1 times [2018-11-28 16:10:20,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:20,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:20,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:20,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:20,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:20,442 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:20,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:20,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:20,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:20,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:20,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:20,444 INFO L87 Difference]: Start difference. First operand 1416 states and 2086 transitions. Second operand 3 states. [2018-11-28 16:10:20,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:20,602 INFO L93 Difference]: Finished difference Result 3276 states and 4840 transitions. [2018-11-28 16:10:20,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:20,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 16:10:20,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:20,613 INFO L225 Difference]: With dead ends: 3276 [2018-11-28 16:10:20,613 INFO L226 Difference]: Without dead ends: 1898 [2018-11-28 16:10:20,616 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:20,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2018-11-28 16:10:20,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2018-11-28 16:10:20,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2018-11-28 16:10:20,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2758 transitions. [2018-11-28 16:10:20,695 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2758 transitions. Word has length 25 [2018-11-28 16:10:20,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:20,695 INFO L480 AbstractCegarLoop]: Abstraction has 1896 states and 2758 transitions. [2018-11-28 16:10:20,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:20,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2758 transitions. [2018-11-28 16:10:20,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 16:10:20,701 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:20,701 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, 1, 1, 1, 1, 1] [2018-11-28 16:10:20,702 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:20,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:20,702 INFO L82 PathProgramCache]: Analyzing trace with hash -698544044, now seen corresponding path program 1 times [2018-11-28 16:10:20,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:20,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:20,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:20,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:20,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:20,779 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:20,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:20,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:20,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:20,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:20,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:20,781 INFO L87 Difference]: Start difference. First operand 1896 states and 2758 transitions. Second operand 3 states. [2018-11-28 16:10:20,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:20,910 INFO L93 Difference]: Finished difference Result 2844 states and 4120 transitions. [2018-11-28 16:10:20,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:20,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 16:10:20,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:20,920 INFO L225 Difference]: With dead ends: 2844 [2018-11-28 16:10:20,920 INFO L226 Difference]: Without dead ends: 1930 [2018-11-28 16:10:20,923 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:20,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-11-28 16:10:20,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2018-11-28 16:10:20,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-11-28 16:10:21,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2758 transitions. [2018-11-28 16:10:21,005 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2758 transitions. Word has length 26 [2018-11-28 16:10:21,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:21,005 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 2758 transitions. [2018-11-28 16:10:21,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:21,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2758 transitions. [2018-11-28 16:10:21,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 16:10:21,008 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:21,008 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, 1, 1, 1, 1, 1] [2018-11-28 16:10:21,009 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:21,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:21,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1709661294, now seen corresponding path program 1 times [2018-11-28 16:10:21,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:21,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:21,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:21,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:21,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:21,077 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:21,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:21,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:21,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:21,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:21,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:21,079 INFO L87 Difference]: Start difference. First operand 1928 states and 2758 transitions. Second operand 3 states. [2018-11-28 16:10:21,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:21,269 INFO L93 Difference]: Finished difference Result 3340 states and 4872 transitions. [2018-11-28 16:10:21,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:21,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 16:10:21,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:21,286 INFO L225 Difference]: With dead ends: 3340 [2018-11-28 16:10:21,286 INFO L226 Difference]: Without dead ends: 3338 [2018-11-28 16:10:21,288 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:21,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2018-11-28 16:10:21,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2824. [2018-11-28 16:10:21,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2018-11-28 16:10:21,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3910 transitions. [2018-11-28 16:10:21,381 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3910 transitions. Word has length 26 [2018-11-28 16:10:21,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:21,381 INFO L480 AbstractCegarLoop]: Abstraction has 2824 states and 3910 transitions. [2018-11-28 16:10:21,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:21,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3910 transitions. [2018-11-28 16:10:21,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 16:10:21,388 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:21,388 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, 1, 1, 1, 1, 1] [2018-11-28 16:10:21,388 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:21,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:21,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1998499988, now seen corresponding path program 1 times [2018-11-28 16:10:21,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:21,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:21,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:21,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:21,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:21,457 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:21,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:21,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:21,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:21,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:21,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:21,459 INFO L87 Difference]: Start difference. First operand 2824 states and 3910 transitions. Second operand 3 states. [2018-11-28 16:10:21,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:21,630 INFO L93 Difference]: Finished difference Result 6476 states and 8968 transitions. [2018-11-28 16:10:21,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:21,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 16:10:21,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:21,649 INFO L225 Difference]: With dead ends: 6476 [2018-11-28 16:10:21,649 INFO L226 Difference]: Without dead ends: 3722 [2018-11-28 16:10:21,655 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:21,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2018-11-28 16:10:21,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2018-11-28 16:10:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2018-11-28 16:10:21,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5062 transitions. [2018-11-28 16:10:21,792 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5062 transitions. Word has length 26 [2018-11-28 16:10:21,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:21,792 INFO L480 AbstractCegarLoop]: Abstraction has 3720 states and 5062 transitions. [2018-11-28 16:10:21,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:21,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5062 transitions. [2018-11-28 16:10:21,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 16:10:21,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:21,800 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, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:21,800 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:21,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:21,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1459677136, now seen corresponding path program 1 times [2018-11-28 16:10:21,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:21,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:21,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:21,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:21,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:21,868 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:21,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:21,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:21,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:21,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:21,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:21,871 INFO L87 Difference]: Start difference. First operand 3720 states and 5062 transitions. Second operand 3 states. [2018-11-28 16:10:22,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:22,029 INFO L93 Difference]: Finished difference Result 5580 states and 7560 transitions. [2018-11-28 16:10:22,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:22,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 16:10:22,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:22,047 INFO L225 Difference]: With dead ends: 5580 [2018-11-28 16:10:22,047 INFO L226 Difference]: Without dead ends: 3786 [2018-11-28 16:10:22,052 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:22,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2018-11-28 16:10:22,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2018-11-28 16:10:22,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2018-11-28 16:10:22,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5062 transitions. [2018-11-28 16:10:22,187 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5062 transitions. Word has length 27 [2018-11-28 16:10:22,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:22,188 INFO L480 AbstractCegarLoop]: Abstraction has 3784 states and 5062 transitions. [2018-11-28 16:10:22,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:22,188 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5062 transitions. [2018-11-28 16:10:22,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 16:10:22,195 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:22,195 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, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:22,195 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:22,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:22,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1824172910, now seen corresponding path program 1 times [2018-11-28 16:10:22,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:22,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:22,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:22,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:22,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:22,275 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:22,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:22,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:22,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:22,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:22,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:22,276 INFO L87 Difference]: Start difference. First operand 3784 states and 5062 transitions. Second operand 3 states. [2018-11-28 16:10:22,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:22,515 INFO L93 Difference]: Finished difference Result 10956 states and 14408 transitions. [2018-11-28 16:10:22,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:22,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 16:10:22,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:22,551 INFO L225 Difference]: With dead ends: 10956 [2018-11-28 16:10:22,551 INFO L226 Difference]: Without dead ends: 7306 [2018-11-28 16:10:22,560 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:22,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2018-11-28 16:10:22,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7304. [2018-11-28 16:10:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2018-11-28 16:10:22,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9350 transitions. [2018-11-28 16:10:22,790 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9350 transitions. Word has length 27 [2018-11-28 16:10:22,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:22,790 INFO L480 AbstractCegarLoop]: Abstraction has 7304 states and 9350 transitions. [2018-11-28 16:10:22,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:22,790 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9350 transitions. [2018-11-28 16:10:22,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 16:10:22,801 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:22,801 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, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:22,801 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:22,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:22,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1883988372, now seen corresponding path program 1 times [2018-11-28 16:10:22,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:22,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:22,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:22,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:22,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:22,867 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:22,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:22,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:22,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:22,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:22,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:22,868 INFO L87 Difference]: Start difference. First operand 7304 states and 9350 transitions. Second operand 3 states. [2018-11-28 16:10:23,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:23,150 INFO L93 Difference]: Finished difference Result 8076 states and 10632 transitions. [2018-11-28 16:10:23,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:23,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 16:10:23,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:23,169 INFO L225 Difference]: With dead ends: 8076 [2018-11-28 16:10:23,170 INFO L226 Difference]: Without dead ends: 8074 [2018-11-28 16:10:23,174 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:23,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2018-11-28 16:10:23,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 7304. [2018-11-28 16:10:23,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2018-11-28 16:10:23,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9222 transitions. [2018-11-28 16:10:23,442 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9222 transitions. Word has length 27 [2018-11-28 16:10:23,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:23,443 INFO L480 AbstractCegarLoop]: Abstraction has 7304 states and 9222 transitions. [2018-11-28 16:10:23,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:23,443 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9222 transitions. [2018-11-28 16:10:23,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 16:10:23,454 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:23,454 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:23,454 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:23,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:23,454 INFO L82 PathProgramCache]: Analyzing trace with hash 715001129, now seen corresponding path program 1 times [2018-11-28 16:10:23,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:23,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:23,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:23,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:23,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:23,521 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:23,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:23,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:23,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:23,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:23,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:23,523 INFO L87 Difference]: Start difference. First operand 7304 states and 9222 transitions. Second operand 3 states. [2018-11-28 16:10:23,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:23,835 INFO L93 Difference]: Finished difference Result 12172 states and 15496 transitions. [2018-11-28 16:10:23,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:23,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 16:10:23,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:23,860 INFO L225 Difference]: With dead ends: 12172 [2018-11-28 16:10:23,861 INFO L226 Difference]: Without dead ends: 12170 [2018-11-28 16:10:23,867 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:23,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2018-11-28 16:10:24,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11144. [2018-11-28 16:10:24,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2018-11-28 16:10:24,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 13702 transitions. [2018-11-28 16:10:24,167 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 13702 transitions. Word has length 28 [2018-11-28 16:10:24,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:24,169 INFO L480 AbstractCegarLoop]: Abstraction has 11144 states and 13702 transitions. [2018-11-28 16:10:24,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:24,169 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 13702 transitions. [2018-11-28 16:10:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 16:10:24,188 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:24,189 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:24,189 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:24,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:24,189 INFO L82 PathProgramCache]: Analyzing trace with hash 128195115, now seen corresponding path program 1 times [2018-11-28 16:10:24,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:24,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:24,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:24,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:24,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:24,263 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:24,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:24,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:24,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:24,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:24,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:24,267 INFO L87 Difference]: Start difference. First operand 11144 states and 13702 transitions. Second operand 3 states. [2018-11-28 16:10:24,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:24,698 INFO L93 Difference]: Finished difference Result 25228 states and 30856 transitions. [2018-11-28 16:10:24,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:24,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 16:10:24,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:24,735 INFO L225 Difference]: With dead ends: 25228 [2018-11-28 16:10:24,736 INFO L226 Difference]: Without dead ends: 14218 [2018-11-28 16:10:24,760 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:24,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2018-11-28 16:10:25,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 14216. [2018-11-28 16:10:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2018-11-28 16:10:25,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 16902 transitions. [2018-11-28 16:10:25,324 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 16902 transitions. Word has length 28 [2018-11-28 16:10:25,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:25,324 INFO L480 AbstractCegarLoop]: Abstraction has 14216 states and 16902 transitions. [2018-11-28 16:10:25,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:25,324 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 16902 transitions. [2018-11-28 16:10:25,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 16:10:25,345 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:25,345 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:25,345 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:25,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:25,346 INFO L82 PathProgramCache]: Analyzing trace with hash 690414627, now seen corresponding path program 1 times [2018-11-28 16:10:25,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:25,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:25,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:25,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:25,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:25,414 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:25,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:25,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:25,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:25,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:25,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:25,419 INFO L87 Difference]: Start difference. First operand 14216 states and 16902 transitions. Second operand 3 states. [2018-11-28 16:10:25,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:25,770 INFO L93 Difference]: Finished difference Result 21516 states and 25608 transitions. [2018-11-28 16:10:25,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:25,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 16:10:25,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:25,799 INFO L225 Difference]: With dead ends: 21516 [2018-11-28 16:10:25,799 INFO L226 Difference]: Without dead ends: 14602 [2018-11-28 16:10:25,816 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:25,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2018-11-28 16:10:26,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14600. [2018-11-28 16:10:26,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2018-11-28 16:10:26,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 17158 transitions. [2018-11-28 16:10:26,198 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 17158 transitions. Word has length 29 [2018-11-28 16:10:26,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:26,198 INFO L480 AbstractCegarLoop]: Abstraction has 14600 states and 17158 transitions. [2018-11-28 16:10:26,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:26,199 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 17158 transitions. [2018-11-28 16:10:26,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 16:10:26,219 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:26,219 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:26,219 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:26,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:26,219 INFO L82 PathProgramCache]: Analyzing trace with hash -320702623, now seen corresponding path program 1 times [2018-11-28 16:10:26,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:26,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:26,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:26,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:26,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:26,285 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:26,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:26,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:26,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:26,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:26,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:26,286 INFO L87 Difference]: Start difference. First operand 14600 states and 17158 transitions. Second operand 3 states. [2018-11-28 16:10:26,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:26,805 INFO L93 Difference]: Finished difference Result 23562 states and 27399 transitions. [2018-11-28 16:10:26,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:26,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 16:10:26,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:26,848 INFO L225 Difference]: With dead ends: 23562 [2018-11-28 16:10:26,848 INFO L226 Difference]: Without dead ends: 23560 [2018-11-28 16:10:26,854 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:26,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23560 states. [2018-11-28 16:10:27,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23560 to 22536. [2018-11-28 16:10:27,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22536 states. [2018-11-28 16:10:27,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22536 states to 22536 states and 25862 transitions. [2018-11-28 16:10:27,352 INFO L78 Accepts]: Start accepts. Automaton has 22536 states and 25862 transitions. Word has length 29 [2018-11-28 16:10:27,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:27,352 INFO L480 AbstractCegarLoop]: Abstraction has 22536 states and 25862 transitions. [2018-11-28 16:10:27,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:27,354 INFO L276 IsEmpty]: Start isEmpty. Operand 22536 states and 25862 transitions. [2018-11-28 16:10:27,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 16:10:27,385 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:27,386 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:27,386 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:27,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:27,386 INFO L82 PathProgramCache]: Analyzing trace with hash -907508637, now seen corresponding path program 1 times [2018-11-28 16:10:27,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:27,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:27,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:27,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:27,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:27,456 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:27,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:27,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:27,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:27,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:27,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:27,457 INFO L87 Difference]: Start difference. First operand 22536 states and 25862 transitions. Second operand 3 states. [2018-11-28 16:10:27,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:27,946 INFO L93 Difference]: Finished difference Result 50184 states and 56582 transitions. [2018-11-28 16:10:27,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:27,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 16:10:27,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:27,948 INFO L225 Difference]: With dead ends: 50184 [2018-11-28 16:10:27,948 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 16:10:28,007 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:28,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 16:10:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 16:10:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 16:10:28,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 16:10:28,009 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-11-28 16:10:28,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:28,009 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 16:10:28,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:28,009 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 16:10:28,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 16:10:28,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 16:10:28,133 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 16:10:28,133 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:10:28,133 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:10:28,133 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 16:10:28,133 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 16:10:28,133 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 16:10:28,133 INFO L451 ceAbstractionStarter]: At program point L159(lines 5 163) the Hoare annotation is: true [2018-11-28 16:10:28,133 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2018-11-28 16:10:28,134 INFO L448 ceAbstractionStarter]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 16:10:28,134 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 16:10:28,134 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 16:10:28,134 INFO L448 ceAbstractionStarter]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 16:10:28,134 INFO L448 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2018-11-28 16:10:28,134 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 16:10:28,134 INFO L448 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-11-28 16:10:28,134 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 16:10:28,134 INFO L448 ceAbstractionStarter]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 16:10:28,134 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 16:10:28,135 INFO L451 ceAbstractionStarter]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2018-11-28 16:10:28,140 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2018-11-28 16:10:28,140 INFO L448 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-11-28 16:10:28,141 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2018-11-28 16:10:28,141 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-28 16:10:28,141 INFO L444 ceAbstractionStarter]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2018-11-28 16:10:28,141 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2018-11-28 16:10:28,141 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 16:10:28,141 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 16:10:28,141 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-11-28 16:10:28,141 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-28 16:10:28,142 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 16:10:28,142 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 16:10:28,142 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 16:10:28,142 INFO L448 ceAbstractionStarter]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 16:10:28,142 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 16:10:28,142 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2018-11-28 16:10:28,142 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 16:10:28,142 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-11-28 16:10:28,142 INFO L448 ceAbstractionStarter]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2018-11-28 16:10:28,142 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-28 16:10:28,142 INFO L448 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2018-11-28 16:10:28,146 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 16:10:28,146 INFO L448 ceAbstractionStarter]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 16:10:28,146 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-28 16:10:28,146 INFO L448 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2018-11-28 16:10:28,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:10:28 BoogieIcfgContainer [2018-11-28 16:10:28,161 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 16:10:28,162 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 16:10:28,162 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 16:10:28,162 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 16:10:28,165 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:16" (3/4) ... [2018-11-28 16:10:28,170 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 16:10:28,179 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 16:10:28,180 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 16:10:28,189 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 16:10:28,191 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 16:10:28,192 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 16:10:28,299 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 16:10:28,305 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 16:10:28,307 INFO L168 Benchmark]: Toolchain (without parser) took 12710.02 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 513.3 MB). Free memory was 948.7 MB in the beginning and 962.3 MB in the end (delta: -13.6 MB). Peak memory consumption was 499.7 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:28,308 INFO L168 Benchmark]: CDTParser took 0.15 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:28,309 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.34 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 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:28,310 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.28 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:10:28,310 INFO L168 Benchmark]: Boogie Preprocessor took 48.60 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:28,310 INFO L168 Benchmark]: RCFGBuilder took 715.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -179.9 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:28,312 INFO L168 Benchmark]: TraceAbstraction took 11405.17 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 369.6 MB). Free memory was 1.1 GB in the beginning and 977.6 MB in the end (delta: 134.9 MB). Peak memory consumption was 504.5 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:28,313 INFO L168 Benchmark]: Witness Printer took 144.01 ms. Allocated memory is still 1.5 GB. Free memory was 977.6 MB in the beginning and 962.3 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:28,316 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.15 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 364.34 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 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 25.28 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.60 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 715.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -179.9 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11405.17 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 369.6 MB). Free memory was 1.1 GB in the beginning and 977.6 MB in the end (delta: 134.9 MB). Peak memory consumption was 504.5 MB. Max. memory is 11.5 GB. * Witness Printer took 144.01 ms. Allocated memory is still 1.5 GB. Free memory was 977.6 MB in the beginning and 962.3 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: 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: 39]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 1 error locations. SAFE Result, 11.3s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 2384 SDtfs, 1153 SDslu, 1624 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22536occurred in iteration=27, 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: 3.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 1034 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 659 ConstructedInterpolants, 0 QuantifiedInterpolants, 31265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...