java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:24:37,765 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:24:37,767 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:24:37,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:24:37,779 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:24:37,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:24:37,782 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:24:37,783 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:24:37,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:24:37,786 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:24:37,787 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:24:37,788 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:24:37,788 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:24:37,789 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:24:37,790 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:24:37,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:24:37,792 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:24:37,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:24:37,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:24:37,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:24:37,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:24:37,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:24:37,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:24:37,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:24:37,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:24:37,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:24:37,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:24:37,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:24:37,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:24:37,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:24:37,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:24:37,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:24:37,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:24:37,808 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:24:37,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:24:37,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:24:37,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:24:37,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:24:37,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:24:37,812 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:24:37,814 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:24:37,815 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 11:24:37,837 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:24:37,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:24:37,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:24:37,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:24:37,840 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:24:37,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:24:37,841 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:24:37,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:24:37,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:24:37,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:24:37,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:24:37,843 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:24:37,843 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:24:37,843 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:24:37,843 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:24:37,844 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:24:37,844 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:24:37,844 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:24:37,844 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:24:37,844 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:24:37,845 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:24:37,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:24:37,845 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:24:37,845 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:24:37,846 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:24:37,846 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:24:37,846 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:24:37,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:24:37,846 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:24:37,897 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:24:37,908 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:24:37,912 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:24:37,913 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:24:37,914 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:24:37,914 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:24:37,975 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd73c6f43/4407b3310a694809802d6f218070505e/FLAG5356ba243 [2019-09-08 11:24:38,568 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:24:38,569 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:24:38,584 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd73c6f43/4407b3310a694809802d6f218070505e/FLAG5356ba243 [2019-09-08 11:24:38,899 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd73c6f43/4407b3310a694809802d6f218070505e [2019-09-08 11:24:38,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:24:38,913 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:24:38,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:24:38,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:24:38,917 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:24:38,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:24:38" (1/1) ... [2019-09-08 11:24:38,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16572f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:24:38, skipping insertion in model container [2019-09-08 11:24:38,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:24:38" (1/1) ... [2019-09-08 11:24:38,926 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:24:38,993 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:24:39,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:24:39,453 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:24:39,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:24:39,642 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:24:39,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:24:39 WrapperNode [2019-09-08 11:24:39,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:24:39,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:24:39,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:24:39,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:24:39,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:24:39" (1/1) ... [2019-09-08 11:24:39,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:24:39" (1/1) ... [2019-09-08 11:24:39,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:24:39" (1/1) ... [2019-09-08 11:24:39,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:24:39" (1/1) ... [2019-09-08 11:24:39,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:24:39" (1/1) ... [2019-09-08 11:24:39,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:24:39" (1/1) ... [2019-09-08 11:24:39,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:24:39" (1/1) ... [2019-09-08 11:24:39,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:24:39,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:24:39,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:24:39,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:24:39,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:24:39" (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 [2019-09-08 11:24:39,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:24:39,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:24:39,828 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:24:39,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:24:39,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:24:39,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:24:39,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 11:24:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:24:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:24:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:24:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:24:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:24:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:24:39,833 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:24:39,834 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:24:39,834 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:24:39,837 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 11:24:39,837 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:24:39,837 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:24:39,838 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:24:39,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:24:39,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:24:41,218 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:24:41,218 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:24:41,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:24:41 BoogieIcfgContainer [2019-09-08 11:24:41,220 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:24:41,221 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:24:41,221 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:24:41,224 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:24:41,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:24:38" (1/3) ... [2019-09-08 11:24:41,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224f3793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:24:41, skipping insertion in model container [2019-09-08 11:24:41,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:24:39" (2/3) ... [2019-09-08 11:24:41,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224f3793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:24:41, skipping insertion in model container [2019-09-08 11:24:41,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:24:41" (3/3) ... [2019-09-08 11:24:41,229 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:24:41,238 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:24:41,248 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:24:41,266 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:24:41,307 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:24:41,308 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:24:41,308 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:24:41,308 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:24:41,308 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:24:41,308 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:24:41,309 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:24:41,309 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:24:41,309 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:24:41,330 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-09-08 11:24:41,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:24:41,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:24:41,344 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:24:41,345 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:24:41,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:24:41,350 INFO L82 PathProgramCache]: Analyzing trace with hash 491419825, now seen corresponding path program 1 times [2019-09-08 11:24:41,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:24:41,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:24:41,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:41,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:24:41,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:24:41,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:24:41,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:24:41,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:24:41,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:24:41,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:24:41,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:24:41,892 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 3 states. [2019-09-08 11:24:42,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:24:42,088 INFO L93 Difference]: Finished difference Result 509 states and 838 transitions. [2019-09-08 11:24:42,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:24:42,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 11:24:42,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:24:42,120 INFO L225 Difference]: With dead ends: 509 [2019-09-08 11:24:42,120 INFO L226 Difference]: Without dead ends: 385 [2019-09-08 11:24:42,128 INFO L628 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 [2019-09-08 11:24:42,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-09-08 11:24:42,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2019-09-08 11:24:42,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-09-08 11:24:42,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 573 transitions. [2019-09-08 11:24:42,218 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 573 transitions. Word has length 99 [2019-09-08 11:24:42,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:24:42,220 INFO L475 AbstractCegarLoop]: Abstraction has 383 states and 573 transitions. [2019-09-08 11:24:42,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:24:42,220 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 573 transitions. [2019-09-08 11:24:42,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 11:24:42,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:24:42,225 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:24:42,226 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:24:42,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:24:42,226 INFO L82 PathProgramCache]: Analyzing trace with hash 2023971141, now seen corresponding path program 1 times [2019-09-08 11:24:42,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:24:42,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:24:42,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:42,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:24:42,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:24:42,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:24:42,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:24:42,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:24:42,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:24:42,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:24:42,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:24:42,732 INFO L87 Difference]: Start difference. First operand 383 states and 573 transitions. Second operand 8 states. [2019-09-08 11:24:43,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:24:43,320 INFO L93 Difference]: Finished difference Result 1898 states and 2951 transitions. [2019-09-08 11:24:43,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 11:24:43,321 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2019-09-08 11:24:43,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:24:43,330 INFO L225 Difference]: With dead ends: 1898 [2019-09-08 11:24:43,331 INFO L226 Difference]: Without dead ends: 1614 [2019-09-08 11:24:43,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:24:43,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2019-09-08 11:24:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1604. [2019-09-08 11:24:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2019-09-08 11:24:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2487 transitions. [2019-09-08 11:24:43,431 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2487 transitions. Word has length 100 [2019-09-08 11:24:43,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:24:43,431 INFO L475 AbstractCegarLoop]: Abstraction has 1604 states and 2487 transitions. [2019-09-08 11:24:43,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:24:43,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2487 transitions. [2019-09-08 11:24:43,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 11:24:43,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:24:43,437 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:24:43,437 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:24:43,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:24:43,437 INFO L82 PathProgramCache]: Analyzing trace with hash 808827414, now seen corresponding path program 1 times [2019-09-08 11:24:43,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:24:43,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:24:43,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:43,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:24:43,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:24:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:24:43,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:24:43,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:24:43,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:24:43,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:24:43,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:24:43,622 INFO L87 Difference]: Start difference. First operand 1604 states and 2487 transitions. Second operand 6 states. [2019-09-08 11:24:44,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:24:44,280 INFO L93 Difference]: Finished difference Result 5563 states and 8748 transitions. [2019-09-08 11:24:44,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:24:44,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-09-08 11:24:44,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:24:44,314 INFO L225 Difference]: With dead ends: 5563 [2019-09-08 11:24:44,315 INFO L226 Difference]: Without dead ends: 4026 [2019-09-08 11:24:44,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:24:44,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4026 states. [2019-09-08 11:24:44,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4026 to 4022. [2019-09-08 11:24:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4022 states. [2019-09-08 11:24:44,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4022 states to 4022 states and 6312 transitions. [2019-09-08 11:24:44,578 INFO L78 Accepts]: Start accepts. Automaton has 4022 states and 6312 transitions. Word has length 101 [2019-09-08 11:24:44,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:24:44,579 INFO L475 AbstractCegarLoop]: Abstraction has 4022 states and 6312 transitions. [2019-09-08 11:24:44,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:24:44,580 INFO L276 IsEmpty]: Start isEmpty. Operand 4022 states and 6312 transitions. [2019-09-08 11:24:44,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 11:24:44,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:24:44,585 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:24:44,585 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:24:44,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:24:44,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1012476340, now seen corresponding path program 1 times [2019-09-08 11:24:44,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:24:44,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:24:44,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:44,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:24:44,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:24:44,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:24:44,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:24:44,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:24:44,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:24:44,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:24:44,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:24:44,718 INFO L87 Difference]: Start difference. First operand 4022 states and 6312 transitions. Second operand 5 states. [2019-09-08 11:24:45,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:24:45,571 INFO L93 Difference]: Finished difference Result 11244 states and 17732 transitions. [2019-09-08 11:24:45,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:24:45,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-08 11:24:45,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:24:45,611 INFO L225 Difference]: With dead ends: 11244 [2019-09-08 11:24:45,611 INFO L226 Difference]: Without dead ends: 7342 [2019-09-08 11:24:45,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:24:45,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7342 states. [2019-09-08 11:24:46,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7342 to 7340. [2019-09-08 11:24:46,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7340 states. [2019-09-08 11:24:46,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7340 states to 7340 states and 11515 transitions. [2019-09-08 11:24:46,072 INFO L78 Accepts]: Start accepts. Automaton has 7340 states and 11515 transitions. Word has length 101 [2019-09-08 11:24:46,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:24:46,072 INFO L475 AbstractCegarLoop]: Abstraction has 7340 states and 11515 transitions. [2019-09-08 11:24:46,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:24:46,072 INFO L276 IsEmpty]: Start isEmpty. Operand 7340 states and 11515 transitions. [2019-09-08 11:24:46,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 11:24:46,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:24:46,079 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:24:46,079 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:24:46,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:24:46,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1424572541, now seen corresponding path program 1 times [2019-09-08 11:24:46,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:24:46,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:24:46,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:46,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:24:46,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:24:46,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:24:46,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:24:46,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:24:46,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:24:46,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:24:46,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:24:46,197 INFO L87 Difference]: Start difference. First operand 7340 states and 11515 transitions. Second operand 5 states. [2019-09-08 11:24:47,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:24:47,113 INFO L93 Difference]: Finished difference Result 20899 states and 32884 transitions. [2019-09-08 11:24:47,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:24:47,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-08 11:24:47,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:24:47,185 INFO L225 Difference]: With dead ends: 20899 [2019-09-08 11:24:47,185 INFO L226 Difference]: Without dead ends: 13716 [2019-09-08 11:24:47,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:24:47,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13716 states. [2019-09-08 11:24:47,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13716 to 13714. [2019-09-08 11:24:47,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13714 states. [2019-09-08 11:24:48,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13714 states to 13714 states and 21475 transitions. [2019-09-08 11:24:48,003 INFO L78 Accepts]: Start accepts. Automaton has 13714 states and 21475 transitions. Word has length 101 [2019-09-08 11:24:48,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:24:48,003 INFO L475 AbstractCegarLoop]: Abstraction has 13714 states and 21475 transitions. [2019-09-08 11:24:48,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:24:48,004 INFO L276 IsEmpty]: Start isEmpty. Operand 13714 states and 21475 transitions. [2019-09-08 11:24:48,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 11:24:48,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:24:48,014 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:24:48,014 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:24:48,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:24:48,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1720838482, now seen corresponding path program 1 times [2019-09-08 11:24:48,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:24:48,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:24:48,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:48,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:24:48,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:24:48,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:24:48,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:24:48,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:24:48,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:24:48,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:24:48,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:24:48,139 INFO L87 Difference]: Start difference. First operand 13714 states and 21475 transitions. Second operand 5 states. [2019-09-08 11:24:50,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:24:50,036 INFO L93 Difference]: Finished difference Result 39888 states and 62627 transitions. [2019-09-08 11:24:50,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:24:50,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-08 11:24:50,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:24:50,110 INFO L225 Difference]: With dead ends: 39888 [2019-09-08 11:24:50,110 INFO L226 Difference]: Without dead ends: 26372 [2019-09-08 11:24:50,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:24:50,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26372 states. [2019-09-08 11:24:51,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26372 to 26370. [2019-09-08 11:24:51,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26370 states. [2019-09-08 11:24:51,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26370 states to 26370 states and 41249 transitions. [2019-09-08 11:24:51,224 INFO L78 Accepts]: Start accepts. Automaton has 26370 states and 41249 transitions. Word has length 101 [2019-09-08 11:24:51,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:24:51,224 INFO L475 AbstractCegarLoop]: Abstraction has 26370 states and 41249 transitions. [2019-09-08 11:24:51,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:24:51,224 INFO L276 IsEmpty]: Start isEmpty. Operand 26370 states and 41249 transitions. [2019-09-08 11:24:51,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 11:24:51,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:24:51,235 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:24:51,235 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:24:51,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:24:51,236 INFO L82 PathProgramCache]: Analyzing trace with hash 391178213, now seen corresponding path program 1 times [2019-09-08 11:24:51,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:24:51,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:24:51,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:51,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:24:51,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:24:51,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:24:51,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:24:51,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:24:51,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:24:51,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:24:51,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:24:51,327 INFO L87 Difference]: Start difference. First operand 26370 states and 41249 transitions. Second operand 5 states. [2019-09-08 11:24:53,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:24:53,974 INFO L93 Difference]: Finished difference Result 78416 states and 122777 transitions. [2019-09-08 11:24:53,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:24:53,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-08 11:24:53,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:24:54,144 INFO L225 Difference]: With dead ends: 78416 [2019-09-08 11:24:54,145 INFO L226 Difference]: Without dead ends: 52136 [2019-09-08 11:24:54,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:24:54,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52136 states. [2019-09-08 11:24:56,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52136 to 52134. [2019-09-08 11:24:56,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52134 states. [2019-09-08 11:24:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52134 states to 52134 states and 81197 transitions. [2019-09-08 11:24:56,520 INFO L78 Accepts]: Start accepts. Automaton has 52134 states and 81197 transitions. Word has length 101 [2019-09-08 11:24:56,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:24:56,520 INFO L475 AbstractCegarLoop]: Abstraction has 52134 states and 81197 transitions. [2019-09-08 11:24:56,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:24:56,520 INFO L276 IsEmpty]: Start isEmpty. Operand 52134 states and 81197 transitions. [2019-09-08 11:24:56,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:24:56,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:24:56,531 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:24:56,531 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:24:56,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:24:56,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1961452157, now seen corresponding path program 1 times [2019-09-08 11:24:56,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:24:56,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:24:56,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:56,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:24:56,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:24:56,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:24:56,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:24:56,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:24:56,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:24:56,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:24:56,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:24:56,625 INFO L87 Difference]: Start difference. First operand 52134 states and 81197 transitions. Second operand 5 states. [2019-09-08 11:25:00,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:00,872 INFO L93 Difference]: Finished difference Result 148303 states and 231108 transitions. [2019-09-08 11:25:00,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:25:00,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 11:25:00,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:01,091 INFO L225 Difference]: With dead ends: 148303 [2019-09-08 11:25:01,091 INFO L226 Difference]: Without dead ends: 96252 [2019-09-08 11:25:01,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:25:01,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96252 states. [2019-09-08 11:25:06,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96252 to 96250. [2019-09-08 11:25:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96250 states. [2019-09-08 11:25:06,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96250 states to 96250 states and 149426 transitions. [2019-09-08 11:25:06,466 INFO L78 Accepts]: Start accepts. Automaton has 96250 states and 149426 transitions. Word has length 102 [2019-09-08 11:25:06,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:06,467 INFO L475 AbstractCegarLoop]: Abstraction has 96250 states and 149426 transitions. [2019-09-08 11:25:06,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:25:06,467 INFO L276 IsEmpty]: Start isEmpty. Operand 96250 states and 149426 transitions. [2019-09-08 11:25:06,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:25:06,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:06,485 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:25:06,486 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:06,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:06,486 INFO L82 PathProgramCache]: Analyzing trace with hash 88707930, now seen corresponding path program 1 times [2019-09-08 11:25:06,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:06,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:06,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:06,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:06,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:06,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:25:06,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:06,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:25:06,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:25:06,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:25:06,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:25:06,592 INFO L87 Difference]: Start difference. First operand 96250 states and 149426 transitions. Second operand 5 states. [2019-09-08 11:25:14,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:14,259 INFO L93 Difference]: Finished difference Result 183740 states and 283907 transitions. [2019-09-08 11:25:14,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:25:14,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 11:25:14,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:14,658 INFO L225 Difference]: With dead ends: 183740 [2019-09-08 11:25:14,659 INFO L226 Difference]: Without dead ends: 183738 [2019-09-08 11:25:14,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:25:14,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183738 states. [2019-09-08 11:25:21,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183738 to 97306. [2019-09-08 11:25:21,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97306 states. [2019-09-08 11:25:22,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97306 states to 97306 states and 150482 transitions. [2019-09-08 11:25:22,094 INFO L78 Accepts]: Start accepts. Automaton has 97306 states and 150482 transitions. Word has length 102 [2019-09-08 11:25:22,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:22,095 INFO L475 AbstractCegarLoop]: Abstraction has 97306 states and 150482 transitions. [2019-09-08 11:25:22,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:25:22,095 INFO L276 IsEmpty]: Start isEmpty. Operand 97306 states and 150482 transitions. [2019-09-08 11:25:22,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 11:25:22,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:22,115 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:25:22,115 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:22,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:22,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1218901961, now seen corresponding path program 1 times [2019-09-08 11:25:22,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:22,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:22,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:22,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:22,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:22,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:25:22,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:22,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:25:22,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:25:22,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:25:22,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:25:22,413 INFO L87 Difference]: Start difference. First operand 97306 states and 150482 transitions. Second operand 10 states. [2019-09-08 11:25:54,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:54,867 INFO L93 Difference]: Finished difference Result 700308 states and 1082286 transitions. [2019-09-08 11:25:54,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 11:25:54,868 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2019-09-08 11:25:54,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:56,490 INFO L225 Difference]: With dead ends: 700308 [2019-09-08 11:25:56,490 INFO L226 Difference]: Without dead ends: 617208 [2019-09-08 11:25:56,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=377, Invalid=1183, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 11:25:57,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617208 states. [2019-09-08 11:26:13,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617208 to 97623. [2019-09-08 11:26:13,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97623 states. [2019-09-08 11:26:13,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97623 states to 97623 states and 150883 transitions. [2019-09-08 11:26:13,416 INFO L78 Accepts]: Start accepts. Automaton has 97623 states and 150883 transitions. Word has length 103 [2019-09-08 11:26:13,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:26:13,416 INFO L475 AbstractCegarLoop]: Abstraction has 97623 states and 150883 transitions. [2019-09-08 11:26:13,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:26:13,416 INFO L276 IsEmpty]: Start isEmpty. Operand 97623 states and 150883 transitions. [2019-09-08 11:26:13,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 11:26:13,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:26:13,432 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:26:13,432 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:26:13,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:26:13,432 INFO L82 PathProgramCache]: Analyzing trace with hash -21207177, now seen corresponding path program 1 times [2019-09-08 11:26:13,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:26:13,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:26:13,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:13,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:26:13,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:26:13,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:26:13,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:26:13,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:26:13,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:26:13,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:26:13,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:26:13,695 INFO L87 Difference]: Start difference. First operand 97623 states and 150883 transitions. Second operand 10 states. [2019-09-08 11:26:41,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:26:41,027 INFO L93 Difference]: Finished difference Result 379637 states and 582519 transitions. [2019-09-08 11:26:41,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 11:26:41,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2019-09-08 11:26:41,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:26:41,586 INFO L225 Difference]: With dead ends: 379637 [2019-09-08 11:26:41,586 INFO L226 Difference]: Without dead ends: 332543 [2019-09-08 11:26:41,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2019-09-08 11:26:41,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332543 states. [2019-09-08 11:26:52,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332543 to 98637. [2019-09-08 11:26:52,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98637 states. [2019-09-08 11:26:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98637 states to 98637 states and 152285 transitions. [2019-09-08 11:26:52,355 INFO L78 Accepts]: Start accepts. Automaton has 98637 states and 152285 transitions. Word has length 103 [2019-09-08 11:26:52,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:26:52,356 INFO L475 AbstractCegarLoop]: Abstraction has 98637 states and 152285 transitions. [2019-09-08 11:26:52,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:26:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 98637 states and 152285 transitions. [2019-09-08 11:26:52,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 11:26:52,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:26:52,370 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:26:52,370 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:26:52,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:26:52,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1333688087, now seen corresponding path program 1 times [2019-09-08 11:26:52,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:26:52,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:26:52,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:52,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:26:52,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:26:52,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:26:52,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:26:52,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:26:52,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:26:52,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:26:52,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:26:52,616 INFO L87 Difference]: Start difference. First operand 98637 states and 152285 transitions. Second operand 10 states. [2019-09-08 11:27:41,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:41,824 INFO L93 Difference]: Finished difference Result 530029 states and 811715 transitions. [2019-09-08 11:27:41,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 11:27:41,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2019-09-08 11:27:41,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:42,677 INFO L225 Difference]: With dead ends: 530029 [2019-09-08 11:27:42,677 INFO L226 Difference]: Without dead ends: 501035 [2019-09-08 11:27:42,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=326, Invalid=1080, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 11:27:43,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501035 states. [2019-09-08 11:27:59,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501035 to 100397. [2019-09-08 11:27:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100397 states. [2019-09-08 11:27:59,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100397 states to 100397 states and 154815 transitions. [2019-09-08 11:27:59,731 INFO L78 Accepts]: Start accepts. Automaton has 100397 states and 154815 transitions. Word has length 103 [2019-09-08 11:27:59,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:59,732 INFO L475 AbstractCegarLoop]: Abstraction has 100397 states and 154815 transitions. [2019-09-08 11:27:59,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:27:59,732 INFO L276 IsEmpty]: Start isEmpty. Operand 100397 states and 154815 transitions. [2019-09-08 11:27:59,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 11:27:59,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:59,752 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:27:59,752 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:59,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:59,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1161771337, now seen corresponding path program 1 times [2019-09-08 11:27:59,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:59,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:59,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:59,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:59,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:59,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:59,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:59,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:27:59,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:27:59,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:27:59,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:27:59,996 INFO L87 Difference]: Start difference. First operand 100397 states and 154815 transitions. Second operand 10 states. [2019-09-08 11:28:52,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:28:52,872 INFO L93 Difference]: Finished difference Result 518618 states and 797278 transitions. [2019-09-08 11:28:52,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 11:28:52,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2019-09-08 11:28:52,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:28:53,763 INFO L225 Difference]: With dead ends: 518618 [2019-09-08 11:28:53,764 INFO L226 Difference]: Without dead ends: 507702 [2019-09-08 11:28:53,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=696, Unknown=0, NotChecked=0, Total=930 [2019-09-08 11:28:54,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507702 states. [2019-09-08 11:29:11,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507702 to 100397. [2019-09-08 11:29:11,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100397 states. [2019-09-08 11:29:11,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100397 states to 100397 states and 154807 transitions. [2019-09-08 11:29:11,478 INFO L78 Accepts]: Start accepts. Automaton has 100397 states and 154807 transitions. Word has length 103 [2019-09-08 11:29:11,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:29:11,479 INFO L475 AbstractCegarLoop]: Abstraction has 100397 states and 154807 transitions. [2019-09-08 11:29:11,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:29:11,479 INFO L276 IsEmpty]: Start isEmpty. Operand 100397 states and 154807 transitions. [2019-09-08 11:29:11,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 11:29:11,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:29:11,495 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:29:11,495 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:29:11,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:29:11,495 INFO L82 PathProgramCache]: Analyzing trace with hash -652044329, now seen corresponding path program 1 times [2019-09-08 11:29:11,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:29:11,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:29:11,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:11,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:29:11,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:29:11,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:29:11,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:29:11,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:29:11,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:29:11,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:29:11,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:29:11,726 INFO L87 Difference]: Start difference. First operand 100397 states and 154807 transitions. Second operand 10 states. [2019-09-08 11:30:31,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:30:31,526 INFO L93 Difference]: Finished difference Result 723493 states and 1109524 transitions. [2019-09-08 11:30:31,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 11:30:31,527 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2019-09-08 11:30:31,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:30:32,499 INFO L225 Difference]: With dead ends: 723493 [2019-09-08 11:30:32,499 INFO L226 Difference]: Without dead ends: 658473 [2019-09-08 11:30:32,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 11:30:33,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658473 states. [2019-09-08 11:30:55,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658473 to 102059. [2019-09-08 11:30:55,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102059 states. [2019-09-08 11:30:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102059 states to 102059 states and 156998 transitions. [2019-09-08 11:30:55,979 INFO L78 Accepts]: Start accepts. Automaton has 102059 states and 156998 transitions. Word has length 103 [2019-09-08 11:30:55,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:30:55,979 INFO L475 AbstractCegarLoop]: Abstraction has 102059 states and 156998 transitions. [2019-09-08 11:30:55,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:30:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 102059 states and 156998 transitions. [2019-09-08 11:30:55,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 11:30:55,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:30:55,998 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:30:55,998 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:30:55,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:30:55,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2046428493, now seen corresponding path program 1 times [2019-09-08 11:30:55,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:30:55,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:30:56,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:30:56,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:30:56,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:30:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:30:56,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:30:56,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:30:56,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:30:56,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:30:56,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:30:56,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:30:56,278 INFO L87 Difference]: Start difference. First operand 102059 states and 156998 transitions. Second operand 10 states. [2019-09-08 11:32:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:32:11,734 INFO L93 Difference]: Finished difference Result 644544 states and 990844 transitions. [2019-09-08 11:32:11,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 11:32:11,734 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-09-08 11:32:11,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:32:12,698 INFO L225 Difference]: With dead ends: 644544 [2019-09-08 11:32:12,698 INFO L226 Difference]: Without dead ends: 547778 [2019-09-08 11:32:12,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 11:32:13,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547778 states. [2019-09-08 11:32:35,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547778 to 102851. [2019-09-08 11:32:35,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102851 states. [2019-09-08 11:32:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102851 states to 102851 states and 157919 transitions. [2019-09-08 11:32:35,861 INFO L78 Accepts]: Start accepts. Automaton has 102851 states and 157919 transitions. Word has length 104 [2019-09-08 11:32:35,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:32:35,862 INFO L475 AbstractCegarLoop]: Abstraction has 102851 states and 157919 transitions. [2019-09-08 11:32:35,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:32:35,862 INFO L276 IsEmpty]: Start isEmpty. Operand 102851 states and 157919 transitions. [2019-09-08 11:32:35,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 11:32:35,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:32:35,878 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:32:35,878 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:32:35,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:32:35,879 INFO L82 PathProgramCache]: Analyzing trace with hash -721392155, now seen corresponding path program 1 times [2019-09-08 11:32:35,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:32:35,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:32:35,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:35,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:35,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:32:36,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:32:36,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:32:36,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:32:36,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:32:36,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:32:36,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:32:36,208 INFO L87 Difference]: Start difference. First operand 102851 states and 157919 transitions. Second operand 4 states. [2019-09-08 11:33:01,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:33:01,470 INFO L93 Difference]: Finished difference Result 283399 states and 435889 transitions. [2019-09-08 11:33:01,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:33:01,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-08 11:33:01,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:33:01,729 INFO L225 Difference]: With dead ends: 283399 [2019-09-08 11:33:01,730 INFO L226 Difference]: Without dead ends: 188517 [2019-09-08 11:33:01,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:33:01,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188517 states. [2019-09-08 11:33:31,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188517 to 187491. [2019-09-08 11:33:31,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187491 states. [2019-09-08 11:33:31,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187491 states to 187491 states and 286463 transitions. [2019-09-08 11:33:31,737 INFO L78 Accepts]: Start accepts. Automaton has 187491 states and 286463 transitions. Word has length 104 [2019-09-08 11:33:31,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:33:31,737 INFO L475 AbstractCegarLoop]: Abstraction has 187491 states and 286463 transitions. [2019-09-08 11:33:31,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:33:31,738 INFO L276 IsEmpty]: Start isEmpty. Operand 187491 states and 286463 transitions. [2019-09-08 11:33:31,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 11:33:31,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:33:31,756 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:33:31,757 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:33:31,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:33:31,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1723337855, now seen corresponding path program 1 times [2019-09-08 11:33:31,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:33:31,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:33:31,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:33:31,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:33:31,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:33:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:33:31,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:33:31,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:33:31,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:33:31,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:33:31,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:33:31,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:33:31,817 INFO L87 Difference]: Start difference. First operand 187491 states and 286463 transitions. Second operand 3 states. [2019-09-08 11:34:06,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:34:06,916 INFO L93 Difference]: Finished difference Result 385347 states and 589567 transitions. [2019-09-08 11:34:06,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:34:06,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-08 11:34:06,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:34:07,259 INFO L225 Difference]: With dead ends: 385347 [2019-09-08 11:34:07,260 INFO L226 Difference]: Without dead ends: 245141 [2019-09-08 11:34:07,361 INFO L628 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 [2019-09-08 11:34:07,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245141 states. [2019-09-08 11:34:46,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245141 to 243523. [2019-09-08 11:34:46,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243523 states. [2019-09-08 11:34:47,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243523 states to 243523 states and 368483 transitions. [2019-09-08 11:34:47,026 INFO L78 Accepts]: Start accepts. Automaton has 243523 states and 368483 transitions. Word has length 104 [2019-09-08 11:34:47,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:34:47,027 INFO L475 AbstractCegarLoop]: Abstraction has 243523 states and 368483 transitions. [2019-09-08 11:34:47,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:34:47,027 INFO L276 IsEmpty]: Start isEmpty. Operand 243523 states and 368483 transitions. [2019-09-08 11:34:47,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 11:34:47,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:34:47,053 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:34:47,053 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:34:47,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:34:47,054 INFO L82 PathProgramCache]: Analyzing trace with hash -302600063, now seen corresponding path program 1 times [2019-09-08 11:34:47,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:34:47,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:34:47,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:34:47,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:34:47,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:34:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:34:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:34:47,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:34:47,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:34:47,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:34:47,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:34:47,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:34:47,125 INFO L87 Difference]: Start difference. First operand 243523 states and 368483 transitions. Second operand 3 states. [2019-09-08 11:35:33,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:35:33,885 INFO L93 Difference]: Finished difference Result 390053 states and 590323 transitions. [2019-09-08 11:35:33,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:35:33,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-08 11:35:33,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:35:34,317 INFO L225 Difference]: With dead ends: 390053 [2019-09-08 11:35:34,318 INFO L226 Difference]: Without dead ends: 286051 [2019-09-08 11:35:34,424 INFO L628 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 [2019-09-08 11:35:34,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286051 states. [2019-09-08 11:36:15,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286051 to 283633. [2019-09-08 11:36:15,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283633 states. [2019-09-08 11:36:16,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283633 states to 283633 states and 424183 transitions. [2019-09-08 11:36:16,178 INFO L78 Accepts]: Start accepts. Automaton has 283633 states and 424183 transitions. Word has length 104 [2019-09-08 11:36:16,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:36:16,179 INFO L475 AbstractCegarLoop]: Abstraction has 283633 states and 424183 transitions. [2019-09-08 11:36:16,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:36:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand 283633 states and 424183 transitions. [2019-09-08 11:36:16,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 11:36:16,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:36:16,197 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:36:16,197 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:36:16,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:36:16,197 INFO L82 PathProgramCache]: Analyzing trace with hash 689926226, now seen corresponding path program 1 times [2019-09-08 11:36:16,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:36:16,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:36:16,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:36:16,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:36:16,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:36:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:36:16,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:36:16,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:36:16,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:36:16,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:36:16,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:36:16,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:36:16,268 INFO L87 Difference]: Start difference. First operand 283633 states and 424183 transitions. Second operand 3 states.