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.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:39:01,916 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:39:01,918 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:39:01,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:39:01,931 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:39:01,932 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:39:01,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:39:01,936 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:39:01,937 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:39:01,938 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:39:01,939 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:39:01,940 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:39:01,941 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:39:01,941 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:39:01,942 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:39:01,943 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:39:01,944 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:39:01,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:39:01,947 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:39:01,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:39:01,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:39:01,951 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:39:01,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:39:01,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:39:01,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:39:01,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:39:01,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:39:01,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:39:01,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:39:01,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:39:01,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:39:01,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:39:01,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:39:01,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:39:01,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:39:01,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:39:01,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:39:01,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:39:01,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:39:01,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:39:01,964 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:39:01,964 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 10:39:01,979 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:39:01,979 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:39:01,981 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:39:01,981 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:39:01,981 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:39:01,981 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:39:01,982 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:39:01,982 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:39:01,982 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:39:01,982 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:39:01,982 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:39:01,983 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:39:01,983 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:39:01,983 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:39:01,983 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:39:01,983 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:39:01,984 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:39:01,984 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:39:01,984 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:39:01,984 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:39:01,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:39:01,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:39:01,985 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:39:01,985 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:39:01,985 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:39:01,985 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:39:01,986 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:39:01,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:39:01,986 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:39:02,015 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:39:02,027 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:39:02,031 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:39:02,032 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:39:02,032 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:39:02,033 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.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 10:39:02,094 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/100024a2d/1376918dac014324b3fd078c2e832d45/FLAG599857221 [2019-09-08 10:39:02,635 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:39:02,636 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 10:39:02,647 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/100024a2d/1376918dac014324b3fd078c2e832d45/FLAG599857221 [2019-09-08 10:39:02,897 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/100024a2d/1376918dac014324b3fd078c2e832d45 [2019-09-08 10:39:02,907 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:39:02,909 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:39:02,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:39:02,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:39:02,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:39:02,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:39:02" (1/1) ... [2019-09-08 10:39:02,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3840f152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:39:02, skipping insertion in model container [2019-09-08 10:39:02,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:39:02" (1/1) ... [2019-09-08 10:39:02,925 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:39:02,990 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:39:03,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:39:03,469 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:39:03,556 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:39:03,577 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:39:03,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:39:03 WrapperNode [2019-09-08 10:39:03,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:39:03,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:39:03,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:39:03,579 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:39:03,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:39:03" (1/1) ... [2019-09-08 10:39:03,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:39:03" (1/1) ... [2019-09-08 10:39:03,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:39:03" (1/1) ... [2019-09-08 10:39:03,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:39:03" (1/1) ... [2019-09-08 10:39:03,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:39:03" (1/1) ... [2019-09-08 10:39:03,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:39:03" (1/1) ... [2019-09-08 10:39:03,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:39:03" (1/1) ... [2019-09-08 10:39:03,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:39:03,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:39:03,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:39:03,661 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:39:03,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:39:03" (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 10:39:03,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:39:03,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:39:03,709 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:39:03,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:39:03,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:39:03,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:39:03,709 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:39:03,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:39:03,710 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:39:03,710 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:39:03,710 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:39:03,710 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:39:03,710 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:39:03,710 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:39:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:39:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:39:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:39:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:39:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:39:04,603 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:39:04,604 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:39:04,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:39:04 BoogieIcfgContainer [2019-09-08 10:39:04,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:39:04,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:39:04,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:39:04,611 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:39:04,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:39:02" (1/3) ... [2019-09-08 10:39:04,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a042ec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:39:04, skipping insertion in model container [2019-09-08 10:39:04,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:39:03" (2/3) ... [2019-09-08 10:39:04,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a042ec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:39:04, skipping insertion in model container [2019-09-08 10:39:04,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:39:04" (3/3) ... [2019-09-08 10:39:04,622 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 10:39:04,631 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:39:04,640 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:39:04,657 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:39:04,692 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:39:04,693 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:39:04,693 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:39:04,693 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:39:04,694 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:39:04,694 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:39:04,694 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:39:04,695 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:39:04,695 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:39:04,731 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states. [2019-09-08 10:39:04,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:39:04,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:39:04,740 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] [2019-09-08 10:39:04,742 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:39:04,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:39:04,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1532024012, now seen corresponding path program 1 times [2019-09-08 10:39:04,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:39:04,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:39:04,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:04,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:39:04,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:39:05,320 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 10:39:05,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:39:05,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:39:05,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:39:05,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:39:05,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:39:05,346 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 7 states. [2019-09-08 10:39:05,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:39:05,974 INFO L93 Difference]: Finished difference Result 1158 states and 1835 transitions. [2019-09-08 10:39:05,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:39:05,977 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-09-08 10:39:05,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:39:06,012 INFO L225 Difference]: With dead ends: 1158 [2019-09-08 10:39:06,012 INFO L226 Difference]: Without dead ends: 1025 [2019-09-08 10:39:06,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:39:06,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2019-09-08 10:39:06,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 515. [2019-09-08 10:39:06,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-09-08 10:39:06,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 790 transitions. [2019-09-08 10:39:06,164 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 790 transitions. Word has length 69 [2019-09-08 10:39:06,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:39:06,165 INFO L475 AbstractCegarLoop]: Abstraction has 515 states and 790 transitions. [2019-09-08 10:39:06,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:39:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 790 transitions. [2019-09-08 10:39:06,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:39:06,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:39:06,173 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] [2019-09-08 10:39:06,173 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:39:06,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:39:06,174 INFO L82 PathProgramCache]: Analyzing trace with hash -525222683, now seen corresponding path program 1 times [2019-09-08 10:39:06,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:39:06,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:39:06,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:06,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:39:06,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:39:06,480 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 10:39:06,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:39:06,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:39:06,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:39:06,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:39:06,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:39:06,484 INFO L87 Difference]: Start difference. First operand 515 states and 790 transitions. Second operand 6 states. [2019-09-08 10:39:06,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:39:06,782 INFO L93 Difference]: Finished difference Result 1840 states and 2857 transitions. [2019-09-08 10:39:06,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:39:06,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:39:06,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:39:06,794 INFO L225 Difference]: With dead ends: 1840 [2019-09-08 10:39:06,794 INFO L226 Difference]: Without dead ends: 1392 [2019-09-08 10:39:06,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:39:06,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2019-09-08 10:39:06,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1386. [2019-09-08 10:39:06,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1386 states. [2019-09-08 10:39:06,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2132 transitions. [2019-09-08 10:39:06,900 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2132 transitions. Word has length 70 [2019-09-08 10:39:06,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:39:06,901 INFO L475 AbstractCegarLoop]: Abstraction has 1386 states and 2132 transitions. [2019-09-08 10:39:06,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:39:06,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2132 transitions. [2019-09-08 10:39:06,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:39:06,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:39:06,908 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] [2019-09-08 10:39:06,909 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:39:06,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:39:06,909 INFO L82 PathProgramCache]: Analyzing trace with hash -550914758, now seen corresponding path program 1 times [2019-09-08 10:39:06,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:39:06,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:39:06,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:06,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:39:06,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:39:07,052 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 10:39:07,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:39:07,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:39:07,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:39:07,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:39:07,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:39:07,055 INFO L87 Difference]: Start difference. First operand 1386 states and 2132 transitions. Second operand 5 states. [2019-09-08 10:39:07,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:39:07,487 INFO L93 Difference]: Finished difference Result 3939 states and 6108 transitions. [2019-09-08 10:39:07,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:39:07,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 10:39:07,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:39:07,507 INFO L225 Difference]: With dead ends: 3939 [2019-09-08 10:39:07,507 INFO L226 Difference]: Without dead ends: 2592 [2019-09-08 10:39:07,510 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 10:39:07,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2019-09-08 10:39:07,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 2590. [2019-09-08 10:39:07,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2590 states. [2019-09-08 10:39:07,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 3986 transitions. [2019-09-08 10:39:07,682 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 3986 transitions. Word has length 71 [2019-09-08 10:39:07,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:39:07,683 INFO L475 AbstractCegarLoop]: Abstraction has 2590 states and 3986 transitions. [2019-09-08 10:39:07,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:39:07,684 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 3986 transitions. [2019-09-08 10:39:07,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:39:07,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:39:07,687 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] [2019-09-08 10:39:07,688 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:39:07,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:39:07,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1519127563, now seen corresponding path program 1 times [2019-09-08 10:39:07,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:39:07,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:39:07,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:07,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:39:07,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:39:07,847 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 10:39:07,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:39:07,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:39:07,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:39:07,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:39:07,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:39:07,850 INFO L87 Difference]: Start difference. First operand 2590 states and 3986 transitions. Second operand 6 states. [2019-09-08 10:39:08,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:39:08,542 INFO L93 Difference]: Finished difference Result 9597 states and 14820 transitions. [2019-09-08 10:39:08,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:39:08,543 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-08 10:39:08,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:39:08,577 INFO L225 Difference]: With dead ends: 9597 [2019-09-08 10:39:08,578 INFO L226 Difference]: Without dead ends: 7062 [2019-09-08 10:39:08,587 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 10:39:08,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7062 states. [2019-09-08 10:39:08,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7062 to 7058. [2019-09-08 10:39:08,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7058 states. [2019-09-08 10:39:09,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7058 states to 7058 states and 10841 transitions. [2019-09-08 10:39:09,021 INFO L78 Accepts]: Start accepts. Automaton has 7058 states and 10841 transitions. Word has length 71 [2019-09-08 10:39:09,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:39:09,023 INFO L475 AbstractCegarLoop]: Abstraction has 7058 states and 10841 transitions. [2019-09-08 10:39:09,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:39:09,023 INFO L276 IsEmpty]: Start isEmpty. Operand 7058 states and 10841 transitions. [2019-09-08 10:39:09,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:39:09,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:39:09,026 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] [2019-09-08 10:39:09,026 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:39:09,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:39:09,026 INFO L82 PathProgramCache]: Analyzing trace with hash 968007085, now seen corresponding path program 1 times [2019-09-08 10:39:09,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:39:09,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:39:09,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:09,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:39:09,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:39:09,142 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 10:39:09,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:39:09,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:39:09,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:39:09,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:39:09,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:39:09,144 INFO L87 Difference]: Start difference. First operand 7058 states and 10841 transitions. Second operand 6 states. [2019-09-08 10:39:10,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:39:10,398 INFO L93 Difference]: Finished difference Result 26540 states and 40818 transitions. [2019-09-08 10:39:10,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:39:10,398 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-08 10:39:10,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:39:10,494 INFO L225 Difference]: With dead ends: 26540 [2019-09-08 10:39:10,494 INFO L226 Difference]: Without dead ends: 19587 [2019-09-08 10:39:10,513 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 10:39:10,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19587 states. [2019-09-08 10:39:11,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19587 to 17403. [2019-09-08 10:39:11,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17403 states. [2019-09-08 10:39:11,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17403 states to 17403 states and 26636 transitions. [2019-09-08 10:39:11,504 INFO L78 Accepts]: Start accepts. Automaton has 17403 states and 26636 transitions. Word has length 71 [2019-09-08 10:39:11,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:39:11,505 INFO L475 AbstractCegarLoop]: Abstraction has 17403 states and 26636 transitions. [2019-09-08 10:39:11,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:39:11,505 INFO L276 IsEmpty]: Start isEmpty. Operand 17403 states and 26636 transitions. [2019-09-08 10:39:11,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:39:11,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:39:11,508 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] [2019-09-08 10:39:11,509 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:39:11,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:39:11,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1314156252, now seen corresponding path program 1 times [2019-09-08 10:39:11,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:39:11,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:39:11,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:11,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:39:11,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:39:11,621 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 10:39:11,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:39:11,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:39:11,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:39:11,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:39:11,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:39:11,623 INFO L87 Difference]: Start difference. First operand 17403 states and 26636 transitions. Second operand 6 states. [2019-09-08 10:39:14,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:39:14,009 INFO L93 Difference]: Finished difference Result 67282 states and 102884 transitions. [2019-09-08 10:39:14,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:39:14,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-08 10:39:14,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:39:14,173 INFO L225 Difference]: With dead ends: 67282 [2019-09-08 10:39:14,173 INFO L226 Difference]: Without dead ends: 49957 [2019-09-08 10:39:14,212 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 10:39:14,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49957 states. [2019-09-08 10:39:16,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49957 to 49953. [2019-09-08 10:39:16,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49953 states. [2019-09-08 10:39:16,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49953 states to 49953 states and 76000 transitions. [2019-09-08 10:39:16,362 INFO L78 Accepts]: Start accepts. Automaton has 49953 states and 76000 transitions. Word has length 71 [2019-09-08 10:39:16,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:39:16,362 INFO L475 AbstractCegarLoop]: Abstraction has 49953 states and 76000 transitions. [2019-09-08 10:39:16,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:39:16,362 INFO L276 IsEmpty]: Start isEmpty. Operand 49953 states and 76000 transitions. [2019-09-08 10:39:16,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:39:16,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:39:16,366 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] [2019-09-08 10:39:16,367 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:39:16,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:39:16,367 INFO L82 PathProgramCache]: Analyzing trace with hash -791998800, now seen corresponding path program 1 times [2019-09-08 10:39:16,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:39:16,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:39:16,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:16,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:39:16,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:39:16,474 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 10:39:16,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:39:16,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:39:16,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:39:16,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:39:16,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:39:16,476 INFO L87 Difference]: Start difference. First operand 49953 states and 76000 transitions. Second operand 5 states. [2019-09-08 10:39:19,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:39:19,785 INFO L93 Difference]: Finished difference Result 83093 states and 125717 transitions. [2019-09-08 10:39:19,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:39:19,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-08 10:39:19,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:39:20,016 INFO L225 Difference]: With dead ends: 83093 [2019-09-08 10:39:20,017 INFO L226 Difference]: Without dead ends: 83091 [2019-09-08 10:39:20,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 10:39:20,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83091 states. [2019-09-08 10:39:22,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83091 to 50745. [2019-09-08 10:39:22,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50745 states. [2019-09-08 10:39:22,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50745 states to 50745 states and 76558 transitions. [2019-09-08 10:39:22,483 INFO L78 Accepts]: Start accepts. Automaton has 50745 states and 76558 transitions. Word has length 72 [2019-09-08 10:39:22,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:39:22,483 INFO L475 AbstractCegarLoop]: Abstraction has 50745 states and 76558 transitions. [2019-09-08 10:39:22,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:39:22,483 INFO L276 IsEmpty]: Start isEmpty. Operand 50745 states and 76558 transitions. [2019-09-08 10:39:22,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:39:22,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:39:22,489 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] [2019-09-08 10:39:22,489 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:39:22,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:39:22,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1494388144, now seen corresponding path program 1 times [2019-09-08 10:39:22,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:39:22,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:39:22,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:22,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:39:22,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:39:22,607 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 10:39:22,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:39:22,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:39:22,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:39:22,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:39:22,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:39:22,609 INFO L87 Difference]: Start difference. First operand 50745 states and 76558 transitions. Second operand 4 states. [2019-09-08 10:39:26,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:39:26,643 INFO L93 Difference]: Finished difference Result 131848 states and 198339 transitions. [2019-09-08 10:39:26,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:39:26,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-09-08 10:39:26,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:39:26,876 INFO L225 Difference]: With dead ends: 131848 [2019-09-08 10:39:26,876 INFO L226 Difference]: Without dead ends: 82052 [2019-09-08 10:39:26,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:39:27,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82052 states. [2019-09-08 10:39:32,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82052 to 82050. [2019-09-08 10:39:32,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82050 states. [2019-09-08 10:39:32,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82050 states to 82050 states and 122698 transitions. [2019-09-08 10:39:32,285 INFO L78 Accepts]: Start accepts. Automaton has 82050 states and 122698 transitions. Word has length 73 [2019-09-08 10:39:32,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:39:32,286 INFO L475 AbstractCegarLoop]: Abstraction has 82050 states and 122698 transitions. [2019-09-08 10:39:32,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:39:32,286 INFO L276 IsEmpty]: Start isEmpty. Operand 82050 states and 122698 transitions. [2019-09-08 10:39:32,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:39:32,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:39:32,291 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] [2019-09-08 10:39:32,292 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:39:32,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:39:32,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1173196458, now seen corresponding path program 1 times [2019-09-08 10:39:32,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:39:32,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:39:32,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:32,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:39:32,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:39:32,385 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 10:39:32,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:39:32,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:39:32,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:39:32,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:39:32,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:39:32,387 INFO L87 Difference]: Start difference. First operand 82050 states and 122698 transitions. Second operand 7 states. [2019-09-08 10:39:46,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:39:46,732 INFO L93 Difference]: Finished difference Result 356968 states and 526239 transitions. [2019-09-08 10:39:46,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:39:46,733 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-08 10:39:46,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:39:47,291 INFO L225 Difference]: With dead ends: 356968 [2019-09-08 10:39:47,291 INFO L226 Difference]: Without dead ends: 289954 [2019-09-08 10:39:47,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:39:47,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289954 states. [2019-09-08 10:39:55,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289954 to 82080. [2019-09-08 10:39:55,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82080 states. [2019-09-08 10:39:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82080 states to 82080 states and 122734 transitions. [2019-09-08 10:39:55,430 INFO L78 Accepts]: Start accepts. Automaton has 82080 states and 122734 transitions. Word has length 74 [2019-09-08 10:39:55,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:39:55,430 INFO L475 AbstractCegarLoop]: Abstraction has 82080 states and 122734 transitions. [2019-09-08 10:39:55,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:39:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 82080 states and 122734 transitions. [2019-09-08 10:39:55,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:39:55,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:39:55,435 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] [2019-09-08 10:39:55,435 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:39:55,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:39:55,436 INFO L82 PathProgramCache]: Analyzing trace with hash 560209704, now seen corresponding path program 1 times [2019-09-08 10:39:55,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:39:55,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:39:55,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:55,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:39:55,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:39:55,523 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 10:39:55,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:39:55,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:39:55,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:39:55,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:39:55,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:39:55,525 INFO L87 Difference]: Start difference. First operand 82080 states and 122734 transitions. Second operand 3 states. [2019-09-08 10:40:01,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:40:01,735 INFO L93 Difference]: Finished difference Result 181578 states and 271310 transitions. [2019-09-08 10:40:01,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:40:01,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 10:40:01,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:40:01,970 INFO L225 Difference]: With dead ends: 181578 [2019-09-08 10:40:01,970 INFO L226 Difference]: Without dead ends: 115834 [2019-09-08 10:40:02,038 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 10:40:02,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115834 states. [2019-09-08 10:40:10,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115834 to 114499. [2019-09-08 10:40:10,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114499 states. [2019-09-08 10:40:10,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114499 states to 114499 states and 168893 transitions. [2019-09-08 10:40:10,344 INFO L78 Accepts]: Start accepts. Automaton has 114499 states and 168893 transitions. Word has length 74 [2019-09-08 10:40:10,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:40:10,344 INFO L475 AbstractCegarLoop]: Abstraction has 114499 states and 168893 transitions. [2019-09-08 10:40:10,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:40:10,345 INFO L276 IsEmpty]: Start isEmpty. Operand 114499 states and 168893 transitions. [2019-09-08 10:40:10,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:40:10,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:40:10,350 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] [2019-09-08 10:40:10,350 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:40:10,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:40:10,351 INFO L82 PathProgramCache]: Analyzing trace with hash 153092714, now seen corresponding path program 1 times [2019-09-08 10:40:10,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:40:10,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:40:10,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:10,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:40:10,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:40:10,408 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 10:40:10,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:40:10,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:40:10,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:40:10,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:40:10,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:40:10,410 INFO L87 Difference]: Start difference. First operand 114499 states and 168893 transitions. Second operand 3 states. [2019-09-08 10:40:17,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:40:17,898 INFO L93 Difference]: Finished difference Result 208178 states and 305993 transitions. [2019-09-08 10:40:17,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:40:17,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 10:40:17,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:40:18,108 INFO L225 Difference]: With dead ends: 208178 [2019-09-08 10:40:18,109 INFO L226 Difference]: Without dead ends: 139446 [2019-09-08 10:40:18,172 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 10:40:18,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139446 states. [2019-09-08 10:40:29,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139446 to 137725. [2019-09-08 10:40:29,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137725 states. [2019-09-08 10:40:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137725 states to 137725 states and 199399 transitions. [2019-09-08 10:40:29,258 INFO L78 Accepts]: Start accepts. Automaton has 137725 states and 199399 transitions. Word has length 74 [2019-09-08 10:40:29,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:40:29,259 INFO L475 AbstractCegarLoop]: Abstraction has 137725 states and 199399 transitions. [2019-09-08 10:40:29,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:40:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 137725 states and 199399 transitions. [2019-09-08 10:40:29,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:40:29,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:40:29,265 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] [2019-09-08 10:40:29,265 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:40:29,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:40:29,265 INFO L82 PathProgramCache]: Analyzing trace with hash 360963784, now seen corresponding path program 1 times [2019-09-08 10:40:29,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:40:29,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:40:29,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:29,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:40:29,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:40:29,352 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 10:40:29,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:40:29,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:40:29,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:40:29,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:40:29,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:40:29,354 INFO L87 Difference]: Start difference. First operand 137725 states and 199399 transitions. Second operand 7 states. [2019-09-08 10:41:24,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:24,705 INFO L93 Difference]: Finished difference Result 845482 states and 1216299 transitions. [2019-09-08 10:41:24,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:41:24,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-08 10:41:24,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:25,911 INFO L225 Difference]: With dead ends: 845482 [2019-09-08 10:41:25,912 INFO L226 Difference]: Without dead ends: 739450 [2019-09-08 10:41:26,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:41:26,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739450 states. [2019-09-08 10:41:39,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739450 to 137893. [2019-09-08 10:41:39,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137893 states. [2019-09-08 10:41:40,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137893 states to 137893 states and 199618 transitions. [2019-09-08 10:41:40,148 INFO L78 Accepts]: Start accepts. Automaton has 137893 states and 199618 transitions. Word has length 74 [2019-09-08 10:41:40,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:40,148 INFO L475 AbstractCegarLoop]: Abstraction has 137893 states and 199618 transitions. [2019-09-08 10:41:40,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:41:40,148 INFO L276 IsEmpty]: Start isEmpty. Operand 137893 states and 199618 transitions. [2019-09-08 10:41:40,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:41:40,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:40,153 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] [2019-09-08 10:41:40,153 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:40,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:40,154 INFO L82 PathProgramCache]: Analyzing trace with hash -914256502, now seen corresponding path program 1 times [2019-09-08 10:41:40,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:40,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:40,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:40,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:40,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:40,198 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 10:41:40,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:40,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:41:40,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:41:40,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:41:40,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:41:40,199 INFO L87 Difference]: Start difference. First operand 137893 states and 199618 transitions. Second operand 3 states. [2019-09-08 10:41:59,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:59,101 INFO L93 Difference]: Finished difference Result 345076 states and 499105 transitions. [2019-09-08 10:41:59,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:41:59,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 10:41:59,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:59,421 INFO L225 Difference]: With dead ends: 345076 [2019-09-08 10:41:59,421 INFO L226 Difference]: Without dead ends: 223040 [2019-09-08 10:41:59,788 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 10:41:59,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223040 states. [2019-09-08 10:42:20,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223040 to 222340. [2019-09-08 10:42:20,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222340 states. [2019-09-08 10:42:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222340 states to 222340 states and 317699 transitions. [2019-09-08 10:42:20,960 INFO L78 Accepts]: Start accepts. Automaton has 222340 states and 317699 transitions. Word has length 74 [2019-09-08 10:42:20,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:42:20,960 INFO L475 AbstractCegarLoop]: Abstraction has 222340 states and 317699 transitions. [2019-09-08 10:42:20,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:42:20,961 INFO L276 IsEmpty]: Start isEmpty. Operand 222340 states and 317699 transitions. [2019-09-08 10:42:20,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:42:20,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:42:20,966 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] [2019-09-08 10:42:20,966 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:42:20,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:42:20,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1454128726, now seen corresponding path program 1 times [2019-09-08 10:42:20,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:42:20,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:42:20,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:20,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:42:20,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:42:21,049 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 10:42:21,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:42:21,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:42:21,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:42:21,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:42:21,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:42:21,052 INFO L87 Difference]: Start difference. First operand 222340 states and 317699 transitions. Second operand 7 states. [2019-09-08 10:43:59,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:43:59,842 INFO L93 Difference]: Finished difference Result 1140067 states and 1615721 transitions. [2019-09-08 10:43:59,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:43:59,842 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-08 10:43:59,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:01,527 INFO L225 Difference]: With dead ends: 1140067 [2019-09-08 10:44:01,527 INFO L226 Difference]: Without dead ends: 1060611 [2019-09-08 10:44:01,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:44:02,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060611 states. [2019-09-08 10:44:36,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060611 to 222578. [2019-09-08 10:44:36,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222578 states. [2019-09-08 10:44:37,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222578 states to 222578 states and 318005 transitions. [2019-09-08 10:44:37,341 INFO L78 Accepts]: Start accepts. Automaton has 222578 states and 318005 transitions. Word has length 74 [2019-09-08 10:44:37,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:37,341 INFO L475 AbstractCegarLoop]: Abstraction has 222578 states and 318005 transitions. [2019-09-08 10:44:37,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:44:37,341 INFO L276 IsEmpty]: Start isEmpty. Operand 222578 states and 318005 transitions. [2019-09-08 10:44:37,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:44:37,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:37,348 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] [2019-09-08 10:44:37,348 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:37,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:37,348 INFO L82 PathProgramCache]: Analyzing trace with hash -776383725, now seen corresponding path program 1 times [2019-09-08 10:44:37,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:37,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:37,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:37,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:37,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:37,424 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 10:44:37,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:37,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:44:37,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:44:37,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:44:37,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:44:37,426 INFO L87 Difference]: Start difference. First operand 222578 states and 318005 transitions. Second operand 6 states. [2019-09-08 10:45:21,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:21,538 INFO L93 Difference]: Finished difference Result 550129 states and 787946 transitions. [2019-09-08 10:45:21,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:45:21,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-08 10:45:21,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:22,217 INFO L225 Difference]: With dead ends: 550129 [2019-09-08 10:45:22,217 INFO L226 Difference]: Without dead ends: 428812 [2019-09-08 10:45:22,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:45:23,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428812 states. [2019-09-08 10:45:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428812 to 253518. [2019-09-08 10:45:55,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253518 states. [2019-09-08 10:45:55,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253518 states to 253518 states and 362780 transitions. [2019-09-08 10:45:55,476 INFO L78 Accepts]: Start accepts. Automaton has 253518 states and 362780 transitions. Word has length 76 [2019-09-08 10:45:55,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:55,477 INFO L475 AbstractCegarLoop]: Abstraction has 253518 states and 362780 transitions. [2019-09-08 10:45:55,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:45:55,477 INFO L276 IsEmpty]: Start isEmpty. Operand 253518 states and 362780 transitions. [2019-09-08 10:45:55,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:45:55,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:55,484 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] [2019-09-08 10:45:55,484 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:55,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:55,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2051604011, now seen corresponding path program 1 times [2019-09-08 10:45:55,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:55,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:55,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:55,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:55,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:55,578 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 10:45:55,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:55,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:45:55,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:45:55,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:45:55,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:45:55,580 INFO L87 Difference]: Start difference. First operand 253518 states and 362780 transitions. Second operand 6 states. [2019-09-08 10:46:46,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:46:46,111 INFO L93 Difference]: Finished difference Result 568184 states and 814495 transitions. [2019-09-08 10:46:46,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:46:46,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-08 10:46:46,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:46:47,217 INFO L225 Difference]: With dead ends: 568184 [2019-09-08 10:46:47,218 INFO L226 Difference]: Without dead ends: 450358 [2019-09-08 10:46:47,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:46:47,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450358 states. [2019-09-08 10:47:24,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450358 to 281918. [2019-09-08 10:47:24,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281918 states. [2019-09-08 10:47:24,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281918 states to 281918 states and 403964 transitions. [2019-09-08 10:47:24,720 INFO L78 Accepts]: Start accepts. Automaton has 281918 states and 403964 transitions. Word has length 76 [2019-09-08 10:47:24,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:47:24,720 INFO L475 AbstractCegarLoop]: Abstraction has 281918 states and 403964 transitions. [2019-09-08 10:47:24,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:47:24,721 INFO L276 IsEmpty]: Start isEmpty. Operand 281918 states and 403964 transitions. [2019-09-08 10:47:24,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:47:24,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:47:24,728 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] [2019-09-08 10:47:24,728 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:47:24,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:47:24,729 INFO L82 PathProgramCache]: Analyzing trace with hash -793277035, now seen corresponding path program 1 times [2019-09-08 10:47:24,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:47:24,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:47:24,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:24,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:47:24,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:47:24,799 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 10:47:24,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:47:24,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:47:24,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:47:24,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:47:24,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:47:24,800 INFO L87 Difference]: Start difference. First operand 281918 states and 403964 transitions. Second operand 6 states. [2019-09-08 10:48:22,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:22,407 INFO L93 Difference]: Finished difference Result 551856 states and 790807 transitions. [2019-09-08 10:48:22,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:48:22,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-08 10:48:22,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:23,142 INFO L225 Difference]: With dead ends: 551856 [2019-09-08 10:48:23,142 INFO L226 Difference]: Without dead ends: 470334 [2019-09-08 10:48:23,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:48:23,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470334 states. [2019-09-08 10:48:58,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470334 to 314929. [2019-09-08 10:48:58,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314929 states. [2019-09-08 10:48:58,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314929 states to 314929 states and 451762 transitions. [2019-09-08 10:48:58,840 INFO L78 Accepts]: Start accepts. Automaton has 314929 states and 451762 transitions. Word has length 76 [2019-09-08 10:48:58,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:58,840 INFO L475 AbstractCegarLoop]: Abstraction has 314929 states and 451762 transitions. [2019-09-08 10:48:58,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:48:58,840 INFO L276 IsEmpty]: Start isEmpty. Operand 314929 states and 451762 transitions. [2019-09-08 10:48:58,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 10:48:58,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:58,851 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] [2019-09-08 10:48:58,851 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:58,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:58,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1975709726, now seen corresponding path program 1 times [2019-09-08 10:48:58,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:58,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:58,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:58,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:58,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:58,906 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 10:48:58,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:58,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:48:58,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:48:58,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:48:58,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:48:58,907 INFO L87 Difference]: Start difference. First operand 314929 states and 451762 transitions. Second operand 3 states. [2019-09-08 10:49:45,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:45,207 INFO L93 Difference]: Finished difference Result 507080 states and 723270 transitions. [2019-09-08 10:49:45,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:49:45,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 10:49:45,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:45,777 INFO L225 Difference]: With dead ends: 507080 [2019-09-08 10:49:45,778 INFO L226 Difference]: Without dead ends: 363186 [2019-09-08 10:49:45,897 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 10:49:46,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363186 states. [2019-09-08 10:50:23,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363186 to 322055. [2019-09-08 10:50:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322055 states. [2019-09-08 10:50:23,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322055 states to 322055 states and 455561 transitions. [2019-09-08 10:50:23,732 INFO L78 Accepts]: Start accepts. Automaton has 322055 states and 455561 transitions. Word has length 79 [2019-09-08 10:50:23,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:50:23,733 INFO L475 AbstractCegarLoop]: Abstraction has 322055 states and 455561 transitions. [2019-09-08 10:50:23,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:50:23,733 INFO L276 IsEmpty]: Start isEmpty. Operand 322055 states and 455561 transitions. [2019-09-08 10:50:23,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 10:50:23,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:50:23,744 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] [2019-09-08 10:50:23,744 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:50:23,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:50:23,744 INFO L82 PathProgramCache]: Analyzing trace with hash 873902620, now seen corresponding path program 1 times [2019-09-08 10:50:23,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:50:23,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:50:23,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:23,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:50:23,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:23,827 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 10:50:23,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:50:23,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:50:23,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:50:23,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:50:23,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:50:23,830 INFO L87 Difference]: Start difference. First operand 322055 states and 455561 transitions. Second operand 7 states.